A new approach to a multicriteria optimization problem

DOI10.1023/B:NUMA.0000021770.77789.B7MaRDI QIDQ596669zbMATH OpenOpenAlexFDO

Authors Wilfredo Sosa, Fernanda M. P. Raupp

Publication date 10 August 2004

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:numa.0000021770.77789.b7

zbMATH Keywords

analytic center cutting plane algorithmconvex feasibility problemMOLPmultiobjective optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Review text

In this paper, a new approach for multiobjective linear programming (MOLP) problems is suggested. Weakly efficient solutions are characterized with an equilibrium problem. Based on this, a variant of an analytic center cutting plane algorithm is suggested that can approximately find weakly efficient solutions.

Recommendations

• Normal cone method in solving linear multiobjective problems
• An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
• On minimization over weakly efficient sets
• Multiobjective optimization problems
• Optimization over the efficient set using an active constraint approach

Cited in

(8)

• An efficient approach to multicriteria optimum design problems
• A multicriteria approach to optimization of the gross domestic product
• scientific article; zbMATH DE number 5999312 (Why is no real title available?)
• New approaches to multi-objective optimization
• Alienor method to solve multi-objective linear programming (MOLP)
• Normal cone method in solving linear multiobjective problems
• On minimization over weakly efficient sets
• A new geometric approach to multiobjective linear programming problems

This page was built for publication: A new approach to a multicriteria optimization problem

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