Mathematics · Linear Programming
In a linear programming problem to maximize contribution with three 'less than or equal to' (≤) constraints, if the objective function line (iso-profit line) is steeper than constraint (1) and intersects it furthest from the origin along the positive x-axis, at which intersection is contribution maximized?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Intersection of Constraint (1) and the x-axis✓
- 2Intersection of Constraints (1) and (3)
- 3Intersection of Constraints (2) and (3)
- 4Intersection of Constraints (1) and (2)
Correct answer
Intersection of Constraint (1) and the x-axis
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
Start Free Mock Test →Preparing for Mathematics?
Practice full-length 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