Bilevel programming for generating discrete representations in multiobjective optimization
type: Item
instance of: scholarly article
title: Bilevel programming for generating discrete representations in multiobjective optimization
zbMATH Open document ID: 1391.90555
author: Gokhan Kirlik
author: Serpil Sayın
published in: Mathematical Programming. Series A. Series B
publication date: 2018-06-25T00:00:00Z
full work available at URL: http://cdm21054.contentdm.oclc.org/cdm/ref/collection/IR/id/8209
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90B50
zbMATH DE Number: 6894020
zbMATH Keywords: multiobjective optimization
zbMATH Keywords: decision maker
zbMATH Keywords: representation
zbMATH Keywords: nondominated set
zbMATH Keywords: coverage error
zbMATH Keywords: bilevel programming problem
describes a project that uses: ASMO
describes a project that uses: NBI
MaRDI profile type: Publication
OpenAlex ID: W2607047547
cites work: Some properties of the bilevel programming problem
cites work: Q3989989
cites work: Towards finding global representations of the efficient set in multiple objective mathematical programming
cites work: A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
cites work: A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
cites work: A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
cites work: Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
cites work: A bundle algorithm applied to bilevel programming problems with non-unique lower level solutions
cites work: Is bilevel programming a special case of a mathematical program with complementarity constraints?
cites work: On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
cites work: Finding all efficient extreme points for multiple objective linear programs
cites work: Multicriteria Optimization
cites work: Computation of ideal and Nadir values and implications for their use in MCDM methods.
cites work: An Adaptive Scalarization Method in Multiobjective Optimization
cites work: A Constraint Method in Nonlinear Multi-Objective Optimization
cites work: On the quality of discrete representations in multiple objective programming
cites work: Generating equidistant representations in biobjective programming
cites work: A Representation and Economic Interpretation of a Two-Level Programming Problem
cites work: Q4945771
cites work: An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
cites work: Finding representative systems for discrete bicriterion optimization problems
cites work: Q5835082
cites work: Q3997222
cites work: Q5393506
cites work: Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making
cites work: Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation
cites work: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
cites work: Algorithm robust for the bicriteria discrete optimization problem
cites work: A complementarity constraint formulation of convex multiobjective optimization problems
cites work: Exact and inexact penalty methods for the generalized bilevel programming problem
cites work: Diversity Maximization Approach for Multiobjective Optimization
cites work: Nonlinear multiobjective optimization
cites work: Global solution of bilevel programs with a nonconvex inner program
cites work: An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
cites work: Equispaced Pareto front construction for constrained bi-objective optimization
cites work: A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
cites work: Variational Analysis
cites work: An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
cites work: Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
cites work: A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
cites work: The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
cites work: Discrete representation of non-dominated sets in multi-objective linear programming
cites work: A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
cites work: Representation of the non-dominated set in biobjective discrete optimization
cites work: Descent approaches for quadratic bilevel programming
cites work: Discrete linear bilevel programming problem
cites work: Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
cites work: Q3211108
cites work: Epsilon efficiency
cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method
DOI: 10.1007/S10107-017-1149-0
description: scientific article; zbMATH DE number 6894020