An all-linear programming relaxation algorithm for optimizing over the efficient set

DOI10.1007/BF00120667zbMath0739.90056MaRDI QIDQ1177916

Harold P. Benson

Publication date: 26 June 1992

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

zbMATH Keywords

relaxation algorithmConvergencemultiple criteria decision makingglobally optimal solutionefficient set of a multiple objective linear program

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Branch-and-bound decomposition approach for solving quasiconvex-concave programs, 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, Utility function programs and optimization over the efficient set in multiple-objective decision making, 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, Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets, On DC optimization algorithms for solving minmax flow problems, Existence results and optimization over the set of efficient solutions in vector-valued approximation theory, Connections between single-level and bilevel multiobjective optimization, Computation of ideal and Nadir values and implications for their use in MCDM methods., An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem, Criteria and dimension reduction of linear multiple criteria optimization problems, Simplicially-constrained DC optimization over efficient and weakly efficient sets, Optimization over equilibrium sets^∗, A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs, Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming, Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program, Primal and dual algorithms for optimization over the efficient set, On optimization over the efficient set in linear multicriteria programming, A new method for optimizing a linear function over the efficient set of a multiobjective integer program, Minimization of a quasi-concave function over an efficient set, A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case, Optimization over the efficient set, Maximizing a linear fractional function on a Pareto efficient frontier, A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem, Solving bilevel linear programs using multiple objective linear programming, The maximization of a function over the efficient set via a penalty function approach, Optimization over the efficient set of a parametric multiple objective linear programming problem, Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint, Numerical solution for optimization over the efficient set by d.c. optimization algorithms, Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, Maximizing a concave function over the efficient or weakly-efficient set, Combination between global and local methods for solving an optimization problem over the efficient set, Quadratic optimization over a discrete pareto set of a multi-objective linear fractional program, New closedness results for efficient sets in multiple objective mathematical programming, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program, Computing the nadir point for multiobjective discrete optimization problems, A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set, Necessary conditions for nonlinear suboptimization over the weakly- efficient set, Optimization over the efficient set: Four special cases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch and bound-outer approximation algorithm for concave minimization over a convex set
• Essays and surveys on multiple criteria decision making. Proceedings of the Fifth International Conference on Multiple Criteria Decision Making, Mons, Belgium, August 9-13, 1982
• Concave minimization via conical partitions and polyhedral outer approximation
• Careful usage of pessimistic values is needed in multiple objectives optimization
• Pairwise-comparison methods in multiple objective programming, with applications in a long-term energy-planning model
• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
• An algorithm for optimizing over the weakly-efficient set
• Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
• 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
• On the convergence of two branch-and-bound algorithms for nonconvex programming problems
• Infinitely constrained optimization problems
• Existence of efficient solutions for vector maximization problems
• An Overview of Techniques for Solving Multiobjective Mathematical Programs
• Deterministic methods in constrained global optimization: Some recent advances and new fields of application
• Jointly Constrained Biconvex Programming
• Methods for Global Concave Minimization: A Bibliographic Survey
• Convergent Algorithms for Minimizing a Concave Function
• An algorithm for nonconvex programming problems
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Algorithms for the vector maximization problem
• An Algorithm for Separable Nonconvex Programming Problems
• Linear programming with multiple objective functions: Step method (stem)
• An Algorithm for Solving Multicriterion Linear Programming Problems with Examples
• Optimization over the efficient set