MockTests.ORG Sign in

Linear Programming Mock Tests

49 questions available

Linear Programming Mock Test 1

Questions: 30

Linear Programming Mock Test 2

Questions: 19

Sample Questions

CUET Mathematics
Minimize Z = 3x + 4y subject to x + y >= 4, x >= 0, y >= 0. The minimum value of Z is:
A 8
B 10
C 12
D 14
Class 12 Mathematics
The maximum value of Z = 3x + 4y subject to the constraints x + y ≤ 80, x ≥ 0, y ≥ 0 is:
A 240
B 200
C 320
D 160
BITSAT Mathematics
Maximize Z = 3x + 4y subject to x + y ≤ 4, x ≥ 0, y ≥ 0. The maximum value of Z is:
A 16
B 12
C 8
D 20
CUET Mathematics
Maximize Z = 3x + 4y subject to the constraints x + y <= 4, x >= 0, y >= 0. The maximum value of Z is:
A 16
B 12
C 8
D 20
CUET Mathematics
The linear programming problem is to maximize Z = 3x + 4y subject to constraints x + y ≤ 4, x ≥ 0, y ≥ 0. The maximum value of Z is:
A 8
B 12
C 10
D 16
CUET Mathematics
The minimum value of the objective function Z = 3x + 5y subject to the constraints x + y ≤ 10, 2x + 3y ≥ 18, x ≥ 0, y ≥ 0 is:
A 18
B 30
C 27
D 36
Class 12 Mathematics
The maximum value of Z = 5x + 7y subject to x + y ≤ 10, 2x + y ≤ 12, x ≥ 0, y ≥ 0 is:
A 65
B 70
C 60
D 55
CUET Mathematics
In a linear programming problem, the objective function is Z = 5x + 3y. The feasible region has vertices at (0, 0), (0, 5), (4, 3), and (6, 0). The maximum value of Z occurs at:
A (6, 0)
B (4, 3)
C (0, 5)
D (0, 0)

Comments

0/2000

No comments yet. Be the first to share your thoughts!