Certificates of primal or dual infeasibility in linear programming

DOI10.1023/A:1011259103627zbMath0983.90036OpenAlexW1814925057MaRDI QIDQ5947149

Erling D. Andersen

Publication date: 7 April 2002

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011259103627

zbMATH Keywords

linear programminginterior-point methodsbasis certificatebasis identificationFarkas type certificateinfeasibilityinfeasible status

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Related Items (3)

Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation ⋮ Multi-criteria optimization and decision-making in radiotherapy ⋮ Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes

Uses Software

• Mosek

This page was built for publication: Certificates of primal or dual infeasibility in linear programming