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

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming computation Vol. 11; no. 2; pp. 267 - 310
Main Authors:	Yu, Bin, Mitchell, John E., Pang, Jong-Shi
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2019 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!