document.write( "Question 1194469: The Star Electronics Company produces two robotic vacuums.
\n" ); document.write( "The production process for each product is similar in that
\n" ); document.write( "both require a certain number of hours of electronic work
\n" ); document.write( "and a certain number of labour hours in the assembly
\n" ); document.write( "department. Robotic vacuum A takes 4 hours of electronic
\n" ); document.write( "work and 2 hours in the assembly shop. Robotic vacuum B
\n" ); document.write( "requires 3 hours in electronics and 1 hour in assembly.
\n" ); document.write( "During the current production period, 240 hours of
\n" ); document.write( "electronic time are available, and 100 hours of assembly
\n" ); document.write( "department time are available. Each robotic vacuum A sold
\n" ); document.write( "yields a profit of RM 700 while each robotic vacuum B
\n" ); document.write( "produced may be sold for a RM 500 profit.
\n" ); document.write( "Formulate a linear programming model for this problem.\r
\n" ); document.write( "\n" ); document.write( "a) Find the objective function\r
\n" ); document.write( "\n" ); document.write( "b) Identify the variable and list all the constraints\r
\n" ); document.write( "\n" ); document.write( "c) Calculate the intersection point.\r
\n" ); document.write( "\n" ); document.write( "d) Draw the graph with a complete label of the axis,
\n" ); document.write( "intersection point, line equation, and shaded region.\r
\n" ); document.write( "\n" ); document.write( "e) Find the optimal solution\r
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "

Algebra.Com's Answer #826684 by Edwin McCravy(20067)\"\" \"About 
You can put this solution on YOUR website!
The currency RM is the Malaysian ringgit, which is worth
\n" ); document.write( "about 23 cents in US currency.
\n" ); document.write( "
\r\n" );
document.write( "\r\n" );
document.write( "Vacuums|  A |  B |\r\n" );
document.write( "-------|----|----|limits\r\n" );
document.write( "Number |  x |  y |  ↓\r\n" );
document.write( "-------|----|----|------\r\n" );
document.write( "E. hrs.| 4x | 3y | 240 |\r\n" );
document.write( "-------|----|----|-----|\r\n" );
document.write( "A. hrs.| 2x | 1y | 100 |\r\n" );
document.write( "-------|----|----|------\r\n" );
document.write( "Profit |700x|500y|\r\n" );
document.write( "\r\n" );
document.write( "Maximize P = 700x + 500y  <--objective function\r\n" );
document.write( "\r\n" );
document.write( "Subject to constraints:\r\n" );
document.write( "\r\n" );
document.write( "4x + 3y ≤ 240\r\n" );
document.write( "2x +  y ≤ 100\r\n" );
document.write( "x ≥ 0, y ≥ 0\r\n" );
document.write( "\r\n" );
document.write( "We draw the graphs of the two lines,\r\n" );
document.write( "Put = in place of ≤\r\n" );
document.write( "\r\n" );
document.write( "                   Intercepts\r\n" );
document.write( "4x + 3y = 240    (0,80), (60,0)\r\n" );
document.write( "2x +  y = 100   (0,100), (50,0)\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( " Corner |\r\n" );
document.write( " point  |    P = 700x + 500y\r\n" );
document.write( "--------|----------------------------------------------\r\n" );
document.write( "  (0,0) |      700(0) + 500(0)  =     0 +     0 =     0\r\n" );
document.write( " (50,0) |     700(50) + 500(0)  = 35000 +     0 = 35000\r\n" );
document.write( "(30,40) |     700(30) + 500(40) = 21000 + 20000 = 41000 <--max. profit\r\n" );
document.write( " (0,80) |      700(0) + 500(80) =     0 + 40000 = 40000 \r\n" );
document.write( "\r\n" );
document.write( "Optimum solution: Make 30 A's and 40 B's with a max profit of RM 41000\r\n" );
document.write( "\r\n" );
document.write( "Edwin

\n" ); document.write( "
\n" ); document.write( "
\n" );