Q1:
2025: 14 May Shift 2
Algebra
Linear Programming
Medium
Common
The maximum value of the objective function of an LPP subject to constraints is:
2025: 14 May Shift 2
Algebra
Linear Programming
Medium
Common
The maximum value of the objective function of an LPP subject to constraints is:
2025: 14 May Shift 2
Algebra
Linear Programming
Medium
Core
The minimum value of the objective function of an L.P.P. subject to constraints is:
2025: 14 May Shift 2
Algebra
Linear Programming
Medium
Core
For an LPP: Maximize , , the feasible region OAB is shown in the figure, then the other constraints are
2025: 14 May Shift 2
Algebra
Linear Programming
Medium
Core
The maximum value of the objective function of an LPP, subject to the constraints , is
2025: 14 May Shift 2
Algebra
Linear Programming
Medium
Applied
If the objective function of a linear programming problem attains its optimal value at the points (4, 7) and (5, 5) and then
2025: 14 May Shift 2
Algebra
Linear Programming
Hard
Applied
Consider the linear programming problem(LPP):
Minimize
Which of the following is correct for the above linear programming problem (LPP):
(A) The LPP has a bounded feasible region.
(B) The LPP has a unique optimal solution.
(C) The optimal value of the LPP exists at the point (3/2, 0)
(D) The corner points of the feasible region are (3/2, 0), (3/5, 6/5), (2/5, 6/5) and (4, 0)
Choose the correct answer from the options given below:
2025: 14 May Shift 1
Algebra
Linear Programming
Medium
Common
The corner points of the feasible region associated with the LPP: Maximise , subject to , , are (0, 0), (5, 0), (3, 4) and (0, 5). If optimum value occurs at both (3, 4) and (0, 5), then
2025: 14 May Shift 1
Algebra
Linear Programming
Medium
Common
Consider the LPP: Minimize subject to , , . The optimal feasible solution occurs at
2025: 14 May Shift 1
Algebra
Linear Programming
Medium
Core
Which one of the following set of constraints does the given shaded region represent?
2025: 14 May Shift 1
Algebra
Linear Programming
Medium
Core
The corner points of the feasible region of the LPP: Minimize subject to , , and are
2025: 14 May Shift 1
Algebra
Linear Programming
Medium
Applied
Which of the following is NOT a basic requirement of the linear programming problem (LPP)?
2025: 14 May Shift 1
Algebra
Linear Programming
Medium
Applied
Which of the following statements are correct in reference to the linear programming problem(LPP):
Maximize
subject to the following constraints
, , .
(A) The LPP has a unique optimal solution at only.
(B) The feasible region is bounded with corner points , , and .
(C) The optimal value is unique, but there are an infinite number of optimal solutions.
(D) The feasible region is unbounded.
Choose the correct answer from the options given below:
2025: 13 May Shift 2
Algebra
Linear Programming
Medium
Common
The objective function of an LPP is . If the maximum value of the objective function is 180, which occurs at two points (15,15) and (0,20), then which one of the following is true?
2025: 13 May Shift 2
Algebra
Linear Programming
Easy
Common
If the corner points of the bounded feasible region of an LPP with objective function Maximize are (0,0), (1,2) and (1,1), then its optimal value is
2025: 13 May Shift 2
Algebra
Linear Programming
Medium
Core
The feasible region of the linear programming problem is represented below:
The constraints of this LPP are
2025: 13 May Shift 2
Algebra
Linear Programming
Hard
Core
The optimal value of the objective function of the LPP, Minimize subject to constraints , , , , is equal to:
2025: 13 May Shift 2
Algebra
Linear Programming
Medium
Applied
Which of the following is incorrect about the Linear Programming Problem (LPP)?
2025: 13 May Shift 2
Algebra
Linear Programming
Medium
Applied
A manufacturing unit makes two models, 'classic' and 'supreme' of the scooter. Each piece of the classic model requires 9 labour hours for assembling and 1 labour hour for finishing. Each piece of supreme model requires 12 labour hours for assembling and 3 labour hour for finishing. For assembling and finishing, the maximum labour hours available are 180 and 30 respectively. The company makes a profit of ₹ 10000 on each piece of the classic model and ₹ 15000 on each piece of the supreme model. Which of the following options describes the given Linear Programming Problem (LPP) to maximize the profit Z (Max Z) (where x and y are the number of pieces of the classic model and the supreme model respectively)?
2025: 13 May Shift 1
Algebra
Linear Programming
Easy
Common
If corner points of the bounded feasible region are (0, 0), (3, 0) and (0, 3) and objective function is , then the maximum value of is
2025: 13 May Shift 1
Algebra
Linear Programming
Medium
Common
In the given figure, feasible region represented by the constraints , , , is
2025: 13 May Shift 1
Algebra
Linear Programming
Easy
Core
The feasible region associated with the inequality is
2025: 13 May Shift 1
Algebra
Linear Programming
Medium
Core
Consider the LPP: Maximize subject to the constraints , , . The optimal feasible solution is
2025: 13 May Shift 1
Algebra
Linear Programming
Medium
Applied
For the linear programming problem(LPP),
Maximize
.
Which of the following are NOT true?
(A) The given LPP has unbounded feasible region.
(B) The corner points of the feasible region are (0,0), (0, 5), (3, 2) and (3, 0).
(C) The optimal value of the objective function is 12.
(D) The given LPP has a unique optimal solution.
Choose the correct answer from the options given below:
2025: 13 May Shift 1
Algebra
Linear Programming
Medium
Applied
If a person rides his motorbike km at 30 km per hour, he has to spend ₹ 3 per kilometer on petrol. If he rides km at a faster speed of 40 km per hour, the petrol cost increases to ₹ 4 per kilometer. If he has ₹ 100 to spend on petrol and wishes to find the maximum distance he can travel within one hour, then linear programming problem (LPP) formulation is:
2024: 16 May Shift 1
Algebra
Linear Programming
Medium
Common
The corner points of the feasible region determined by are and . If the objective function by has its maximum value on the line segment , then the relation between and is :
2024: 16 May Shift 1
Algebra
Linear Programming
Easy
Common
An objective function is maximum at points and . If and and , then the maximum value of the function is equal to :
2024: 16 May Shift 1
Algebra
Linear Programming
Easy
Core
The feasible region represented by the constraints of an LPP is
2024: 16 May Shift 1
Algebra
Linear Programming
Easy
Core
Which one of the following represents the correct feasible region determined by the following constraints of an LPP?
2024: 16 May Shift 1
Algebra
Linear Programming
Medium
Applied
A person wants to invest an amount of ₹ . He has two options A and B yielding and return respectively on the invested amount. He plans to invest at least ₹ in Plan A and at least ₹ in Plan B. Also he wants that his investment in Plan A is less than or equal to his investment in Plan B. Which of the following options describes the given LPP to maximize the return (where and are investments in Plan A and Plan B respectively) ?
2024: 16 May Shift 1
Algebra
Linear Programming
Medium
Applied
The corner points of the feasible region for an L.P.P. are , , and . If the objective function is , where , find the condition on and so that the maximum of occurs at both the corner points and .