Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints
Article Abstract:
The modes to find the preferred solutions in dynamic programming problems under flexible constraints are studied in the context of LexiMin or DescriMin procedures, and the viability of Bellman optimality principle and fundamental dynamic programming algorithms
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
User Contributions:
Comment about this article or add new information about this topic:
Heuristic and stochastic methods in optimization
Article Abstract:
Optimization using heuristic and stochastic methods is analyzed.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Solving stochastic programming problems via Kalman filter and affine scaling. A genetic-based framework for solving (multi-criteria) weighted matching problems
- Abstracts: Dynamic programming for delayed product differentiation. Discrete dynamic programming with outcomes in random variable structures
- Abstracts: A note on two direct methods in linear programming. Location of slaughterhouses under economies of scale. Application of fuzzy optimization to diet problems in Argentinean farms
- Abstracts: Optimum choice. The building can be pre-assembled, shipped out to a remote place and built like meccano. Prefabricated timber panels allowed the structures to be erected quickly
- Abstracts: An exploratory examination of the influence of national culture on cross-national product diffusion. Service Quality Perceptions and Customer Satisfaction: Evaluating the Role of Culture