首页 > TAG信息列表 > LALP
LALP exercise 4
Question Consider the following linear programming problem \[\begin{aligned} \begin{array}{ll} \text { Minimise } & -x_{1}-2 x_{2}-x_{3} \\ \text { subject to } & 3 x_{1}+4 x_{2}+2 x_{3} &\leq 10 \\ & 2 x_{1}+x_{2}+2 x_{3} &LALP Assessment 3
LALP 3rd Continuous Assessment Q1 Suppose it makes \(x\) product A and \(y\) product B. Then the LP problem is: \[\text{Maximize}\quad 2.4 x+2.6 y, \\ \left\{\ \begin{array} 5 x+4 y\leq 160\\ 2 x+3 y\leq 85\\ x+2 y\leq 50 \end{array}