Question

if so, prove It. i 10. Consider the dual canonical tableau below: X, X, -1 Assume, without loss of generality, that a>0. a. Ifb>0 and c>0, which of the four types of behavior for dual canonical linear programming problems as given by the duality theorem is exhibited above. Prove your assertion. b. Repeat part a under the assumptions that b>0 and c<0. c. Repeat part a under the assumptions that b <0 and c>0 d. Repeat part a under the assumptions that b <0 and c<0

Answer 1

メーーーグn the curent table is Maximum basic leasible 2. Here, 200 and- ri, o,To imization idhlem is nttasihle. rent tahle i's Mazimum :The besic the urrend gble 1C

ㄈ bask feasible c hooge Anu 2. C 2. ecugenk table is mazimum 9)으

i's unbdd rd ts dual and Mininization proktem is is d Consider tabie ㄈ he cuent table is nal gum basio ply same alaathm s n G and get tabk no 3ntahle@a the nntent dahie in Maximum bask eaa aand 210 ie ago and 20 ot on a 2 2 'e Cud dabe is minimizadtion also maximization basic fest hc