On lower bound updates in primal potential reduction methods for linear programming

On lower bound updates in primal potential reduction methods for linear programming

0.00 Avg rating0 Votes
Article ID: iaor19921510
Country: Netherlands
Volume: 52
Issue: 3
Start Page Number: 415
End Page Number: 428
Publication Date: Dec 1991
Journal: Mathematical Programming
Authors:
Abstract:

The paper presents a procedure or computing lower bounds for the optimal cost in a linear programming problem. Whenever the procedure succeeds, it finds a dual feasible slack and the associated duality gap. Although no projective transformations or problem restatements are used, the method coincides with the procedures by Todd and Burrell and by de Ghellinck and Vial when these procedures are applicable. The procedure applies directly to affine potential reduction algorithms, and improves on existent techniques for finding lower bounds.

Reviews

Required fields are marked *. Your email address will not be published.