Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
From MaRDI portal
Publication:1908646
DOI10.1007/BF02192023zbMath0842.90099MaRDI QIDQ1908646
Harold P. Benson, Dongyeup Lee
Publication date: 6 August 1996
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
multiple criteria decision making; lower semicontinuous function; efficient set; bicriteria linear programming; finite, outcome-based algorithm
Related Items
A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem, Maximizing a linear fractional function on a Pareto efficient frontier, Optimization over the efficient set of a parametric multiple objective linear programming problem, Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, Quantitative parametric connections between methods for generating noninferior solutions in multiobjective optimization, 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, DC programming: overview., On optimization over the efficient set in linear multicriteria programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimization of a quasi-concave function over an efficient set
- Solving multiple objective linear programs in objective space
- Interactive multiple objective optimization: Survey. I: Continuous case
- Constructing the set of efficient objective values in multiple objective linear programs
- Theory of multiobjective optimization
- 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
- An algorithm for optimizing over the weakly-efficient set
- Analysis of the objective space in multiple objective linear programming
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
- Solving a bicriterion scheduling problem
- Multiobjective programming and planning
- Admissible points of a convex polyhedron
- An algorithm for bicriterion linear programming
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- Complete efficiency and the initialization of algorithms for multiple objective programming
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- Vector maximization with two objective functions
- On the characterization of Pareto-optimal solutions in bicriterion optimization
- A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
- The structure of admissible points with respect to cone dominance
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Optimization over the efficient set: Four special cases
- Handbook of global optimization
- A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
- Optimality conditions for minimization over the (weakly or properly) efficient set
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Optimization over the efficient set using an active constraint approach
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
- Bicriteria Transportation Problem
- An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems
- An Existence Theorem in Vector Optimization
- A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
- Algorithms for the vector maximization problem
- Solving Bicriterion Mathematical Programs
- Convex Analysis
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Linear programming with multiple objective functions: Step method (stem)
- An Algorithm for Solving Multicriterion Linear Programming Problems with Examples
- Optimization over the efficient set
