Quantrex AcademyJEE · NEET · NDA PYQs with solutions Open app

BITSAT 2011

Exam: BITSAT
Year: 2011
Subject: Mathematics
Chapter: Linear Programming

BITSAT 2011 · Mathematics · Linear Programming

For the constraints of a L.P. Problem given by (x_1+2 x_2 ≤ 2000,...

For the constraints of a L.P. Problem given by (x_1+2 x_2 \leq 2000, x_1+x_2 \leq 1500) and (x_2 \leq 600)

and \mathrm{x}_{1}, \mathrm{x}_{2} \geq0), which one of the following points does not lie in the positive bounded region

Options

A $(1000,0)$
B $(0,500)$
C $(2,0)$
D $(2000,0)$

Correct answer

D. $(2000,0)$

Step-by-step solution

Clearly point

(2000,0)

is outside.

Practice Linear Programming on Quantrex Academy →

More from Linear Programming

If the number of available constraints is 3 and the number of parameters to be optimise… BITSAT 2024 Minimum value of Z=3 x+5 y subject to constraints x+y ≥ 2, x+3 y ≥ 3, x, y ≥ 0 BITSAT 2023 The maximum value of z=5 x+2 y subject to constraints x+y ≤ 7, x+2 y ≤ 10, x, y ≥ 0 BITSAT 2023 The maximum value of z=6 x+8 y subject to constraints 2 x+y ≤ 30, x+2 y ≤ 24 and x ≥ 0, y… BITSAT 2020 The maximum value of Z = 4x + 2y subject to constraints 2x + 3y ≤ 18, x + y ≥ 10 and x, y… BITSAT 2018 The coordinates of the point at which minimum value of Z = 7x - 8y subject to constraints… BITSAT 2018 Minimise Z=∑_ j=1 ^ n ∑_ i=1 ^ m c_ i j x_ i j Subject to ∑_ i=1 ^ m x_ i j =b_ j… BITSAT 2015 Consider (x)/(2)+(y)/(4) ≥ 1 and (x)/(3)+(y)/(2) ≤ 1, x, y ≥ 0 . Then number of possible… BITSAT 2014 A shopkeeper wants to purchase two articles A and B of t price 4 and 3 respectively. He… BITSAT 2013 Which of the following is not a vertex of the positive region bounded by the inqualities… BITSAT 2011 Full Linear Programming list Linear Programming JEE Maths PYQs JEE Mathematics PYQs All BITSAT PYQs