document.write( "Question 197946: Value of c=2x-y subject to the constraints:\r
\n" );
document.write( "\n" );
document.write( "x>=1
\n" );
document.write( "x<=4
\n" );
document.write( "y<=8
\n" );
document.write( "x-3y<=-2\r
\n" );
document.write( "\n" );
document.write( "The last constraint really confuses me. Thanks for your time. Mike \n" );
document.write( "
Algebra.Com's Answer #148477 by solver91311(24713)![]() ![]() You can put this solution on YOUR website! \r \n" ); document.write( "\n" ); document.write( "I'm presuming that you are doing a linear programming problem. You don't say what you want to do with your objective function, that is whether you want to maximize or minimize (oddly enough, there are solutions both ways for this function and set of constraints).\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "I also presume, because of the simplicity of the problem -- there are only two variables and four constraints after all, that you are probably working this one graphically.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Given that, so far you should have an area of feasibility bounded by y = 8, x = 1, and x = 4 with no lower bound. You need to further define your area of feasibility with the\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "constraint.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Step 1: Graph the line \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Step 2: Once you have your boundary drawn, decide which side to shade. You need a test point that is NOT on the line. Since this line does not pass through the origin, the origin is an excellent test point. Substitute the coordinates of the test point into the original inequality. If you get a true statement, shade the side with the test point in it. If you get a false statement, shade the other side.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "is clearly false. (0,0) is below the line, so shade above the line.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Where that shading overlaps your previously defined area of feasibility is your new area of feasibility. In other words, the trapezoid with vertices (1,8), (4,8), (1,1), and (4,2). It looks like those vertices are your points of interest.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Using the Solver add-in in Excel confirms that (4,2) is the point where the function is maximized, and (1,8) is the point where the function is minimized.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "John \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " |