Question: Question 2 For primal linear program = min , s u b j e c t t o > = P = min x c

Question 2 For primal linear program = min , s u b j e c t t o >= P=min x c T x,subjecttoAx>=b, with =[1,1],=[1,2],=[1121],=[1,1] c=[1,1] T ,x=[x 1,x 2] T ,A=[1211],b=[1,1] T . Suppose the variable in dual program is =[1,2] u=[u 1,u 2] T . From the constrains, you can solve for 1 u 1 and 2 u 2. Suppose strong duality holds, what is the optimal value of the primal linear program P?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!