On the Global Solution of Linear Programs with Linear Complementarity Constraints
From MaRDI portal
(Redirected from Publication:3608991)
Recommendations
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
- On linear programs with linear complementarity constraints
- Solving linear programs with complementarity constraints using branch-and-cut
- Algorithms for linear programming with linear complementarity constraints
- A globally convergent probability-one homotopy for linear programs with linear complementarity constraints
Cited in
(46)- An SOS1-based approach for solving MPECs with a natural gas market application
- Solving linear programs with complementarity constraints using branch-and-cut
- A pivoting algorithm for linear programming with linear complementarity constraints
- Lift-and-project for general two-term disjunctions
- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
- Conic approximation to quadratic optimization with linear complementarity constraints
- A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints
- On conic QPCCs, conic QCQPs and completely positive programs
- Three modeling paradigms in mathematical programming
- Cardinality minimization, constraints, and regularization: a survey
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- Beyond canonical dc-optimization: the single reverse polar problem
- Solving discretely-constrained Nash-Cournot games with an application to power markets
- Implicit solution function of P\(_{0}\) and Z matrix linear complementarity constraints
- Relaxations and cutting planes for linear programs with complementarity constraints
- Basic theoretical foundations and insights on bilevel models and their applications to power systems
- An LPCC approach to nonconvex quadratic programs
- Improving the solution of indefinite quadratic programs and linear programs with complementarity constraints by a progressive MIP method
- On linear problems with complementarity constraints
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Global resolution of the support vector machine regression parameters selection problem with LPCC
- Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints
- Convexification techniques for linear complementarity constraints
- A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
- On linear programs with linear complementarity constraints
- A class of quadratic programs with linear complementarity constraints
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
- Logic-based MultiObjective Optimization for Restoration Planning
- Bilevel linear optimization under uncertainty
- Sequential linearization method for bound-constrained mathematical programs with complementarity constraints
- An enhanced logical benders approach for linear programs with complementarity constraints
- MPEC methods for bilevel optimization problems
- Treatment learning with Gini constraints by Heaviside composite optimization and a progressive method
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
- Logic-based Benders decomposition for large-scale optimization
- Obtaining tighter relaxations of mathematical programs with complementarity constraints
- Algorithms for linear programming with linear complementarity constraints
- Solving linear optimization problems with max-star composition equation constraints
- A branch-and-bound algorithm for instrumental variable quantile regression
- On convex quadratic programs with linear complementarity constraints
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- Perturbation analysis for KKT point sets of constrained optimization problems
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
- Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming
This page was built for publication: On the Global Solution of Linear Programs with Linear Complementarity Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608991)
