The Gateway to Computer Science Excellence

+2 votes

Consider the following linear programming problem :

$\max. z = 0.50 x_{2} – 0.10x_{1}$

Subject to the constraints

$2x_{1} + 5x_{2} \leq 80$

$x_{1} + x_{2} \leq 20$

and $x_{1}, x_{2} \geq 0$

The total maximum profit $(z)$ for the above problem is :

- $6$
- $8$
- $10$
- $12$

52,345 questions

60,497 answers

201,859 comments

95,315 users