Solving binary-constrained mixed complementarity problems using continuous reformulations
From MaRDI portal
Publication:2668675
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
Cites work
- A hybrid smoothing method for mixed nonlinear complementarity problems
- A polyhedral branch-and-cut approach to global optimization
- A primal heuristic for nonsmooth mixed integer nonlinear optimization
- A special newton-type optimization method
- An exact solution method for binary equilibrium problems with compensation and the power market uplift problem
- An RLT approach for solving the binary-constrained mixed linear complementarity problem
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Chapter 9: An MPEC based heuristic
- Complementarity modeling in energy markets
- Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
- Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers
- Computational optimization of gas compressor stations: MINLP models versus continuous reformulations
- Computing feasible points for binary MINLPs with MPECs
- Computing integral solutions of complementarity problems
- CONOPT—A Large-Scale GRG Code
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Efficient market-clearing prices in markets with nonconvexities
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- scientific article; zbMATH DE number 1059222 (Why is no real title available?)
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- Integer solution for linear complementarity problem
- Integral solutions of linear complementarity problems
- On NCP-functions
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the solutions of discrete nonlinear complementarity and related problems
- Optimality conditions for bilevel programming problems
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- 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
- Technical note -- There's no free lunch: on the hardness of choosing a correct big-M in bilevel optimization
- The integer linear complementarity problem
- The Linear Complementarity Problem
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Total dual integrality and integral solutions of the linear complementarity problem
- Total dual integrality of the linear complementarity problem
Cited in
(6)- Solving discretely constrained mixed complementarity problems using a median function
- An RLT approach for solving the binary-constrained mixed linear complementarity problem
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems
- A recombination‐based matheuristic for mixed integer programming problems with binary variables
- Integer constraints in a Cournot model -- an application to electricity market modelling
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)
