Pages that link to "Item:Q3608991"
From MaRDI portal
The following pages link to On the Global Solution of Linear Programs with Linear Complementarity Constraints (Q3608991):
Displayed 39 items.
- An SOS1-based approach for solving MPECs with a natural gas market application (Q264267) (← links)
- Solving discretely-constrained Nash-Cournot games with an application to power markets (Q300326) (← links)
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints (Q320925) (← links)
- An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
- On linear programs with linear complementarity constraints (Q452341) (← links)
- How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
- Implicit solution function of P\(_{0}\) and Z matrix linear complementarity constraints (Q543397) (← links)
- Three modeling paradigms in mathematical programming (Q607499) (← links)
- Global resolution of the support vector machine regression parameters selection problem with LPCC (Q748597) (← links)
- An enhanced logical benders approach for linear programs with complementarity constraints (Q785626) (← links)
- A class of quadratic programs with linear complementarity constraints (Q833022) (← links)
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- A branch-and-bound algorithm for instrumental variable quantile regression (Q1697970) (← links)
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972) (← links)
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints (Q1749452) (← links)
- Beyond canonical dc-optimization: the single reverse polar problem (Q1935286) (← links)
- Algorithms for linear programming with linear complementarity constraints (Q1935876) (← links)
- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem (Q1945502) (← links)
- Convexification techniques for linear complementarity constraints (Q2045009) (← links)
- On linear problems with complementarity constraints (Q2080820) (← links)
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (Q2231320) (← links)
- Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
- Lift-and-project for general two-term disjunctions (Q2339813) (← links)
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs (Q2349521) (← links)
- On convex quadratic programs with linear complementarity constraints (Q2377168) (← links)
- Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
- Basic theoretical foundations and insights on bilevel models and their applications to power systems (Q2400021) (← links)
- A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints (Q2442073) (← links)
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160) (← links)
- A pivoting algorithm for linear programming with linear complementarity constraints (Q2885465) (← links)
- Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379) (← links)
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (Q3454970) (← links)
- Logic-based MultiObjective Optimization for Restoration Planning (Q3638509) (← links)
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem (Q4976158) (← links)
- MPEC Methods for Bilevel Optimization Problems (Q5014634) (← links)
- Bilevel Linear Optimization Under Uncertainty (Q5014639) (← links)
- Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints (Q5026840) (← links)
- Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment (Q5963234) (← links)