Mathematics · Linear Programming
For the given linear programming problem:
Minimize Z = 6x + 10y
subject to the constraints:
x ≥ 6, y ≥ 2, 2x + y ≥ 10, and x, y ≥ 0
The redundant constraint(s) is/are:
Minimize Z = 6x + 10y
subject to the constraints:
x ≥ 6, y ≥ 2, 2x + y ≥ 10, and x, y ≥ 0
The redundant constraint(s) is/are:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1y ≥ 2 and x ≥ 0
- 2x ≥ 6, y ≥ 2, x ≥ 0, and y ≥ 0
- 32x + y ≥ 10✓
- 4x ≥ 6 and 2x + y ≥ 10
Correct answer
2x + y ≥ 10
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Preparing for Mathematics?
Practice full-length Mathematics mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Linear Programming MCQs →Want more practice questions on Linear Programming?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Linear Programming