Linear Programming · Class 12 · CBSE · Science Mathematics
In a linear programming problem, a point that satisfies all the constraints, including the non-negativity restrictions, is called a:
Practice question from Linear Programming (Class 12 · CBSE · Science Mathematics), with the correct answer and a step-by-step solution.
easy · MCQ · Q-47DE5B
In a linear programming problem, a point that satisfies all the constraints, including the non-negativity restrictions, is called a:
- A.Feasible solutionCorrect answer
- B.Optimal solution
- C.Infeasible solution
- D.Unbounded solution
Solution
A feasible solution satisfies every constraint of the linear programming problem. An optimal solution is a feasible solution that gives the best value of the objective function.
More from Linear Programming
- Which of the following points satisfies all the constraints x + y ≤ 6, x ≤ 4, y ≤ 5, x ≥ 0 and y ≥ 0?
- Find the maximum value of Z = 3x + 2y subject to x + y ≤ 4, x ≤ 2, y ≤ 3, x ≥ 0 and y ≥ 0.
- For the linear programming problem: Maximise Z = x + y, subject to x + y ≥ 5, x ≥ 0 and y ≥ 0, which statement is correct?
- A bakery produces cakes and pastries. Each cake requires 2 kg of flour and 1 hour of labour, while each pastry requires 1 kg of flour and 2…
Practise more Mathematics
Sign up free for adaptive practice on this chapter, with instant feedback and hints on every question.
Start practising freeFree to start · No credit card needed