← Back to Mathematics

Linear Programming

2 Questions Start BITSAT Test

All Exams JEE Mains JEE Advanced TS-EAMCET AP-EAPCET BITSAT

2024 Q1 BITSAT MCQ

iCON Education HYD, 79930 92826, 73309 72826 11 Jun 2026

If the number of available constraints is 3 and the number of parameters to be optimise is 4 , then

the objective function can be optimised

the constraint are short in number

the solution is problem oriented

None of the above

2021 Q2 BITSAT MCQ

iCON Education HYD, 79930 92826, 73309 72826 11 Jun 2026

The linear programming problem minimize z = 3x + 2y subject to constrains x + y $\ge$ 8, 3x + 5y $\ge$ 15, x $\ge$ 0 and y $\ge$ 0, has

one solution

no feasible solution

two solutions

infinitely many solutions

Correct Answer: B

Explanation:

Table for equation x + y = 8 is

x	0	8
y = 8 $ - $ x	8	0

Table for equation 3x + 5y = 15 is

x	0	5
$y = {{15 - 3x} \over 5}$	3	0

BITSAT 2021 Mathematics - Linear Programming Question 2 English Explanation

It can be concluded from the graph, that there is no point which can satisfy all the constrains simultaneously. Therefore, the problem has no feasible solution.

Mathematics Chapters

Linear Programming

Explanation:

Explanation: