My Math Forum LP with Big-M Method
 User Name Remember Me? Password

 Applied Math Applied Math Forum

 May 23rd, 2012, 01:28 AM #1 Member   Joined: Jan 2010 Posts: 44 Thanks: 0 LP with Big-M 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$cx$ s.t. $Ax=b$, $x\geq 0$ I apply the Big M method to get initial basic feasible solution, so I get a LP': min$cx+M\sum_{i=1}^m{y_i}$, where M is large number s.t. $Ax+y=b$, $x,y\geq 0$ 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?

 Tags bigm, method

,

,

,

,

### math on big-M method

Click on a term to search for related topics.
 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post r-soy Calculus 1 March 14th, 2013 02:42 AM guru123 Elementary Math 2 October 16th, 2011 05:48 AM noobemk Elementary Math 1 December 29th, 2009 02:47 PM eric3353 Calculus 3 July 3rd, 2008 03:23 PM guru123 Algebra 2 December 31st, 1969 04:00 PM

 Contact - Home - Forums - Cryptocurrency Forum - Top