On the Global Solution of Linear Programs with Linear Complementarity Constraints
From MaRDI portal
Publication:3608991
DOI10.1137/07068463xzbMath1163.90031OpenAlexW2028042462MaRDI QIDQ3608991
Kristin P. Bennett, Jong-Shi Pang, Gautam Kunapuli, Jing Hu, John E. Mitchell
Publication date: 6 March 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bc9bd2d2ceb3b8700a97ff130caca9061dcbfe2a
Integer programming (90C10) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
An SOS1-based approach for solving MPECs with a natural gas market application, A pivoting algorithm for linear programming with linear complementarity constraints, A class of quadratic programs with linear complementarity constraints, Solving discretely-constrained Nash-Cournot games with an application to power markets, On convex quadratic programs with linear complementarity constraints, Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, On conic QPCCs, conic QCQPs and completely positive programs, Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints, Branch-and-cut for linear programs with overlapping SOS1 constraints, Conic approximation to quadratic optimization with linear complementarity constraints, Basic theoretical foundations and insights on bilevel models and their applications to power systems, Three modeling paradigms in mathematical programming, Beyond canonical dc-optimization: the single reverse polar problem, Algorithms for linear programming with linear complementarity constraints, A branch-and-bound algorithm for instrumental variable quantile regression, Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem, An LPCC approach to nonconvex quadratic programs, A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints, On linear programs with linear complementarity constraints, Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming, Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints, Logic-Based Benders Decomposition for Large-Scale Optimization, Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations, A study of the difference-of-convex approach for solving linear programs with complementarity constraints, How to convexify the intersection of a second order cone and a nonconvex quadratic, Implicit solution function of P\(_{0}\) and Z matrix linear complementarity constraints, Solving linear programs with complementarity constraints using branch-and-cut, Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment, Convexification techniques for linear complementarity constraints, Global resolution of the support vector machine regression parameters selection problem with LPCC, The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem, Logic-based MultiObjective Optimization for Restoration Planning, On linear problems with complementarity constraints, An enhanced logical benders approach for linear programs with complementarity constraints, Lift-and-project for general two-term disjunctions, MPEC Methods for Bilevel Optimization Problems, Bilevel Linear Optimization Under Uncertainty, An algorithm for global solution to bi-parametric linear complementarity constrained linear programs, Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints
