An RLT approach for solving the binary-constrained mixed linear complementarity problem
From MaRDI portal
Recommendations
- Solving discretely constrained, mixed linear complementarity problems with applications in energy
- Solving binary-constrained mixed complementarity problems using continuous reformulations
- Solving discretely constrained mixed complementarity problems using a median function
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- Complementarity modeling in energy markets
Cites work
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 1036629 (Why is no real title available?)
- scientific article; zbMATH DE number 1059239 (Why is no real title available?)
- scientific article; zbMATH DE number 3332061 (Why is no real title available?)
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A global optimization algorithm for linear fractional and bilinear programs
- A two-phase algorithm for the multiparametric linear complementarity problem
- An algorithm for the fast solution of symmetric linear complementarity problems
- An exact solution method for binary equilibrium problems with compensation and the power market uplift problem
- An experimental investigation of enumerative methods for the linear complementarity problem
- An implicit enumeration procedure for the general linear complementarity problem
- An iterative two-step algorithm for linear complementarity problems
- Bimatrix Equilibrium Points and Mathematical Programming
- Complementarity problems
- Complementary pivot theory of mathematical programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
- Dynamic reserve selection: optimal land retention with land-price feedbacks
- Engineering and Economic Applications of Complementarity Problems
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- Feasibility problems with complementarity constraints
- Formulating dynamic multi-rigid-body contact problems with friction as solvable linear complementarity problems
- Integer solution for linear complementarity problem
- Integral solutions of linear complementarity problems
- Limited memory solution of bound constrained convex quadratic problems arising in video games
- On the solution of NP-hard linear complementarity problems
- Paul Wilmott on quantitative finance. 3 Vols. With CD-ROM
- Solving discretely constrained mixed complementarity problems using a median function
- Solving discretely constrained, mixed linear complementarity problems with applications in energy
- Solving discretely-constrained Nash-Cournot games with an application to power markets
- The integer linear complementarity problem
- Three enhancements for optimization-based bound tightening
- Unified approaches for solvable and unsolvable linear complementarity problems
Cited in
(7)- Solving linear programs with complementarity constraints using branch-and-cut
- Generalized Nash equilibrium models for asymmetric, non-cooperative games on line graphs: application to water resource systems
- Solving discretely constrained, mixed linear complementarity problems with applications in energy
- Solving discretely constrained mixed complementarity problems using a median function
- A two-step matrix splitting method for the mixed linear complementarity problem
- Solving binary-constrained mixed complementarity problems using continuous reformulations
- A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems
This page was built for publication: An RLT approach for solving the binary-constrained mixed linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2002841)
