Recovering an optimal LP basis from an optimal dual solution

DOI10.1016/j.orl.2005.10.001zbMath1152.90523OpenAlexW2067979627MaRDI QIDQ2480056

François Soumis, Jacques Desrosiers, Hatem M. T. Ben Amor

Publication date: 28 March 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2005.10.001

zbMATH Keywords

linear programminginterior point methodcrossoverbasic solution

Mathematics Subject Classification ID

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

Related Items

A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs, Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems, Cutting planes for branch-and-price algorithms

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Recovering an optimal LP basis from an interior point solution
• Solving Real-World Linear Programs: A Decade and More of Progress
• On Finding Primal- and Dual-Optimal Bases