Abstract
In a recent paper M.C. Cheng proposed new criteria for the simplex algorithm which guarantee that (i) a nonbasic variable of a basic feasible solution will remain nonbasic in an optimal basic solution, (ii) a basic variable of a basic solution will remain basic in an optimal basic solution. This comment gives (i) a slight generalization of the first result and (ii) a counterexample to the second proposition.
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.
