Further analysis of an outcome set-based algorithm for multiple-objective linear programming

DOI10.1023/A:1022614814789zbMath0907.90228OpenAlexW90641487MaRDI QIDQ1264984

Harold P. Benson

Publication date: 11 February 1999

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

Full work available at URL: https://doi.org/10.1023/a:1022614814789

zbMATH Keywords

multiple-objective linear programmingefficient setsouter-approximation algorithmsweakly efficient sets

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05)

Related Items

ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS, Adjacency based method for generating maximal efficient faces in multiobjective linear programming, A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming, Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem, The vector linear program solver Bensolve -- notes on theoretical background, An algorithm to solve polyhedral convex set optimization problems, Set Optimization—A Rather Short Introduction, Benson type algorithms for linear vector optimization and applications, Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case, Outcome space partition of the weight set in multiobjective linear programming, Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of multiobjective optimization
• Multiobjective programming and planning
• Using efficient feasible directions in interactive multiple objective linear programming
• A simplified MOLP algorithm: The MOLP-S procedure
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Linear multiobjective programming
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• Generating all maximal efficient faces for multiple objective linear programs
• Finding all maximal efficient faces in multiobjective linear programming
• Determination of the efficient set in multiobjective linear programming
• Generating the efficient outcome set in multiple objective linear programs: The bicriteria case
• A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
• An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
• Multiple Objective Linear Programming with Parametric Criteria Coefficients
• An Overview of Techniques for Solving Multiobjective Mathematical Programs
• Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
• ON LINEAR VECTOR MAXIMIZATION PROBLEMS
• Finding all efficient extreme points for multiple objective linear programs
• Algorithms for the vector maximization problem
• Convex Analysis