Adaptive Practice
Linear Programming
10 questions • Earn up to 95 XP • First attempt — go for 100%!
0
XP
0
Correct
x1
Combo
Question 1 of 10
⏱ 0:30
Easy
What is the feasible region in a linear programming problem?
Easy
If the constraints of a linear programming problem are x ≥ 0, y ≥ 0, and x + y ≤ 5, which of the following points lies inside the feasible region?
Medium
In a linear programming problem, the objective function is Z = 3x + 4y. If the feasible region is bounded by points (0,0), (4,0), (0,3), what is the maximum value of Z?
Easy
Which of the following statements is true about the solution of a linear programming problem?
Easy
A factory produces two products A and B. Each unit of A requires 2 hours of work and each unit of B requires 3 hours. The factory has 12 hours available. If profit per unit of A is ₹5 and B is ₹7, what is the objective function to maximize profit?
Medium
Which of the following is NOT a constraint in a linear programming problem?
Medium
If the feasible region is unbounded, which of the following is true?
Easy
In the graphical method of linear programming, how do you find the coordinates of the vertices of the feasible region?
Hard
A company produces two items with constraints: x + 2y ≤ 8, 3x + y ≤ 9, x ≥ 0, y ≥ 0. The profit function is P = 5x + 4y. What is the maximum profit?
Easy
Which mnemonic helps remember the steps of solving a linear programming problem?