Abstract
In two recent papers, Eaves showed that Lemke's algorithm can be used to compute a stationary point of an affine function over a polyhedral set. This paper proposes an alternative method which is based on parametric principal pivoting. The proposed method involves solving systems of linear equations and parametric linear subprograms over the given polyhedral set. An obvious advantage of the method is that any special structure of the polyhedral set can be exploited profitably in the solution of the subprograms.
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.
