UGC NET CSE | December 2019 | Part 2 | Question: 2
in Others edited by
0 votes
0 votes

Consider the following Linear programming problem $\text{(LPP)}$:

Maximize $z=x_1+x_2$

Subject to the constraints:

$x_1+2x_2 \leq 2000 \\ x_1+x_2 \leq 1500 \\ x_2 \leq 600 \\ \text{and } x_1, x_2 \geq 0$

The solution of the above $\text{LPP}$ is

  1. $x_1=750, x_2= 750, z=1500$
  2. $x_1=500, x_2= 1000, z=1500$
  3. $x_1=1000, x_2= 500, z=1500$
  4. $x_1=900, x_2= 600, z=1500$
in Others edited by
21 162

Subscribe to GO Classes for GATE CSE 2022

1 Answer

0 votes
0 votes
Graphical Method can be used.

On solving all the constraints, the peaks of the common area are:

A(0,0), B(0,600), C(1500,0), D(1000,500)

z is maximum on all the points of the constraint x1+x2<=1500 (as slope of z is same as the constraint)


Now lets try to eliminate the options

opt 1 and 2 can be eliminated as they are violating 3rd constraint

opt 4 can be eliminated as it is violating 1st constraint

Hence, opt 3 is the answer
edited by

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