document.write( "Question 717173: Consider the following linear programming problem: \r
\n" );
document.write( "\n" );
document.write( "Max. 3a + 3b \r
\n" );
document.write( "\n" );
document.write( "s.t.
\n" );
document.write( "2a + 4b is less than or equal to 12
\n" );
document.write( "6a + 4b is less than or equal to 24\r
\n" );
document.write( "\n" );
document.write( "a.Find the optimal solution using the graphical solution procedure
\n" );
document.write( "b. If the objective function is changed to 2a + 6b, what will the optimal solution be?
\n" );
document.write( "c. How many extreme points are there? What are the values of a and b at each extreme point? \n" );
document.write( "
Algebra.Com's Answer #440129 by solver91311(24713) You can put this solution on YOUR website! \r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Step 1: Graph the constraint inequalities. From the looks of the objective function, the values have to both be non-negative to achieve a maximum, so also graph \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Step 2: The feasibility area is where the solution sets overlap.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Step 3: Determine the critical points. These will be the vertices of the feasibility polygon (a quadrilateral in the case of the given problem).\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Step 4: Test the objective function at the values of the coordinates of each of the critical points defined in Step 3. The optimum solution, if one exists, will be the set of vertex coordinates that make the objective function the maximum value. It is possible that two adjacent vertices give the same objective function result. In such case, there is no unique optimum. Rather, any point on the line segment that joins those two vertices gives an optimum result.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Laying out one of these problems is a significant amount of work; enough that I don't care to do it for free. Write back if you would care to negotiate a price for a complete solution to the posted problem.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "John \n" ); document.write( " \n" ); document.write( "Egw to Beta kai to Sigma \n" ); document.write( "My calculator said it, I believe it, that settles it \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " |