Comments on: Algorithms for linear programming with linear complementarity constraints

DOI10.1007/S11750-011-0231-7MaRDI QIDQ5970622zbMATH OpenOpenAlexFDO

Authors

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

• A Branch and Bound Algorithm for the Bilevel Programming Problem
• A simple algorithm for the-linear bilevel programming problem
• Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
• Descent approaches for quadratic bilevel programming
• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• scientific article; zbMATH DE number 1163110 (Why is no real title available?)
• scientific article; zbMATH DE number 757676 (Why is no real title available?)
• Is bilevel programming a special case of a mathematical program with complementarity constraints?
• Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
• New Branch-and-Bound Rules for Linear Bilevel Programming

Cited in

(4)

• Comments on An efficient search direction for linear programming problems by H. Luh and R. Tsaih.
• Comments on: Algorithms for linear programming with linear complementarity constraints
• Letter to the Editor—A Supplementary Bibliography on Linear Programming
• Comments on: Algorithms for linear programming with linear complementarity constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5970622)