A bounded feasible region of a linear programming problem has vertices at (0, 2), (2, 1), and (0, 3). Which of the following sets of constraints defines this feasible region?

Question

Mathematics · Linear Programming

Verified Solution4 OptionsUpdated: October 2026👁️1 View

Share:

Correct answer

x + 2y ≥ 4, x + y ≤ 3, x ≥ 0, y ≥ 0

Save this question and verified answer as a clean study sheet with live clickable link.

👥

Challenge your peer aspirants on WhatsApp or Telegram to solve this question!

Online Test Series

Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.

Chapter Practice

Want more practice questions on Linear Programming?

Solve complete topic-wise tests with detailed solutions on GkGet.

Recommended practice questions in Mathematics · Linear Programming

The arrival of which commission in India triggered widespread protests, including mass hartals across the country in 1928?

Which of the following leaders was instrumental in initiating and leading India’s struggle for independence?

Answer 1

x + 2y ≥ 4, x + y ≥ 3, x ≤ 0, y ≤ 0

Answer 2

x + 2y ≥ 4, x + y ≥ 3, x ≥ 0, y ≥ 0

Answer 3

x + 2y ≤ 4, x + y ≤ 3, x ≥ 0, y ≥ 0

Answer 4

x + 2y ≥ 4, x + y ≤ 3, x ≥ 0, y ≥ 0

Related Practice Questions