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 boundslower boundscomputational resultsdiscrete optimizationmulticriteria optimization0-1 integer linear programmingelimination of inefficient subpoliciesgeneral recursive solution scheme
Numerical mathematical programming methods (65K05) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Dynamic programming (90C39) Boolean programming (90C09)
Related Items
Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems ⋮ Unnamed Item ⋮ An improved algorithm for solving biobjective integer programs ⋮ Stationary object servicing dispatching problems in a one-dimensional processor working zone ⋮ Theory and applications of generalized dynamic programming: An overview ⋮ Bound sets for biobjective combinatorial optimization problems ⋮ Network Models for Multiobjective Discrete Optimization ⋮ 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 ⋮ An algorithm for the multiple objective integer linear programming problem ⋮ The multiscenario lot size problem with concave costs. ⋮ An interactive dynamic programming approach to multicriteria discrete programming ⋮ Optimal stopping problems by two or more decision makers: a survey ⋮ Multiple objectives and non-separability in stochastic dynamic programming ⋮ Labeling algorithms for multiple objective integer knapsack problems ⋮ Accounting for the time characteristics of a class of scheduling problems for moving processor ⋮ Folk theorems in multicriteria repeated \(N\)-person games.
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
