Home

Some perturbation theory for linear programming


Author(s) : James Renegar, 
Publisher : N/A
Publication Date : 1994
ISSN : N/A
Abstract : This paper examines a few relations between solution characteristics of an LP and the amount by which the LP must be perturbed to obtain either a primal infeasible LP or a dual infeasible LP. We consider such solution characteristics,