Abstract
We show that any linear program (LP) in n nonnegative variables and m equality constraints defines in a natural way a unique sink orientation of the n-dimensional cube. From the sink of the cube, we can either read off an optimal solution to the LP, or we obtain certificates for infeasibility or unboundedness.This reduction complements the implicit local neighborhoods induced by the vertex-edge structure of the feasible region with an explicit neighborhood structure that allows random access to all 2n candidate solutions. Using the currently best sink-finding algorithm for general unique sink orientations, we obtain the fastest deterministic LP algorithm in the RAM model, for the central case n = 2m.
Sign-in/Register to access full text options 
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.
