A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set

DOI10.1007/BF00940077zbMath0794.90048OpenAlexW2093807570MaRDI QIDQ1321160

Harold P. Benson

Publication date: 27 April 1994

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

Full work available at URL: https://doi.org/10.1007/bf00940077

zbMATH Keywords

global optimizationefficient setmultiple-objective linear programnonadjacent extreme-point search algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Linear programming (90C05)

Related Items

Branch-and-bound decomposition approach for solving quasiconvex-concave programs, Optimizing over the properly efficient set of convex multi-objective optimization problems, Semivectorial bilevel optimization problem: penalty approach, Optimizing a linear function over an efficient set, 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, Optimization over the efficient set of multi-objective convex optimal control problems, Semivectorial bilevel optimization on Riemannian manifolds, Connections between single-level and bilevel multiobjective optimization, Parallel optimization over the integer efficient set, 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., Optimization over the Pareto front of nonconvex multi-objective optimal control problems, An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem, Generating equidistant representations in biobjective programming, Simplicially-constrained DC optimization over efficient and weakly efficient sets, Optimization over equilibrium sets^∗, Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem, A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs, A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem, Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program, Optimization over the efficient set, On optimization over the efficient set of a multiple objective linear programming problem, 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, A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem, Optimality Conditions for Semivectorial Bilevel Convex Optimal Control Problems, Post-Pareto analysis and a new algorithm for the optimal parameter tuning of the elastic net, Solving bilevel linear programs using multiple objective linear programming, Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case, Optimization over the efficient set of a parametric multiple objective linear programming problem, Use of \(P_ \tau\)-nets for the approximation of the Edgeworth-Pareto set in multicriteria optimization, 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, A linear fractional optimization over an integer efficient set, 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, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program, Computing the nadir point for multiobjective discrete optimization problems, Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case, 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• 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
• Multiobjective programming and planning
• An all-linear programming relaxation algorithm for optimizing over the efficient set
• Existence of efficient solutions for vector maximization problems
• A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
• An Overview of Techniques for Solving Multiobjective Mathematical Programs
• Deterministic methods in constrained global optimization: Some recent advances and new fields of application
• An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
• 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
• Convex Analysis
• Linear programming with multiple objective functions: Step method (stem)
• Problems and methods with multiple objective functions
• An Algorithm for Solving Multicriterion Linear Programming Problems with Examples
• Optimization over the efficient set