Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
From MaRDI portal
Publication:1579631
DOI10.1023/A:1004657827134zbMath1028.90027OpenAlexW200655828MaRDI QIDQ1579631
Publication date: 27 January 2004
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1004657827134
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (5)
Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set ⋮ ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS ⋮ Primal and dual algorithms for optimization over the efficient set ⋮ Maximizing a linear fractional function on a Pareto efficient frontier ⋮ Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection
Cites Work
- 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
- Analysis of the objective space in multiple objective linear programming
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
- 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
- Linear multiobjective programming
- Vector maximization with two objective functions
- On the characterization of Pareto-optimal solutions in bicriterion optimization
- Hybrid approach for solving multiple-objective linear programs in outcome space
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
- The maximization of a function over the efficient set via a penalty function approach
- 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
- Optimizing a linear function over an efficient set
- Utility function programs and optimization over the efficient set in multiple-objective decision making
- A parametric simplex method for optimizing a linear function over the efficient set of bicriteria linear problem
- Generating the efficient outcome set in multiple objective linear programs: The bicriteria case
- Computational aspects of optimization problems over the efficient set
- Approximating the noninferior set in linear biobjective programs using multiparametric decomposition
- A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
- 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
- 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
- Optimization over the efficient set using an active constraint approach
- Bicriteria Transportation Problem
- A multi-run interactive method for bicriterion optimization problems
- An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems
- Algorithms for the vector maximization problem
- Solving Bicriterion Mathematical Programs
- Optimization over the efficient set
- Optimization over the efficient set
This page was built for publication: Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
