document.write( "Question 549802: Sorry, I pressed the wrong button before...
\n" );
document.write( "I am lost can someone help with this;\r
\n" );
document.write( "\n" );
document.write( "Given the restraints x + y <=5
\n" );
document.write( " y >= x
\n" );
document.write( " x >=0
\n" );
document.write( "and the objective Function C = x + y, find the maximum value? \n" );
document.write( "
Algebra.Com's Answer #358101 by solver91311(24713)![]() ![]() You can put this solution on YOUR website! \r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Graph your three constraint inequalities on the same set of coordinates. The area where the three solution set regions overlap, in this case a triangle with vertices (0,0), (0,5), and (2.5,2.5) is the area of feasibility. A linear programming theorem states that if an optimum exists it is at a vertex of the feasibility polygon.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "In this case, two of your vertices, namely (0,5) and (2.5,2.5) give the same objective function value, namely 5. That means any point on the line \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Any time the boundary of one of your constraint inequalities has the same slope as your objective function, you will likely get into the situation of not having a unique answer.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "John \n" ); document.write( " \n" ); document.write( "My calculator said it, I believe it, that settles it \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " |