Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

number 2 a-g? prootem graphically. 2. The followingisa simplex tableau for aline

ID: 3124284 • Letter: N

Question



number 2 a-g?

prootem graphically. 2. The followingisa simplex tableau for alinear ming model: 12 0 Basic Variables Quantity xi si 113 1 0 1/6 10 1/3 0 1 1/6 240 10 12 0 0 10 0 0 a. Is this a maximization or a minimization problem? Why? b. What is the solution given in this tableau? c. Is the solution given in this tableau optimal? Why? E A THE SIMPLEx SOLUTION METHoD d. write out the original objective function for the linear programming model using only decision variables. e. How many constraints are in the linear programming model? f. Were any of the constraints originally equations? Why? g. What is the walue of x in this tableau?

Explanation / Answer

a.) It is a minimization problem because the value of slcak variable s2 is negative.

b.) Solution given in the tableau is 240.

c.) The solution given is not optimal because x3 has a component of x2.

d.) 6x1 + 20x2 + 12x3

e.) There are three contraints in the linear programming model.

f.) Yes. The first contraint is an equation because value of coefficient s1 and s2 is 0 in that.

g.) Value of x2 in the tablue is 10.