List of top Mathematics Questions on Linear Programming asked in CUET (PG)

Maximize \( Z = 2x+3y \), subject to the constraints:
\( x+y \le 2 \)
\( 2x+y \le 3 \)
\( x,y \ge 0 \)

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:

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