Mathematics · Linear Programming
Corner points of the feasible region for a Linear Programming Problem (LPP) are (0, 2), (3, 0), (6, 0), and (6, 8). If z = 2x + 3y is the objective function of the LPP, then [Max(z) - Min(z)] is equal to:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 19
- 221
- 324
- 430✓
Correct answer
30
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