Comments on: Algorithms for linear programming with linear complementarity constraints

DOI10.1007/s11750-011-0231-7zbMath1271.90062OpenAlexW2014257967MaRDI QIDQ5970622

No author found.

Publication date: 20 February 2013

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-011-0231-7

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Is bilevel programming a special case of a mathematical program with complementarity constraints?
• Descent approaches for quadratic bilevel programming
• Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
• Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• A simple algorithm for the-linear bilevel programming problem
• New Branch-and-Bound Rules for Linear Bilevel Programming

This page was built for publication: Comments on: Algorithms for linear programming with linear complementarity constraints