Multicriteria dynamic programming with an application to the integer case
From MaRDI portal
Publication:1158349
DOI10.1007/BF00934322zbMath0472.90071MaRDI QIDQ1158349
Mark H. Karwan, Bernardo Villarreal
Publication date: 1982
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
upper bounds; lower bounds; computational results; discrete optimization; multicriteria optimization; 0-1 integer linear programming; elimination of inefficient subpolicies; general recursive solution scheme
65K05: Numerical mathematical programming methods
90C10: Integer programming
90C31: Sensitivity, stability, parametric optimization
90C39: Dynamic programming
90C09: Boolean programming
Related Items
Unnamed Item, Network Models for Multiobjective Discrete Optimization, Multiple objectives and non-separability in stochastic dynamic programming, Accounting for the time characteristics of a class of scheduling problems for moving processor, Stationary object servicing dispatching problems in a one-dimensional processor working zone, Bicriterial servicing problems for stationary objects in a one-dimensional working zone of a processor, A mathematical programming approach to the computation of the omega invariant of a numerical semigroup, Bound sets for biobjective combinatorial optimization problems, Optimal stopping problems by two or more decision makers: a survey, Labeling algorithms for multiple objective integer knapsack problems, Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems, Theory and applications of generalized dynamic programming: An overview, An algorithm for the multiple objective integer linear programming problem, An interactive dynamic programming approach to multicriteria discrete programming, The multiscenario lot size problem with concave costs., Folk theorems in multicriteria repeated \(N\)-person games., An improved algorithm for solving biobjective integer programs
Cites Work
- Unnamed Item
- Unnamed Item
- On the reduction of dimensionality for classes of dynamic programming processes
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions
- Dynamic programming in multiplicative lattices
- Proper efficiency and the theory of vector maximization
- A Survey of Multiple Criteria Integer Programming Methods
- Theory and algorithms for linear multiple objective programs with zero–one variables
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- Preference Order Dynamic Programming
- An Interactive Programming Method for Solving the Multiple Criteria Problem
- An Algorithm for Nonlinear Knapsack Problems
- Linear multiple objective programs with zero–one variables
- A hybrid approach to discrete mathematical programming
- Composition Principles for Synthesis of Optimal Multistage Processes
- Scheduling to Minimize Interaction Cost
- A Model for Aggregate Financial Planning
- Linear programming with multiple objective functions: Step method (stem)
- An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
