Solving bilevel linear programs using multiple objective linear programming
type: Item
instance of: scholarly article
title: Solving bilevel linear programs using multiple objective linear programming
zbMATH Open document ID: 1163.90020
author: J. Glackin
author: J. G. Ecker
author: Michael Kupferschmid
published in: Journal of Optimization Theory and Applications
publication date: 2009-05-05T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 5550741
zbMATH Keywords: bilevel linear programming
zbMATH Keywords: multiple objective linear programming
zbMATH Keywords: efficient set
zbMATH Keywords: rational reaction set
zbMATH Keywords: simplex algorithm pivot
describes a project that uses: MacMPEC
describes a project that uses: NEOS
MaRDI profile type: Publication
full work available at URL: s10957-008-9467-2
OpenAlex ID: W2136118765
cites work: Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
cites work: Solving mathematical programs with complementarity constraints as nonlinear programs
cites work: A solution method for the linear static Stackelberg problem using penalty functions
cites work: Q3989989
cites work: A Representation and Economic Interpretation of a Two-Level Programming Problem
cites work: New Branch-and-Bound Rules for Linear Bilevel Programming
cites work: Existence of optimal solutions to mathematical programs with equilibrium constraints
cites work: A sequential LCP method for bilevel linear programming
cites work: Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
cites work: Q3815146
cites work: Finding all efficient extreme points for multiple objective linear programs
cites work: On Computing an Initial Efficient Extreme Point
cites work: A note on the Pareto optimality of solutions to the linear bilevel programming problem
cites work: Multicriteria approach to bilevel optimization
cites work: Algorithms for the vector maximization problem
cites work: An all-linear programming relaxation algorithm for optimizing over the efficient set
cites work: A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
cites work: Optimizing a linear function over an efficient set
cites work: A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
cites work: Optimizing Over the Efficient Set Using a Top-Down Search of Faces
cites work: Benchmarking optimization software with performance profiles.
cites work: Classification model selection via bilevel programming
DOI: 10.1007/S10957-008-9467-2
description: scientific article; zbMATH DE number 5550741