Adaptive Practice
Linear Programming
10 questions • Earn up to 104 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
In a Linear Programming problem, the objective function is:
Easy
Which method is commonly used to solve Linear Programming problems graphically?
Medium
If the objective function is Z = 3x + 4y, and constraints are x + y ≤ 5, x ≥ 0, y ≥ 0, what is the maximum value of Z?
Medium
In the context of Linear Programming, what does 'unbounded solution' mean?
Hard
Consider the problem: Maximize Z = 2x + 3y subject to constraints x + 2y ≤ 8, 3x + y ≤ 9, x ≥ 0, y ≥ 0. What is the optimal solution?
Medium
Which of the following is NOT a characteristic of Linear Programming problems?
Easy
In a Linear Programming problem, the corner point method involves:
Hard
A factory produces two products A and B. Each unit of A requires 2 hours of machining and 1 hour of assembly. Each unit of B requires 1 hour of machining and 3 hours of assembly. The factory has 100 hours of machining and 90 hours of assembly available. If the profit per unit of A is ₹40 and per unit of B is ₹50, formulate the Linear Programming problem to maximize profit.
Medium
In the Simplex method, what is the role of slack variables?