--------- - - ________ J_{ _ fn 11,

1 /1 J I _Cq_T1Z:(\ J) ---- a -,--

.o !.., {...

3
-
- -'X\ I
/.
2..

2 x, -l\ ?_ � 16

---···- ---- ------

·---- _;____ , +L\ X2 -S,_+_A, -\-<-==>---

Lt X \ ..L '). t '2.. - s -i.. 4- A 2__ - 2.,L\ -

+ cx1V �,Col Vo , ab le L.
.. * ho. ✓<l- (lo ye,)., rt1eo1J1/I!!:, B..il we. USR.. \0 �-1"e.....

�os,'tve.. _solv\i,Gf'_ C1\\_ c'f\�·,n Yo :sroiT�M�� �'foGi..ss._

_ _.,.. £LobJe.cPJ.,..,,.cJ,jp,-/ m� -�--=t---lY\�-,-+m f\ (\_ _

C 11 ,r,·l:i�r;__·B�--- ft'\__\��.,.,:c ccf..

()1 - (Y\ A\- __ (Y) A

[!J_b:::_JIJ____:5_!.Q.(1.de, rd I "' bk LLSJ ®- :{\�lfLO.�_c - �o� /\T

+ - \b ___ -----.1

�'2.. - 24
--<-___ _

, 3 x.'2:. � o-S, + m A, + 0 s�-h/U/J_

+L\i'- -s,+A, -=\6 ---------
 b 3 0
�\j i-... \ - �'- ..,
,:;::-
\
..::, L -

_x 1.. RI -0 \ -?...J� __ \,.. /�

-+ b ___'/._,_ U-E 0 �I\ o -2-�

Z/ \ bB IS l:, --� 15 ::!j IS

c: ·--� D _a 3/S -:'l l .S_

�-µ/._o.\--c.J u COo 0 � s, ___ --- ----

� · ':!oS--_,a 'IN . _ :-4/>_ --�1'- - B /5 --=-=-=-
- ?..._/_5,_-__
- q
_;P' _R 1-\--::.. _l-\_-_f;_ � 3 /I 0 -_\ ...,.__
b 5 C) �

____
c"'--,-jjf---� 'J..__�Q1r--i_\
, ____ -1'--�-----=.::�\---��-

____ a ____ �_
-\
\o -U
-- o ______ ··-·<;·-'·····--·\6 ··----. 3 a \

_-Zj __ 2.U

.::. '._ L\
unbounded solution

- -

Alternate solution
degeneracy

infeasible solution
2. The following is a simplex tableau for a linear programming model.

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?
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 value of x2 in this tableau?