Mathematics · Linear Programming
The feasible region of a Linear Programming Problem (LPP) is bounded by the axes and two lines. If the boundary lines pass through the points (52, 0), (0, 104) and (76, 0), (0, 38) respectively, and the region contains the origin, then the constraints of the LPP (other than x ≥ 0, y ≥ 0) are:
- 1x + 2y ≤ 104 and 2x + y ≤ 38
- 2x + 2y ≤ 104 and 2x + y ≤ 76
- 32x + y ≤ 104 and x + 2y ≤ 76✓
- 42x + y ≤ 52 and x + 2y ≤ 76
Correct answer
2x + y ≤ 104 and x + 2y ≤ 76
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!
Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
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