Abstract
Abstract Dittman and Staats give an algorithm to solve the linear programming problem by a surrogate constraint method. This technical note illustrates that the proposed algorithm will only converge in an infinite number of steps to the optimal solution of the original linear programming problem. This shows a serious drawback of the algorithm. A remedial modification is suggested which will lead to problem solution.
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.
