A multiple objective interactive Lagrangean relaxation approach

DOI10.1016/0377-2217(85)90311-XzbMath0551.90088OpenAlexW2071722210MaRDI QIDQ800836

Douglas J. White

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90311-x

zbMATH Keywords

Lagrange multipliersLagrangean relaxationmultiple criteriainteger scalar optimisationinteger vector optimisationinteractive branch and bound routine

Mathematics Subject Classification ID

Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Management decision making, including multiple objectives (90B50)

Related Items (5)

Zero-one programming with multiple criteria ⋮ Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic ⋮ A review of interactive methods for multiobjective integer and mixed-integer programming ⋮ Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem ⋮ An interactive procedure for multiple objective integer linear programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Epsilon efficiency
• Optimality and efficiency. I
• Multilevel programming, rational reaction sets, and efficient solutions
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Technical Note—Generalized Efficient Solutions for Sums of Sets
• A Survey of Lagrangean Techniques for Discrete Optimization

This page was built for publication: A multiple objective interactive Lagrangean relaxation approach