Algorithms for linear programming with linear complementarity constraints

被引：7

作者：

Judice, Joaquim J. ^{[1
,2
]}

机构：

[1] Univ Coimbra, Dept Matemat, P-3001454 Coimbra, Portugal

[2] Inst Telecomunicacoes, P-3001454 Coimbra, Portugal

来源：

TOP | 2012年 / 20卷 / 01期

关键词：

Complementarity problems; Global optimization; Nonlinear programming; Mathematical programming with linear complementarity constraints; MATHEMATICAL PROGRAMS; OPTIMALITY CONDITIONS; GLOBAL OPTIMIZATION; STATIONARY POINT; BOUND ALGORITHM; CUT ALGORITHM; ELASTIC-MODE; BRANCH; CONVERGENCE;

D O I：

10.1007/s11750-011-0228-2

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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

页数：22

共 50 条

[31] ON THE SOLUTION AND COMPLEXITY OF A GENERALIZED LINEAR COMPLEMENTARITY-PROBLEM [J].

JUDICE, JJ ;

VICENTE, LN .

JOURNAL OF GLOBAL OPTIMIZATION, 1994, 4 (04) :415-424

[32] Two linear approximation algorithms for convex mixed integer nonlinear programming [J].

Melo, Wendel ;

Fampa, Marcia ;

Raupp, Fernanda .

ANNALS OF OPERATIONS RESEARCH, 2022, 316 (02) :1471-1491

[33] THE EXTENDED VERTICAL LINEAR COMPLEMENTARITY PROBLEM VIA TWO RANDOMIZED ALGORITHMS [J].

Li, Cui-Xia ;

Wu, Shi-Liang .

UNIVERSITY POLITEHNICA OF BUCHAREST SCIENTIFIC BULLETIN-SERIES A-APPLIED MATHEMATICS AND PHYSICS, 2025, 87 (02) :3-10

[34] Distributed algorithms for convex problems with linear coupling constraints [J].

Colombo, Tommaso ;

Sagratella, Simone .

JOURNAL OF GLOBAL OPTIMIZATION, 2020, 77 (01) :53-73

[35] A nonisolated optimal solution of general linear multiplicative programming problems [J].

Chen, Yongqiang ;

Jiao, Hongwei .

COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (09) :2573-2579

[36] AN EXACT ALGORITHM FOR LINEAR INTEGER PROGRAMMING PROBLEMS WITH DISTRIBUTIONALLY ROBUST CHANCE CONSTRAINTS [J].

Wang, Fenlan .

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2023, 19 (09) :6606-6617

[37] Interior Proximal Algorithm for Quasiconvex Programming Problems and Variational Inequalities with Linear Constraints [J].

Brito, Arnaldo S. ;

da Cruz Neto, J. X. ;

Lopes, Jurandir O. ;

Roberto Oliveira, P. .

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2012, 154 (01) :217-234

[38] Two-Level Linear Relaxation Method for Generalized Linear Fractional Programming [J].

Jiao, Hong-Wei ;

Shang, You-Lin .

JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2023, 11 (03) :569-594

[39] LINEAR MULTIPLICATIVE PROGRAMMING [J].

KONNO, H ;

KUNO, T .

MATHEMATICAL PROGRAMMING, 1992, 56 (01) :51-64

[40] Fast optimization algorithms for large-scale mixed-integer linear fractional programming problems [J].

Gao, Jiyao ;

You, Fengqi .

2015 AMERICAN CONTROL CONFERENCE (ACC), 2015, :5901-5906

← 1 2 3 4 5 →