Bilevel programming for generating discrete representations in multiobjective optimization
From MaRDI portal
Publication:1646577
DOI10.1007/s10107-017-1149-0zbMath1391.90555OpenAlexW2607047547MaRDI QIDQ1646577
Publication date: 25 June 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://cdm21054.contentdm.oclc.org/cdm/ref/collection/IR/id/8209
representationmultiobjective optimizationbilevel programming problemnondominated setdecision makercoverage error
Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50)
Related Items (5)
Designing an optimal contract mechanism in a cellulosic biofuel enterprise ⋮ Computing representations using hypervolume scalarizations ⋮ Advancements in the computation of enclosures for multi-objective optimization problems ⋮ Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- Representation of the non-dominated set in biobjective discrete optimization
- On the quality of discrete representations in multiple objective programming
- Generating equidistant representations in biobjective programming
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Some properties of the bilevel programming problem
- Global solution of bilevel programs with a nonconvex inner program
- Epsilon efficiency
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Nonlinear multiobjective optimization
- Descent approaches for quadratic bilevel programming
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- A bundle algorithm applied to bilevel programming problems with non-unique lower level solutions
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
- Discrete representation of non-dominated sets in multi-objective linear programming
- Exact and inexact penalty methods for the generalized bilevel programming problem
- Discrete linear bilevel programming problem
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- Algorithm robust for the bicriteria discrete optimization problem
- Equispaced Pareto front construction for constrained bi-objective optimization
- Finding representative systems for discrete bicriterion optimization problems
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- A Complementarity Constraint Formulation of Convex Multiobjective Optimization Problems
- The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
- An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
- Diversity Maximization Approach for Multiobjective Optimization
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- An Adaptive Scalarization Method in Multiobjective Optimization
- A Constraint Method in Nonlinear Multi-Objective Optimization
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- Finding all efficient extreme points for multiple objective linear programs
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Towards finding global representations of the efficient set in multiple objective mathematical programming
- Variational Analysis
- Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making
- Multicriteria Optimization
- An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
This page was built for publication: Bilevel programming for generating discrete representations in multiobjective optimization
