Determination of optimal vertices from feasible solutions in unimodular linear programming
Saigal, Romesh; Mizuno, Shinji; Orlin, James B.
1993-03
Citation
Mizuno, Shinji; Saigal, Romesh; Orlin, James B.; (1993). "Determination of optimal vertices from feasible solutions in unimodular linear programming." Mathematical Programming 59 (1-3): 23-31. <http://hdl.handle.net/2027.42/47926>
Abstract
In this paper we consider a linear programming problem with the underlying matrix unimodular, and the other data integer. Given arbitrary near optimum feasible solutions to the primal and the dual problems, we obtain conditions under which statements can be made about the value of certain variables in optimal vertices. Such results have applications to the problem of determining the stopping criterion in interior point methods like the primal—dual affine scaling method and the path following methods for linear programming.Publisher
Springer-Verlag; The Mathematical Programming Society, Inc.
ISSN
0025-5610 1436-4646
Other DOIs
Types
Article
Metadata
Show full item recordAccessibility: If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.