in Optimization recategorized by
1,053 views
0 votes
0 votes

Consider the following linear programming (LP):

$\begin{array}{ll} \text{Max.} & z=2x_1+3x_2 \\ \text{Such that} & 2x_1+x_2 \leq 4 \\ & x_1 + 2x_2 \leq 5 \\ & x_1, x_2 \geq 0 \end{array}$

The optimum value of the LP is

  1. $23$
  2. $9.5$
  3. $13$
  4. $8$
in Optimization recategorized by
1.1k views

1 Answer

1 vote
1 vote

ans is option 4)8  solution by graphical method    

 

3 Comments

we can also eliminate options here. By adding first 2 inequalities, we get, $3x_1 + 3x_2 \leq 9$.

It can also be written as: $x_1+z \leq 9$. So, $z \leq 9\; – \;x_1$

Since, $x_1 \geq 0$, So, $z\leq 9$. So, from given options, we can eliminate first 3 options.
2
2
smart way to answer as per given options
0
0
yes. Amazing trick.
0
0
Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true