Bilevel programming for generating discrete representations in multiobjective optimization
From MaRDI portal
Recommendations
- Representation of the non-dominated set in biobjective discrete optimization
- Generating equidistant representations in biobjective programming
- On the quality of discrete representations in multiple objective programming
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- Linear bilevel programs with multiple objectives at the upper level
Cites work
- scientific article; zbMATH DE number 4191395 (Why is no real title available?)
- scientific article; zbMATH DE number 35514 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 1424524 (Why is no real title available?)
- scientific article; zbMATH DE number 3096290 (Why is no real title available?)
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- A bundle algorithm applied to bilevel programming problems with non-unique lower level solutions
- A complementarity constraint formulation of convex multiobjective optimization problems
- A constraint method in nonlinear multi-objective optimization
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
- Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation
- Algorithm robust for the bicriteria discrete optimization problem
- An Adaptive Scalarization Method in Multiobjective Optimization
- An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs
- Bishop-Phelps cones in optimization
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Descent approaches for quadratic bilevel programming
- Discrete linear bilevel programming problem
- Discrete representation of non-dominated sets in multi-objective linear programming
- Diversity Maximization Approach for Multiobjective Optimization
- Epsilon efficiency
- Equispaced Pareto front construction for constrained bi-objective optimization
- Exact and inexact penalty methods for the generalized bilevel programming problem
- Finding all efficient extreme points for multiple objective linear programs
- Finding representative systems for discrete bicriterion optimization problems
- Generating a representative subset of the nondominated frontier in multiple criteria decision making
- Generating equidistant representations in biobjective programming
- Global solution of bilevel programs with a nonconvex inner program
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Multicriteria Optimization
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- Nonlinear multiobjective optimization
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
- On the quality of discrete representations in multiple objective programming
- Representation of the non-dominated set in biobjective discrete optimization
- Some properties of the bilevel programming problem
- The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Towards finding global representations of the efficient set in multiple objective mathematical programming
- Variational Analysis
Cited in
(9)- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
- On the quality of discrete representations in multiple objective programming
- Designing an optimal contract mechanism in a cellulosic biofuel enterprise
- Generating equidistant representations in biobjective programming
- A solver for multiobjective mixed-integer convex and nonconvex optimization
- Advancements in the computation of enclosures for multi-objective optimization problems
- Computing representations using hypervolume scalarizations
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Generating representative sets for multiobjective discrete optimization problems with specified coverage errors
This page was built for publication: Bilevel programming for generating discrete representations in multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1646577)
