The dual of this problem :
A. will be a maximization problem with 3 variables and 2 constraints
B. will not be possible as there are negative coefficients in the constraints and objective function in the standard form.
C. can not be solved by simplex method because of negative coefficients in the objective function and constraints in the standard form.
D. will be a minimization problem with 3 variables and 2 constraints.
Answer:D
The dual of this problem :
A. will be a maximization problem with 3 variables and 2 constraints B. will not be possible as there are negative coefficients in the constraints and objective function in the standard form. C. can not be solved by simplex method because of negative coefficients in the objective function and constraints in the standard form. D. will be a minimization problem with 3 variables and 2 constraints.