Adaptive Practice
Linear Programming
10 questions • Earn up to 113 XP • First attempt — go for 100%!
0
XP
0
Correct
x1
Combo
Question 1 of 10
⏱ 0:30
Easy
What is the graphical method used for in Linear Programming?
Easy
Which of the following represents the feasible region in a linear programming problem?
Medium
If the objective function is Z = 3x + 4y, which of the following points will maximize Z given the constraints x ≥ 0, y ≥ 0, and x + y ≤ 5?
Medium
Which of the following is NOT a necessary condition for a linear programming problem?
Easy
In a linear programming problem, the optimal solution lies at:
Medium
Consider the constraints: x + 2y ≤ 8, 3x + y ≤ 9, x ≥ 0, y ≥ 0. How many corner points does the feasible region have?
Hard
A factory produces two products A and B. Each unit of A requires 2 hours of labor and 3 hours of machine time. Each unit of B requires 1 hour of labor and 2 hours of machine time. The factory has 100 hours of labor and 150 hours of machine time available. Which inequality represents the labor constraint?
Hard
If the objective function is Z = 5x + 7y and the feasible region is unbounded, which of the following is true?
Hard
Solve the system of inequalities to find the maximum value of Z = 4x + 3y:
x + y ≤ 6
2x + y ≤ 8
x ≥ 0, y ≥ 0
Hard
Which of the following statements is true about the dual of a linear programming problem?