A multiple objective interactive Lagrangean relaxation approach

DOI10.1016/0377-2217(85)90311-XMaRDI QIDQ800836zbMATH OpenOpenAlexFDO

Authors D. 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

integer scalar optimisationinteger vector optimisationinteractive branch and bound routineLagrange multipliersLagrangean relaxationmultiple criteria

Mathematics Subject Classification ID

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

Review text

This paper extends the Lagrangean relaxation ideas for integer scalar optimisation problems to integer vector optimisation problems and incorporates an interactive branch and bound routine.

Cites work

• A Survey of Lagrangean Techniques for Discrete Optimization
• Epsilon efficiency
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• scientific article; zbMATH DE number 3856799 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• Multilevel programming, rational reaction sets, and efficient solutions
• Optimality and efficiency. I
• Technical Note—Generalized Efficient Solutions for Sums of Sets

Cited in

(9)

• Zero-one programming with multiple criteria
• An interactive multi-objective gradient search
• An interactive procedure for multiple objective integer linear programming problems
• Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
• LR-NIMBUS: an interactive algorithm for uncertain multiobjective optimization with lightly robust efficient solutions
• Synchronous approach in interactive multiobjective optimization
• Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem
• An augmented Lagrangian algorithm for multi-objective optimization
• A review of interactive methods for multiobjective integer and mixed-integer programming

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

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