Solved

Given the Following Linear Programming Problem with Two Non-Negative Variables (X1\left(X_{1}\right.

Question 39

Multiple Choice

Given the following linear programming problem with two non-negative variables (X1\left(X_{1}\right. and X2) \left.X_{2}\right) , 3 constraints (all \leq type) , and a maximize objective function (Yi\left(Y_{i}\right. , where i=1,2,3i=1,2,3 , respective to the dual variables associated with constraints 1,2 and 3 ) ,
Max: 250X1+500X2250 X_{1}+500 X_{2}
Constraints: X13202X1+5X211001X1+1.2X2480X_{1} \leq 320 \quad 2 X_{1}+5 X_{2} \leq 1100 \quad 1 X_{1}+1.2 X_{2} \leq 480
Variables are non-negative the objective function of the dual problem is


A) Max:0Y1+2Y2+1Y3\operatorname{Max}: 0 Y_{1}+2 Y_{2}+1 Y_{3}
B) Min:1Y1+2Y2+1Y3\operatorname{Min}: 1 Y_{1}+2 Y_{2}+1 Y_{3}
C) Max:320Y1+1100Y2+480Y3\operatorname{Max}: 320 Y_{1}+1100 Y_{2}+480 Y_{3}
D) Min:320Y1+1100Y2+480Y3\operatorname{Min}: 320 Y_{1}+1100 Y_{2}+480 Y_{3}

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Unlock this Answer For Free Now!

View this answer and more for free by performing one of the following actions

qr-code

Scan the QR code to install the App and get 2 free unlocks

upload documents

Unlock quizzes for free by uploading documents