An algorithm for optimizing over the weakly-efficient set
From MaRDI portal
Publication:1077330
DOI10.1016/0377-2217(86)90085-8zbMath0594.90082OpenAlexW2021615962MaRDI QIDQ1077330
Publication date: 1986
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(86)90085-8
numerical methodvector optimizationefficiencylinearnonconvexprogrammingweakly efficient pointsmultiple objective linear programmingbounded polyhedral constraints
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)
Related Items
Optimizing over the properly efficient set of convex multi-objective optimization problems, Utility function programs and optimization over the efficient set in multiple-objective decision making, A vector variational inequality and optimization over an efficient set, Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, 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, An all-linear programming relaxation algorithm for optimizing over the efficient set, A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem, An interior point algorithm for convex quadratic programming with strict equilibrium constraints, On optimization over the efficient set of a multiple objective linear programming problem, 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, Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem, On minimization over weakly efficient sets, Technical efficiency and distance to a reverse convex set, Second-order efficiency conditions and sensitivity of efficient points, The maximization of a function over the efficient set via a penalty function approach, Solving Optimization Problems over the Weakly Efficient Set, Optimization over the efficient set of a parametric multiple objective linear programming problem, Optimization of a linear function on the set of efficient solutions of a multicriterion convex quadratic problem, Necessary conditions for nonlinear suboptimization over the weakly- efficient set, Optimization over the efficient set: Four special cases, An algorithm for systems welfare interactive goal programming modelling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasi-concave minimization subject to linear constraints
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Generating all maximal efficient faces for multiple objective linear programs
- A finite algorithm for concave minimization over a polyhedron
- An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
- Multiple Objective Linear Programming with Interval Criterion Weights
- An Interactive Programming Method for Solving the Multiple Criteria Problem
- Global Maximization of a Convex Function with Linear Inequality Constraints
- Variations on a cutting plane method for solving concave minimization problems with linear constraints
- A Successive Underestimation Method for Concave Minimization Problems
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- ON LINEAR VECTOR MAXIMIZATION PROBLEMS
- Finding all efficient extreme points for multiple objective linear programs
- Concave minimization over a convex polyhedron
- Algorithms for the vector maximization problem
- Optimization over the efficient set
