The maximization of a function over the efficient set via a penalty function approach
From MaRDI portal
Publication:1278284
DOI10.1016/0377-2217(95)00184-0zbMath0918.90126OpenAlexW2065981317MaRDI QIDQ1278284
Publication date: 27 April 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00184-0
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, Parallel optimization over the integer efficient set, On minimization over weakly efficient sets, Optimizing a linear function over an integer efficient set, 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, The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program, A cutting plane approach for multi-objective integer indefinite quadratic programming problem
Cites Work
- Unnamed Item
- Epsilon efficiency
- An algorithm for optimizing over the weakly-efficient set
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- A note on the solution of bilinear programming problems by reduction to concave minimization
- Optimality and efficiency. I
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- On solving a d.c. programming problem by a sequence of linear programs
- A linear programming approach to solving bilinear programmes
- Solving bi-level linear programmes
- Proper efficiency and the theory of vector maximization
- Transformations by diagonal matrices in a normed space
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- A cutting plane algorithm for solving bilinear programs
- Bilinear programming: An exact algorithm
- A linear max—min problem
- On a Markov Decision Process problem involving the Maximum of the Difference between two functions: Technical Note
- Algorithms for the vector maximization problem
- Finite Horizon Markov Decision Processes with Uncertain Terminal Payoffs
- A Decomposable Nonlinear Programming Approach
- A solution method for the linear static Stackelberg problem using penalty functions
- Optimization over the efficient set
