An all-linear programming relaxation algorithm for optimizing over the efficient set
From MaRDI portal
Recommendations
- Optimizing a linear function over an efficient set
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
- Optimization over the efficient set: Four special cases
Cites work
- scientific article; zbMATH DE number 3945836 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Algorithms for the vector maximization problem
- An Algorithm for Separable Nonconvex Programming Problems
- An Algorithm for Solving Multicriterion Linear Programming Problems with Examples
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- An algorithm for nonconvex programming problems
- An algorithm for optimizing over the weakly-efficient set
- Careful usage of pessimistic values is needed in multiple objectives optimization
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Concave minimization via conical partitions and polyhedral outer approximation
- Constrained global optimization: algorithms and applications
- Convergent Algorithms for Minimizing a Concave Function
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- Essays and surveys on multiple criteria decision making. Proceedings of the Fifth International Conference on Multiple Criteria Decision Making, Mons, Belgium, August 9-13, 1982
- Existence of efficient solutions for vector maximization problems
- Infinitely constrained optimization problems
- Jointly Constrained Biconvex Programming
- Linear programming with multiple objective functions: Step method (stem)
- Methods for Global Concave Minimization: A Bibliographic Survey
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- On the convergence of two branch-and-bound algorithms for nonconvex programming problems
- Optimization over the efficient set
- Pairwise-comparison methods in multiple objective programming, with applications in a long-term energy-planning model
Cited in
(49)- An algorithm to solve polyhedral convex set optimization problems
- New closedness results for efficient sets in multiple objective mathematical programming
- On DC optimization algorithms for solving minmax flow problems
- Maximizing a linear fractional function on a Pareto efficient frontier
- Quadratic optimization over a discrete Pareto set of a multi-objective linear fractional program
- Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming
- Solving bilevel linear programs using multiple objective linear programming
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
- scientific article; zbMATH DE number 219844 (Why is no real title available?)
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
- Criteria and dimension reduction of linear multiple criteria optimization problems
- Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- The maximization of a function over the efficient set via a penalty function approach
- Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- Simplicially-constrained DC optimization over efficient and weakly efficient sets
- An algorithm for optimizing over the efficient set
- Conical algorithm in global optimization for optimizing over efficient sets
- Optimization over the efficient set: Four special cases
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Optimizing a linear function over an efficient set
- Utility function programs and optimization over the efficient set in multiple-objective decision making
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
- Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program
- scientific article; zbMATH DE number 592648 (Why is no real title available?)
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Optimization over the efficient set
- Connections between single-level and bilevel multiobjective optimization
- Minimization of a quasi-concave function over an efficient set
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- Branch-and-bound decomposition approach for solving quasiconvex-concave programs
- Existence results and optimization over the set of efficient solutions in vector-valued approximation theory
- Optimization over equilibrium sets∗
- On optimization over the efficient set in linear multicriteria programming
- Primal and dual algorithms for optimization over the efficient set
- Necessary conditions for nonlinear suboptimization over the weakly- efficient set
- Combination between global and local methods for solving an optimization problem over the efficient set
- Maximizing a concave function over the efficient or weakly-efficient set
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Dual approach to minimization on the set of Pareto-optimal solutions
- An efficient branch-and-bound algorithm to optimize a function over a nondominated set
- Computing the nadir point for multiobjective discrete optimization problems
- Optimization over the efficient set of a parametric multiple objective linear programming problem
- Optimizing over the properly efficient set of convex multi-objective optimization problems
- A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
- ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS
This page was built for publication: An all-linear programming relaxation algorithm for optimizing over the efficient set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1177916)
