Q1:
2026: 31 May Shift 2
Algebra
Linear Programming
Medium
Common
The feasible region for a LPP is shown in the given figure. The maximum value of is :
2026: 31 May Shift 2
Algebra
Linear Programming
Medium
Common
The feasible region for a LPP is shown in the given figure. The maximum value of is :
2026: 31 May Shift 2
Algebra
Linear Programming
Medium
Core
A LPP subjected to the constraints , , , then is
2026: 31 May Shift 2
Algebra
Linear Programming
Hard
Core
A LPP having bounded feasible region with vertices on and . Then which of following are TRUE?
A. occurs at and if
B. occurs at and if
C. does not exist
D. if occurs at and , then occurs for infinite number of value of and
Choose the correct answer from the options given below:
2026: 31 May Shift 2
Algebra
Linear Programming
Medium
Applied
If the corner points of the bounded feasible region for an LPP are , and , then the minimum value of the objective function occurs at :
2026: 31 May Shift 2
Algebra
Linear Programming
Medium
Applied
Consider a LPP given by:
Maximize ,
Subject to: , , .
Then which of the following statements are correct ?
A. The corner points of the feasible region are .
B. The feasible region is unbounded.
C. The feasible region is bounded.
D. The maximum value of is obtained at .
Choose the correct answer from the options given below:
2026: 30 May Shift 2
Algebra
Linear Programming
Medium
Common
The point/points which provides the optimal solution of the linear programming problem maximum , , is/are
2026: 30 May Shift 2
Algebra
Linear Programming
Easy
Core
The corner points of the bounded feasible region of a linear programming problem are A(15,0), B(40,0), C(4, 18), D(6, 12) and objective function is , then which of the following are TRUE?
(A) Value of z at point A(15, 0) = 300.
(B) Value of z at point B(40, 0) = 800.
(C) Value of z at point C(4, 18) = 340.
(D) Maximum value of z = 800.
Choose the correct answer from the options given below:
2026: 30 May Shift 2
Algebra
Linear Programming
Easy
Applied
Consider the linear programming problem (LPP):
Max Z= 4x + 3y
subject to the constraints:
. At what coordinates will the objective function have optimal solution?
2026: 30 May Shift 2
Algebra
Linear Programming
Easy
Applied
If the objective function for a LPP is and the corner points of the bounded feasible region are (0, 0), (6, 0), (3, 5) and (0, 3), then the value of is:
2026: 30 May Shift 1
Algebra
Linear Programming
Easy
Common
The corner points of the bounded feasible region determined by the system of linear constraints of an LPP are (0, 0), (0, 8), (5, 0) and (4, 10). Let be the objective function, then the minimum value of is:
2026: 30 May Shift 1
Algebra
Linear Programming
Medium
Core
In reference to a linear programming problem (LPP), which of the following statements are true?
A. The optimal value of the objective function is attained at the points given by intersections of inequation with the axes only.
B. The objective function of a LPP is a linear function to be optimized.
C. Every LPP admits an optimal solution.
D. The region represented by the inequation system, , is bounded in the first quadrant.
Choose the correct answer from the options given below:
2026: 30 May Shift 1
Algebra
Linear Programming
Medium
Core
For a LPP, the objective function is and the feasible region determined by a set of linear constraints is shown in the graph as a shaded portion. Which one of the following statement is true ?
2026: 30 May Shift 1
Algebra
Linear Programming
Easy
Applied
Which of the following statements are correct about the linear programming problem (LPP)?
A. Every point in the feasible region is a feasible solution of the given LPP.
B. An optimal solution of an LPP, if it exists, occurs at one of the extreme points of the convex set of the feasible solutions.
C. The feasible region for an LPP is always a convex set.
D. If an LPP admits two optimal solutions, it has an infinite number of optimal solutions.
Choose the correct answer from the options given below:
2026: 30 May Shift 1
Algebra
Linear Programming
Medium
Applied
The point at which the maximum value of the function , subject to the constraints , , , is obtained, is:
2026: 29 May Shift 2
Algebra
Linear Programming
Easy
Common
The corner points of the bounded feasible region of an LPP are (0,0), (6,0), (4,3) and (0,6). Let , where . Condition on and so that the maximum of occurs at both (4, 3) and (0, 6) is
2026: 29 May Shift 2
Algebra
Linear Programming
Easy
Core
The number of feasible solutions of the linear programming problem as
Maximum subject to the constraints
is
2026: 29 May Shift 2
Algebra
Linear Programming
Easy
Core
For linear programming problem maximize
Subject to the constraints
Maximum value of z is
2026: 29 May Shift 1
Algebra
Linear Programming
Medium
Common
The maximum value of subjected to the constraints is:
2026: 29 May Shift 1
Algebra
Linear Programming
Easy
Core
The feasible region determined by the following constraints of a LPP
is
2026: 29 May Shift 1
Algebra
Linear Programming
Medium
Core
Let the corner points of the bounded feasible region of an LPP determined by a set of constraints are A(1, 5), B(3, 2) and C(2, 1). If the objective function , has maximum values at points A and B, and z has minimum value 8 at point C, then the value of is:
2026: 29 May Shift 1
Algebra
Linear Programming
Medium
Applied
The corner points of the bounded feasible region for an LPP are (0, 0), (6, 0), (4, 3) and (0, 8). The objective function , has maximum value 360 at points (6, 0) and (4, 3). The value of at (0, 8) is :
2026: 29 May Shift 1
Algebra
Linear Programming
Easy
Applied
If the objective function for an LPP is and the corner points for bounded feasible region are (10, 0), (5, 3), (2, 5) and (0, 6), then the minimum value of occurs at
2026: 26 May Shift 2
Algebra
Linear Programming
Medium
Common
If the feasible region (shaded portion)of a LPP is as shown in the graph, then max is:
2026: 26 May Shift 2
Algebra
Linear Programming
Medium
Core
Which one of the region I, II, III, IV is represented by the constraints
2026: 26 May Shift 2
Algebra
Linear Programming
Medium
Core
For any linear programming problem the feasible region is shaded region as given below, then constraints are:
2026: 26 May Shift 2
Algebra
Linear Programming
Medium
Applied
Consider an LPP:
Maximize
Subject to
and
then which of the following statements are TRUE ?
A. The corner points of the bounded feasible region are (0,0), (4,0), (3,3) and (0,4).
B. Maximum value of occurs at (3,3).
C. Maximum value of occurs at (4,0).
D. The maximum value of is 20.
Choose the correct answer from the options given below:
2026: 26 May Shift 2
Algebra
Linear Programming
Medium
Applied
If the objective function for an LPP is and the corner points of the bounded feasible region are (0, 0), (5, 0) , and (0, 2) then the maximum value of occurs at
2026: 25 May Shift 1
Algebra
Linear Programming
Easy
Common
For a two variables linear programming problem (LPP), which of the following statement is correct ?
2026: 25 May Shift 1
Algebra
Linear Programming
Medium
Core
For the linear programming problem:
Minimize , subject to the constraints:
;
;
, then optimal value of is
2026: 25 May Shift 1
Algebra
Linear Programming
Medium
Core
Which of the following group of constraints represents the feasible region given as shaded area below ?