Algorithms for linear programming with linear complementarity constraints

被引：0
|
作者：
Joaquim J. Júdice
机构：
[1] Departamento de Matemática da Universidade de Coimbra and Instituto de Telecomunicações,
来源：
TOP | 2012年 / 20卷
关键词：
Complementarity problems; Global optimization; Nonlinear programming; Mathematical programming with linear complementarity constraints; 90C26; 90C30; 90C33;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Linear programming with linear complementarity constraints (LPLCC) is an area of active research in Optimization, due to its many applications, algorithms, and theoretical existence results. In this paper, a number of formulations for important nonconvex optimization problems are first reviewed. The most relevant algorithms for computing a complementary feasible solution, a stationary point, and a global minimum for the LPLCC are also surveyed, together with some comments about their efficiency and efficacy in practice.
引用
收藏
页码：4 / 25
页数：21
相关论文
共 50 条
12345