Theory and applications of generalized dynamic programming: An overview
From MaRDI portal
Publication:1119492
DOI10.1016/0898-1221(88)90188-5zbMath0671.90094OpenAlexW2044151054MaRDI QIDQ1119492
Thomas L. Morin, Robert L. Carraway
Publication date: 1988
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(88)90188-5
monotonicitymulticriteria optimizationBellman's principle of optimalitygeneralized preference structuresMitten's preference order DP
Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Stochastic programming (90C15) Dynamic programming (90C39) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Theory and applications of generalized dynamic programming: An overview ⋮ An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns ⋮ Generalized dynamic programming for multicriteria optimization ⋮ Extension of dynamic programming to nonseparable dynamic optimization problems ⋮ An elimination condition to check the validity of the principle of optimality ⋮ Dynamic programming approach to multiple objective control problem having deterministic or fuzzy goals ⋮ Fuzzy shortest paths
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Potential solutions of linear systems: the multi-criteria multiple constraint levels program
- Theory and applications of generalized dynamic programming: An overview
- Some comments on preference order dynamic programming models
- Multicriteria dynamic programming with an application to the integer case
- An interactive dynamic programming approach to multicriteria discrete programming
- Dynamic programming and principles of optimality
- Monotonicity and the principle of optimality
- Dynamic programming in multiplicative lattices
- A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards
- Discrete Dynamic Programming and Capital Allocation
- Generalized Dynamic Programming for Stochastic Combinatorial Optimization
- Vector-Valued Dynamic Programming
- The Principle of Optimality in Dynamic Programming with Returns in Partially Ordered Sets
- A Dynamic Programming Approach to Stochastic Assembly Line Balancing
- A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem
- Note on Multiple Objective Dynamic Programming
- Technical Note—Generalized Efficient Solutions for Sums of Sets
- Preference Order Stochastic Knapsack Problems: Methodological Issues
- A multiobjective dynamic programming method for capacity expansion
- Analysis of a Preference Order Assembly Line Problem
- Technical Note—Analysis of a Preference Order Traveling Salesman Problem
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- Preference Order Dynamic Programming
- Ordinal Dynamic Programming
- Technical Note—A Recursion Algorithm for Finding Pure Admissible Decision Functions in Statistical Decisions
- A Preference Order Dynamic Program for Stochastic Assembly Line Balancing
- An Algorithm for Nonlinear Knapsack Problems
- Composition Principles for Synthesis of Optimal Multistage Processes
- Contraction Mappings in the Theory Underlying Dynamic Programming
