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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical programming computation Ročník 11; číslo 2; s. 267 - 310
Hlavní autoři:	Yu, Bin, Mitchell, John E., Pang, Jong-Shi
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2019 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!