document.write( "Question 1085907: here is linear programming question I am having trouble with. Can you show me how to solve this problem in the most easy to use fashion?\r
\n" );
document.write( "\n" );
document.write( "For the following Linear Programming problem answer the questions (a) to (e) below:
\n" );
document.write( " Max Z = 3x + 2y
\n" );
document.write( " Subject to:
\n" );
document.write( " 2x + y <= 8
\n" );
document.write( " x + y >= 4
\n" );
document.write( " y <= 10
\n" );
document.write( " x, y >= 0\r
\n" );
document.write( "\n" );
document.write( "(a) Solve the problem to find the optimum solution. Clearly label and show the feasible solution space on your diagram.\r
\n" );
document.write( "\n" );
document.write( "(b) Over what range can the coefficient for the first product vary in the objective function before the current solution is no longer optimal?\r
\n" );
document.write( "\n" );
document.write( "(c) Over what range can the coefficient for the second product vary in the objective function before the current solution is no longer optimal?\r
\n" );
document.write( "\n" );
document.write( "(d) Compute the shadow prices for the constraints.\r
\n" );
document.write( "\n" );
document.write( "(e) Calculate the Right Hand Side Ranges for the constraints.
\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #700271 by Fombitz(32388)![]() ![]() You can put this solution on YOUR website! \n" ); document.write( ". \n" ); document.write( ". \n" ); document.write( ". \n" ); document.write( "The feasible region is shown in purple with vertices of (0,4), (0,8), and (4,0). \n" ); document.write( "Check the value of Z at these three vertices to find the maximum value. \n" ); document.write( ". \n" ); document.write( ". \n" ); document.write( ". \n" ); document.write( "The sensitivity analysis required in the remaining questions is beyond the scope of this website. \n" ); document.write( " |