Solving linear programs with complementarity constraints using branch-and-cut

A linear program with linear complementarity constraints (LPCC) requires the minimization of a linear objective over a set of linear constraints together with additional linear complementarity constraints. This class has emerged as a modeling paradigm for a broad collection of problems, including bi...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematical programming computation Jg. 11; H. 2; S. 267 - 310
Hauptverfasser:	Yu, Bin, Mitchell, John E., Pang, Jong-Shi
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2019 Springer Nature B.V
Schlagworte:	Algorithms Computation Full Length Paper Game theory Integer programming Linear programming Mathematics Mathematics and Statistics Mathematics of Computing Operations Research/Decision Theory Optimization Theory of Computation Linear programs with complementarity constraints MPECs 90C57 90C33 65K10 90C26 Branch-and-cut
ISSN:	1867-2949, 1867-2957
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!