Simplex / Big M method Tableau question

  • Thread starter Thread starter USN2ENG
  • Start date Start date
  • Tags Tags
    Method
USN2ENG
Messages
107
Reaction score
0

Homework Statement


This is from a study guide that I don't have the answers to just yet and I am trying to figure out this last problem for my OR class. I am either confused or the problem is written wrong. I am probably confused though. Any help would be great!

This Tableau is for a Maximization problem. Which of the following cases is true and why?

See the attached screen shot for the Tableau:

A) We have reached a unique optimal solution and the solution is:
B) We have not reached optimal solution. The entering variable is ________ and the exiting variable is ________.
C) The problem is unbounded.
D) There are many optimal solutions because:
E) The problem is infeasible because:







Homework Equations





The Attempt at a Solution



So, this problem confuses me for a couple of reasons. a1 still has M in Row 0, but that could be ok if that is how the math turned out in the row operations. The other problem is that x2 can enter the basis and making it basic will not change z, so we have many solutions. My only problem with that is the problem before this one is this exact Tableau but without the a1 column, so that would be the same answer. So I guess I am expecting that he added the a1 column for a reason and I am not seeing it. Thanks for any help.
 

Attachments

  • Simplex.jpg
    Simplex.jpg
    10.4 KB · Views: 490
Physics news on Phys.org
USN2ENG said:

Homework Statement


This is from a study guide that I don't have the answers to just yet and I am trying to figure out this last problem for my OR class. I am either confused or the problem is written wrong. I am probably confused though. Any help would be great!

This Tableau is for a Maximization problem. Which of the following cases is true and why?

See the attached screen shot for the Tableau:

A) We have reached a unique optimal solution and the solution is:
B) We have not reached optimal solution. The entering variable is ________ and the exiting variable is ________.
C) The problem is unbounded.
D) There are many optimal solutions because:
E) The problem is infeasible because:







Homework Equations





The Attempt at a Solution



So, this problem confuses me for a couple of reasons. a1 still has M in Row 0, but that could be ok if that is how the math turned out in the row operations. The other problem is that x2 can enter the basis and making it basic will not change z, so we have many solutions. My only problem with that is the problem before this one is this exact Tableau but without the a1 column, so that would be the same answer. So I guess I am expecting that he added the a1 column for a reason and I am not seeing it. Thanks for any help.

You seem to be forgetting that the tableau is really just a shorthand way of writing the system of equations. In particular, the z-row of the tableau really means
z + 0 x_1 + 0x_2 + 5x_3 + 1s_1 + Ma_1 = 15
or
z = 15 - 5x_3 - s_1 - Ma_1.
Having M in the z-row is OK, because a_1 is a nonbasic variable.
 
Sorry, yeah, that is what I meant when I said it was ok if the math turned out that way with the ERO's. So am I right in assuming that the only thing wrong with this present tableau is that it has many solutions due to x2?

Thanks for your reply!
 
USN2ENG said:
Sorry, yeah, that is what I meant when I said it was ok if the math turned out that way with the ERO's. So am I right in assuming that the only thing wrong with this present tableau is that it has many solutions due to x2?

Thanks for your reply!

Sorry: I stand corrected! The variable a_1 is a basic variable, so one row reads as
##a_1 + \text{ other non-basic terms } = \text{ some number}##, and that means that you need to 'eliminate' a_1 from the z-row in order to see what is happening. In other words, the tableau is only partly written out properly, and you need to put it into correct form: its z-row is not yet finished.
 
Thanks for the help Ray!
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top