7-days of FREE Audio papers, translation & more with Prime
7-days of FREE Prime access
7-days of FREE Audio papers, translation & more with Prime
7-days of FREE Prime access
https://doi.org/10.1057/jors.1962.33
Copy DOIPublication Date: Sep 1, 1962 | |
Citations: 18 |
Much effort has been devoted to finding the solution to the linear programming problem, although it is often the case in practice that some of the parameters are not known exactly. In this paper it is shown how, starting from the Simplex tableau, quantitative descriptions can be obtained without much further calculation of the way in which the elements aij (i = 1, 2,..., m; j = s) may vary without affecting the choice of optimal basis.
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.