Mathematics · Linear Programming

The corner points of the feasible region of a linear programming problem are (0, 4), (8, 0), and (203, 43). If Z = 30x + 24y is the objective function, then the value of (Maximum value of Z − Minimum value of Z) is equal to:

Verified Solution4 OptionsUpdated: October 2026👁️1 View

Correct answer

144

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

Mahatma Gandhi's last fast unto death in 1948 was primarily against which of the following?

What was the primary meaning of 'Swaraj' as popularized by Mahatma Gandhi during India's independence movement?

What was one major impact of India’s independence on its economy?

Related Practice Questions