.png?h=35&w=35&mode=stretch)
Linear Programming is an important topic in the Mathematics section in CUET PG exam. Practising this topic will increase your score overall and make your conceptual grip on CUET PG exam stronger.
This article gives you a full set of CUET PG PYQs for Linear Programming with explanations for effective preparation. Practice of CUET PG Mathematics PYQs including Linear Programming questions regularly will improve accuracy, speed, and confidence in the CUET PG 2026 exam.
Also Read
CUET PG PYQs for Linear Programming with Solutions
1.
Maximize \( Z = 2x+3y \), subject to the constraints:
\( x+y \le 2 \)
\( 2x+y \le 3 \)
\( x,y \ge 0 \)- 5
- 6
- 7
- 10
2.
For the given linear programming problem,
Minimum Z = 6x + 10y
subject to the constraints
\( x \ge 6 \); \( y \ge 2 \); \( 2x+y \ge 10 \); \( x,y \ge 0 \),
the redundant constraints are:- \( x \ge 6, 2x+y \ge 10 \)
- \( 2x+y \ge 10 \)
- \( x \ge 6, y \ge 2, x \ge 0, y \ge 0 \)
- \( y \ge 2, x \ge 0 \)
3.
For any Linear Programming Problem (LPP), choose the correct statement:
A. There exists only finite number of basic feasible solutions to LPP
B. Any convex combination of k - different optimum solution to a LPP is again an optimum solution to the problem
C. If a LPP has feasible solution, then it also has a basic feasible solution
D. A basic solution to AX = b is degenerate if one or more of the basic variables vanish- A, B and C only
- A, C and D only
- A, B and D only
- A, B, C and D
4.
Arrange the following steps for solving Simplex linear programming problems in the correct order:
- (A), (B), (C), (D)
- (A), (B), (D), (C)
- (B), (A), (D), (C)
- (C), (B), (D), (A)
Comments