CUET-PG SERIES Mathematics
Linear Programmig Problem
6 previous year questions.
Volume: 6 Ques
Yield: Medium
High-Yield Trend
6
2023 Chapter Questions 6 MCQs
01
PYQ 2023
hard
mathematics ID: cuet-pg-
The solution x1 = 1, x2 = 1, x3 = 0 and z = 3 to the system of equations
x1+x2+x3=2
x1+x2-x3=2
x1,x2,x3\geq 0
which minimizes z = x1 + 2x2 + 3x3 is
x1+x2+x3=2
x1+x2-x3=2
x1,x2,x3\geq 0
which minimizes z = x1 + 2x2 + 3x3 is
1
not feasible
2
not basic
3
feasible and basic
4
basic but not feasible
02
PYQ 2023
medium
mathematics ID: cuet-pg-
Which of the following is false for linear programming problem (LLP)?
1
A feasible solution is one which meets at least one of the constraints of the problem.
2
An optimal solution to a linear programming problem in a feasible solution which optimizes.
3
For a linear programming model, the feasible region may change if non-binding constraints are deleted.
4
For a linear programming problem to be unbounded its feasible region must be unbounded.
03
PYQ 2023
medium
mathematics ID: cuet-pg-
The maximum value of Z = x + 2y subjected to the constraints x+2y≥100, 2x-y≤0,2x + y≤ 200,x≥ 0, y≥0, is:
1
250
2
100
3
350
4
400
04
PYQ 2023
medium
mathematics ID: cuet-pg-
If there is no feasible region in LPP, then the problem has:
1
Unique solution
2
Infinite solutions
3
Unbounded solution
4
No solution
05
PYQ 2023
medium
mathematics ID: cuet-pg-
From the given system of constraints
A. 3x+5y≤90
B. x + 2y≤30
C. 2x + y≤30
D. x≥0, y≥0
The redundant constraint is :
A. 3x+5y≤90
B. x + 2y≤30
C. 2x + y≤30
D. x≥0, y≥0
The redundant constraint is :
1
D
2
A
3
B
4
C
06
PYQ 2023
medium
mathematics ID: cuet-pg-
The solution of the Linear Programming Problem
maximize Z = 107x + y
subject to constraints x + y \leq 2
-3x + y \geq 3
x, y \geq 0 is
maximize Z = 107x + y
subject to constraints x + y \leq 2
-3x + y \geq 3
x, y \geq 0 is
1
0
2
2
3
4
4
No Solution