May 23rd, 2012, 12:28 AM  #1 
Member Joined: Jan 2010 Posts: 44 Thanks: 0  LP with BigM Method
Hello! 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 textbooks 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? 

Tags 
bigm, method 
Search tags for this page 
Click on a term to search for related topics.

Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Who know this method ?  rsoy  Calculus  1  March 14th, 2013 01:42 AM 
What is the method?  guru123  Elementary Math  2  October 16th, 2011 04:48 AM 
AC Method  noobemk  Elementary Math  1  December 29th, 2009 01:47 PM 
which method....  eric3353  Calculus  3  July 3rd, 2008 02:23 PM 
What is the method?  guru123  Algebra  2  December 31st, 1969 04:00 PM 