# UGCNET-Oct2020-II: 4

53 views

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$

recategorized

1 vote

ans is option 4)8  solution by graphical method 1
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.
0
smart way to answer as per given options

## Related questions

1
28 views
In HTML, $<\text{map}>$ tag is used for defining a path between two nodes in an image defining clickable region in an image highlighting an area in an image defining the site-map of a web-site
Consider the following recursive Java function $f$ that takes two long arguments and returns a float value: public static float f (long m, long n) { float result = (float)m / (float)n; if (m < 0 ¦ n<0 return 0.0f; else result -=f(m*2, n*3); return result; } Which of the following real values best approximates the value of $f(1,3)$? $0.2$ $0.4$ $0.6$ $0.8$
Which of the following $UML$ diagrams has a static view? Collaboration diagram Use-Case diagram State chart diagram Activity diagram