Solving binary-constrained mixed complementarity problems using continuous reformulations
DOI10.1016/J.COR.2020.105208OpenAlexW3118416326MaRDI QIDQ2668675FDOQ2668675
Authors: Yanyan Li 
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105208
Recommendations
- An RLT approach for solving the binary-constrained mixed linear complementarity problem
- Solving discretely constrained mixed complementarity problems using a median function
- Solving discretely constrained, mixed linear complementarity problems with applications in energy
- Mathematical programs with equilibrium constraints: automatic reformulation and solution via constrained optimization
- New constrained optimization reformulation of complementarity problems
mixed-integer optimizationcontinuous reformulationsbinary-constrained mixed complementarity problemsspatial price equilibrium problems
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Operations research and management science (90Bxx) General equilibrium theory (91B50) Mathematical programming (90Cxx)
Cites Work
- Title not available (Why is that?)
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- CONOPT—A Large-Scale GRG Code
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- A polyhedral branch-and-cut approach to global optimization
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- The Linear Complementarity Problem
- Optimality conditions for bilevel programming problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- On NCP-functions
- A special newton-type optimization method
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Solving discretely-constrained Nash-Cournot games with an application to power markets
- Complementarity modeling in energy markets
- Solving discretely constrained, mixed linear complementarity problems with applications in energy
- Efficient market-clearing prices in markets with nonconvexities
- A hybrid smoothing method for mixed nonlinear complementarity problems
- Title not available (Why is that?)
- On the solutions of discrete nonlinear complementarity and related problems
- Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
- A primal heuristic for nonsmooth mixed integer nonlinear optimization
- Computational optimization of gas compressor stations: MINLP models versus continuous reformulations
- Chapter 9: An MPEC based heuristic
- Integer solution for linear complementarity problem
- Solving discretely constrained mixed complementarity problems using a median function
- Total dual integrality of the linear complementarity problem
- Total dual integrality and integral solutions of the linear complementarity problem
- Computing integral solutions of complementarity problems
- Integral solutions of linear complementarity problems
- Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers
- An exact solution method for binary equilibrium problems with compensation and the power market uplift problem
- The integer linear complementarity problem
- Computing feasible points for binary MINLPs with MPECs
- An RLT approach for solving the binary-constrained mixed linear complementarity problem
- Technical note -- There's no free lunch: on the hardness of choosing a correct big-\(M\) in bilevel optimization
Cited In (5)
- An RLT approach for solving the binary-constrained mixed linear complementarity problem
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- Solving discretely constrained mixed complementarity problems using a median function
- A recombination‐based matheuristic for mixed integer programming problems with binary variables
- A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems
Uses Software
This page was built for publication: Solving binary-constrained mixed complementarity problems using continuous reformulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668675)
