Optimizing a linear function over an efficient set
From MaRDI portal
Publication:1342462
DOI10.1007/BF02207641zbMath0813.90101OpenAlexW2029209503MaRDI QIDQ1342462
Publication date: 30 May 1995
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02207641
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Linear programming (90C05)
Related Items
Optimizing over the properly efficient set of convex multi-objective optimization problems, Optimizing a linear function over the nondominated set of multiobjective integer programs, Optimization Over Stochastic Integer Efficient Set, Connections between single-level and bilevel multiobjective optimization, Parallel optimization over the integer efficient set, 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, 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, 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, An improved algorithm to compute the \(\omega\)-primality, A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem, Solving bilevel programming problems with multicriteria optimization techniques, Optimizing a linear function over an integer efficient set, Biobjective optimization over the efficient set of multiobjective integer programming problem, Optimization of a linear function over the set of stochastic efficient solutions, Outcome-Space Polyblock Approximation Algorithm for Optimizing over Efficient Sets, Solving bilevel linear programs using multiple objective linear programming, Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint, 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, Quantitative parametric connections between methods for generating noninferior solutions in multiobjective optimization, Quadratic optimization over a discrete pareto set of a multi-objective linear fractional program, 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficiency and proper efficiency in vector maximization with respect to cones
- Careful usage of pessimistic values is needed in multiple objectives optimization
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- 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
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Existence of efficient solutions for vector maximization problems
- Generating all maximal efficient faces for multiple objective linear programs
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
- On Computing an Initial Efficient Extreme Point
- Finding all efficient extreme points for multiple objective linear programs
- A revised simplex method for linear multiple objective programs
- Algorithms for the vector maximization problem
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- Optimization over the efficient set
