Abstract
The projective scaling algorithm in Karmarkar [Combinatorica, 4 (1984), pp. 373–395] and Dantzig’s simplex method (see [Linear Programming and Extensions, Princeton University Press, 1963]) are usually thought of as fundamentally different approaches to linear programming. When viewed in Dantzig’s column space geometry, however, both algorithms turn out to be iteratively reweighted least squares methods. The projective scaling algorithm (and the affine scaling method in Dikin [Soviet Math. Dokl., 8 (1967), pp. 674–675]) can then be derived as a natural generalization of the simplex method. This derivation shows how the dual variables arise in the interior methods. The insight is essentially geometric; suitable figures are provided.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
