- **Applied Math**
(*http://mymathforum.com/applied-math/*)

- - **LP with Big-M Method**
(*http://mymathforum.com/applied-math/27707-lp-big-m-method.html*)

LP with Big-M MethodHello! Have some difficulties to obtain some properties of optimal solution for one LP with respect to the other. So - I have a LP: min s.t. , I apply the Big M method to get initial basic feasible solution, so I get a LP': min, where M is large number s.t. , Simplex algorithm is applied. 1)In all text-books it is said, that one can easily see, that if LP' has an optimal solution with y\neq 0, then LP is unfeasible. Why is that? 2)If it is known that LP' is not bounded, then it follows LP is unbounded or unfeasible. What is justification for that? Maybe someone can explain or give a hint? |

All times are GMT -8. The time now is 08:11 PM. |

Copyright © 2019 My Math Forum. All rights reserved.