Q1:
2026: 25 May Shift 1
Algebra
Linear Programming
Hard
Applied
Consider the objective function subject to the following constraints: . Which of the following inequalities does not contribute to the feasible region?
2026: 25 May Shift 1
Algebra
Linear Programming
Hard
Applied
Consider the objective function subject to the following constraints: . Which of the following inequalities does not contribute to the feasible region?
2026: 25 May Shift 1
Algebra
Linear Programming
Medium
Applied
A company makes two types of cakes: type A and type B. it costs ₹ 360 to make a type A cake and ₹ 120 to make a type B cake. The company can make atmost 300 cakes and spend atmost ₹ 72,000 a day, the number of cakes of type B () cannot exceed the number of type A () cakes by more than 200.
The company makes a profit of ₹ 200 on each type A cake and ₹ 50 on each type B cake. A LPP to maximize the profit (₹) is
2026: 22 May Shift 2
Algebra
Linear Programming
Medium
Common
The feasible region represented by the constraints of LPP is
2026: 22 May Shift 2
Algebra
Linear Programming
Easy
Core
The corner points of the feasible region of a LPP are (0,2), (3,0), (6,0), (6,8) and (0,5). If the objective function is , then the sum of maximum and minimum value of z is equal to:
2026: 22 May Shift 2
Algebra
Linear Programming
Hard
Core
Consider the LPP: Minimize subject to . Then which of the following statements are TRUE?
(A) Corner points of the feasible region of the LPP are (0,5), (0,3), (1,0), (6,0).
(B) The optimum value of the objective function is -300
(C) Optimum value does not exist
(D) The optimum value of the objective function is 100
Choose the correct answer from the options given below:
2026: 22 May Shift 2
Algebra
Linear Programming
Hard
Applied
For the LPP,
Subject to
Match List-I with List-II
| List-I | List-II |
|---|---|
| (A) | (I) 180 |
| (B) | (II) 320 |
| (C) | (III) 240 |
| (D) If is attained at , then is | (IV) 800 |
Choose the correct answer from the options given below:
2026: 22 May Shift 2
Algebra
Linear Programming
Medium
Applied
In reference to linear programming problem (LPP), which of the following statement is NOT correct?
2026: 22 May Shift 1
Algebra
Linear Programming
Medium
Common
The corner points of the bounded feasible region determined by are A(0, 10), B(5, 5), C(15, 15) and D(0, 20). If the objective function has its maximum value on the line segment CD, then the relation between and is:
2026: 22 May Shift 1
Algebra
Linear Programming
Medium
Core
For a LPP, maximize , subjected to constraints:
Which of the following statements are TRUE ?
(A) Vertices of feasible region are (2, 0), (7, 0), (7, 3), (5, 5) and (2, 2).
(B) Maximum at point (5, 5).
(C) Maximum at infinite numbers of points.
(D) The feasible region is unbounded.
Choose the correct answer from the options given below:
2026: 22 May Shift 1
Algebra
Linear Programming
Medium
Core
The linear constraints for which the shaded region in the figure is the solution set, are
2026: 22 May Shift 1
Algebra
Linear Programming
Easy
Applied
A manufacturer produces two products, A and B. Both products are processed on two different machines. The available capacity of the first machine is 12 hours and of second machine is 9 hours per day. Each unit of product A requires 3 hours on both machines and each unit of product B requires 2 hours on first machine and 1 hour on second machine. Each unit of product A is sold at ₹7 profit and that of product B at a profit of ₹4. A LPP to maximise the profit is:
2026: 22 May Shift 1
Algebra
Linear Programming
Easy
Applied
If the objective function for a LPP is and the corner points for bounded feasible region are (9,0), (4,3), (2,5) and (0,8), then the maximum value of Z occurs at
2026: 21 May Shift 2
Algebra
Linear Programming
Easy
Common
Consider a LPP with objective function . If its feasible region R is bounded, then
2026: 21 May Shift 2
Algebra
Linear Programming
Medium
Core
Consider a LPP with objective function subjected to certain constraints with a bounded feasible region such that maximum and minimum , which occur at the corner points and respectively, Then the value of is:
2026: 21 May Shift 2
Algebra
Linear Programming
Medium
Core
Which one of the following set of constraints depicted the shaded region given below?
2026: 21 May Shift 2
Algebra
Linear Programming
Medium
Applied
The corner points of the bounded feasible region for an LPP are and . If the objective function is , then the condition on and so that the maximum of occurs at and is
2026: 21 May Shift 2
Algebra
Linear Programming
Medium
Applied
Consider an LPP:
Maximise
Subject to
Which of the following are correct?
A. The feasible region is bounded.
B. The corner points of the feasible region are and .
C. The corner points of the feasible region are and .
D. The maximum value of Z is 350.
Choose the correct answer from the options given below:
2026: 21 May Shift 1
Algebra
Linear Programming
Medium
Common
The feasible region for a LPP is shown in the figure. The minimum value of Z = 2x - 3y is
2026: 21 May Shift 1
Algebra
Linear Programming
Medium
Core
The maximum value of subject to the constraints
is
2026: 21 May Shift 1
Algebra
Linear Programming
Medium
Core
The number of corner points of the feasible region determined by the constraints is
2026: 21 May Shift 1
Algebra
Linear Programming
Easy
Applied
The feasible region of inequality is
2026: 21 May Shift 1
Algebra
Linear Programming
Medium
Applied
Max (z) = 5x + 10y subject to constraints:
Which of the following points do not lie in the feasible region of the above LPP ?
(A) (90, 15)
(B) (30, 15)
(C) (60, 20)
(D) (90, 10)
Choose the correct answer from the options given below:
2026: 19 May Shift 2
Algebra
Linear Programming
Hard
Common
Refer to the LPP given by , subject to constraints
:
In the given figure, If = value of Z at A, = value of Z at C and Max.(Z) = maximum value of Z, then which of the following relations between , and Max.(Z) are correct?
A. Max.(Z)
B.
C.
D.
Choose the correct answer from the options given below:
2026: 19 May Shift 2
Algebra
Linear Programming
Medium
Core
For the constriants , and , the feasible region is:
2026: 19 May Shift 2
Algebra
Linear Programming
Medium
Core
Two linear programming problems (LPPs) have same bounded feasible region with three corner points . If and are objective functions of LPPs, then which of the following is/are correct?
A. only maximizes at .
B. both minimize at .
C. both maximize at .
D. maximizes at .
Choose the correct answer from the options given below:
2026: 19 May Shift 2
Algebra
Linear Programming
Medium
Applied
In a LPP, Let R be the feasible region, then which of the following are TRUE?
A. If R is bounded, then the objective function Z has both a maximum and minimum value on R.
B. If R is unbounded, then the objective function Z may or may not have a maximum or minimum value.
C. If a optimal solution exists. It must occur at atleast one corner point of R.
D. If R is bounded, then maximum value will exist but minimum may or may not exist for an objective function Z.
Choose the correct answer from the options given below:
2026: 19 May Shift 2
Algebra
Linear Programming
Hard
Applied
Ravi rides his motor cycle at 25 km per hour, he has to spend ₹ 4 per kilometer on petrol, if he rides at a faster speed of 40 km per hour, the petrol cost increases to ₹ 10 per kilometer. He can spend ₹ 200 on petrol and wishes to maximize distance he can travel within one hour. Which of the following is/are TRUE?
A. Maximum distance covered in one hour is 30 km
B. The distance covered at speed of 25km/hr is 50/3 km
C. The distance covered at speed of 25km/hr is km
D. The distance covered at speed of 40km/hr is km
Choose the correct answer from the options given below:
2026: 19 May Shift 1
Algebra
Linear Programming
Easy
Common
The maximum value of , subjected to the constraints:
, ;
, is
2026: 19 May Shift 1
Algebra
Linear Programming
Medium
Core
The corner points O, A, B, C, D and E of the bounded feasible region determined by the system of linear constraints are shown in the given figure.
If be the objective function, then the minimum of z, is:
2026: 19 May Shift 1
Algebra
Linear Programming
Easy
Core
If , where , is the objective function. Then the condition on p and q so that the maximum value of z occurs at A(4, 10) and B(6, 8), is: