Multicriteria dynamic programming with an application to the integer case

DOI10.1007/BF00934322MaRDI QIDQ1158349zbMATH OpenFDO

Authors Mark H. Karwan, Bernardo Villarreal

Publication date 1982

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

lower boundsmulticriteria optimizationdiscrete optimizationupper boundscomputational results0-1 integer linear programmingelimination of inefficient subpoliciesgeneral recursive solution scheme

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Dynamic programming (90C39) Sensitivity, stability, parametric optimization (90C31) Integer programming (90C10) Boolean programming (90C09)

Cites work

• scientific article; zbMATH DE number 3566554 (Why is no real title available?)
• scientific article; zbMATH DE number 3599850 (Why is no real title available?)
• A Model for Aggregate Financial Planning
• A Survey of Multiple Criteria Integer Programming Methods
• A hybrid approach to discrete mathematical programming
• An Algorithm for Nonlinear Knapsack Problems
• An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
• An Interactive Programming Method for Solving the Multiple Criteria Problem
• Composition Principles for Synthesis of Optimal Multistage Processes
• Dynamic programming in multiplicative lattices
• Linear multiple objective programs with zero–one variables
• Linear programming with multiple objective functions: Step method (stem)
• New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
• On the reduction of dimensionality for classes of dynamic programming processes
• Preference Order Dynamic Programming
• Proper efficiency and the theory of vector maximization
• Scheduling to Minimize Interaction Cost
• The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Theory and algorithms for linear multiple objective programs with zero–one variables

Cited in

(17)

• Accounting for the time characteristics of a class of scheduling problems for moving processor
• Bicriterial servicing problems for stationary objects in a one-dimensional working zone of a processor
• An improved algorithm for solving biobjective integer programs
• Folk theorems in multicriteria repeated \(N\)-person games.
• Optimal stopping problems by two or more decision makers: a survey
• scientific article; zbMATH DE number 1423920 (Why is no real title available?)
• A mathematical programming approach to the computation of the omega invariant of a numerical semigroup
• Bound sets for biobjective combinatorial optimization problems
• Labeling algorithms for multiple objective integer knapsack problems
• Stationary object servicing dispatching problems in a one-dimensional processor working zone
• An algorithm for the multiple objective integer linear programming problem
• Network Models for Multiobjective Discrete Optimization
• Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems
• Multiple objectives and non-separability in stochastic dynamic programming
• An interactive dynamic programming approach to multicriteria discrete programming
• Theory and applications of generalized dynamic programming: An overview
• The multiscenario lot size problem with concave costs.

This page was built for publication: Multicriteria dynamic programming with an application to the integer case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1158349)