Redirected
retagged by
1,657 views
2 votes
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 :

  1. $6$ 
  2. $8$
  3. $10$ 
  4. $12$
retagged by

1 Answer

Related questions

3 votes
3 votes
1 answer
3
go_editor asked Aug 21, 2016
1,649 views
The region of feasible solution of a linear programminig problem has a ____ property in geometry, provided the feasible solution of the problem existsconcavityconvexityqu...
1 votes
1 votes
3 answers
4
makhdoom ghaya asked Oct 4, 2016
4,090 views
Which formal system provides the semantic foundation for Prolog ?Predicate calculusLambda calculusHoare logicPropositional logic