document.write( "Question 1138702: Solve the linear programming programing by graphing and then determining which vertex minimizes the objective function
\n" );
document.write( "G
\n" );
document.write( "=
\n" );
document.write( "4
\n" );
document.write( "x
\n" );
document.write( "+
\n" );
document.write( "3
\n" );
document.write( "y
\n" );
document.write( " .\r
\n" );
document.write( "\n" );
document.write( "⎧
\n" );
document.write( "⎪
\n" );
document.write( "⎪
\n" );
document.write( "⎪
\n" );
document.write( "⎪
\n" );
document.write( "⎨
\n" );
document.write( "⎪
\n" );
document.write( "⎪
\n" );
document.write( "⎪
\n" );
document.write( "⎪
\n" );
document.write( "⎩
\n" );
document.write( "5
\n" );
document.write( "x
\n" );
document.write( "+
\n" );
document.write( "15
\n" );
document.write( "y
\n" );
document.write( "≥
\n" );
document.write( "15
\n" );
document.write( "5
\n" );
document.write( "x
\n" );
document.write( "+
\n" );
document.write( "5
\n" );
document.write( "y
\n" );
document.write( "≥
\n" );
document.write( "35
\n" );
document.write( "x
\n" );
document.write( "≥
\n" );
document.write( "0
\n" );
document.write( "y
\n" );
document.write( "≥
\n" );
document.write( "0
\n" );
document.write( "
\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #756510 by ikleyn(52786)![]() ![]() You can put this solution on YOUR website! .\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "For your info :\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " In this site, we write and read in lines ( = in rows ), not in columns.\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |