Consider the problem of maximizing C1 + C2x2 + C3x3 subject to the constraints 6x1 +...

 

Transcribed Image Text:

Consider the problem of maximizing C1 + C2x2 + C3x3 subject to the constraints 6x1 + x2 + 4x3 12, 120, 320, and 6 2 0. (a) Graph the feasible set in R. (b) Convert this problem to an equivalent problem in canonical form. Write your final answer in the form Ax = b, x 0 where the rows of the matrix A are linearly independent. (c) If (C1, C2, C3) = (1,0,1), use graphical analysis to find an optimal solution to this max- imization problem. Consider the problem of maximizing C1 + C2x2 + C3x3 subject to the constraints 6x1 + x2 + 4x3 12, 120, 320, and 6 2 0. (a) Graph the feasible set in R. (b) Convert this problem to an equivalent problem in canonical form. Write your final answer in the form Ax = b, x 0 where the rows of the matrix A are linearly independent. (c) If (C1, C2, C3) = (1,0,1), use graphical analysis to find an optimal solution to this max- imization problem.

Answer rating: 100% (QA)

a To graph the feasible set in R3 we first plot the feasible region defined by the constraints 6x1 x2 4x3 6 x1 0 x2 0 6 x2 0 Since this is a threedime... View the full answer