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 $23$ $9.5$ $13$ $8$ Optimization ugcnetcse-oct2020-paper2 non-gate linear-programming + – go_editor asked Nov 20, 2020 • recategorized Nov 25, 2020 by Krithiga2101 go_editor 1.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes ans is option 4)8 solution by graphical method Sanjay Sharma answered Nov 21, 2020 Sanjay Sharma comment Share Follow See all 3 Comments See all 3 3 Comments reply ankitgupta.1729 commented Nov 21, 2020 reply Follow Share 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 votes 2 votes Sanjay Sharma commented Nov 21, 2020 reply Follow Share smart way to answer as per given options 0 votes 0 votes shashikalaraju commented May 5, 2021 reply Follow Share yes. Amazing trick. 0 votes 0 votes Please log in or register to add a comment.
