A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case

DOI10.1007/BF01100242zbMath0799.90101MaRDI QIDQ1207046

Harold P. Benson

Publication date: 4 May 1993

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

linear vector maximizationbisection-extreme point search algorithm

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set, Optimizing over the properly efficient set of convex multi-objective optimization problems, Optimizing a linear function over an efficient set, ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS, Unnamed Item, Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, Dual approach to minimization on the set of Pareto-optimal solutions, OOESAlgorithm.jl: a julia package for optimizing a linear function over the set of efficient solutions for biobjective mixed integer linear programming, The interactive analysis of the multicriteria shortest path problem by the reference point method., Computation of ideal and Nadir values and implications for their use in MCDM methods., Generating equidistant representations in biobjective programming, A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs, A new method for optimizing a linear function over the efficient set of a multiobjective integer program, A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem, Outcome-Space Polyblock Approximation Algorithm for Optimizing over Efficient Sets, Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, Computing the nadir point for multiobjective discrete optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Careful usage of pessimistic values is needed in multiple objectives optimization
• An algorithm for optimizing over the weakly-efficient set
• Computational experience concerning payoff tables and minimum criterion values over the efficient set
• Constrained global optimization: algorithms and applications
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• An all-linear programming relaxation algorithm for optimizing over the efficient set
• A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
• An Overview of Techniques for Solving Multiobjective Mathematical Programs
• Optimization over the efficient set using an active constraint approach
• Methods for Global Concave Minimization: A Bibliographic Survey
• Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• On Computing an Initial Efficient Extreme Point
• Finding all efficient extreme points for multiple objective linear programs
• Algorithms for the vector maximization problem
• The Direct Power of Adjacent Vertex Programming Methods
• Optimization over the efficient set