Technical Note—Complementary Programming

DOI10.1287/OPRE.19.6.1523MaRDI QIDQ5636704zbMATH OpenOpenAlexFDO

Authors Toshihide Ibaraki

Publication date 1971

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.19.6.1523

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Quadratic programming (90C20) Nonlinear programming (90C30)

Cited in

(8)

• Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
• An enumerative method for the solution of linear complementarity problems
• On the problem of optimizing contact force distributions
• A study of the difference-of-convex approach for solving linear programs with complementarity constraints
• Algorithms for linear programming with linear complementarity constraints
• A pivoting algorithm for linear programming with linear complementarity constraints
• An enhanced logical benders approach for linear programs with complementarity constraints
• Jointly constrained bilinear programs and related problems: An overview

This page was built for publication: Technical Note—Complementary Programming

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