The corner points of the feasible region for a linear programming problem are (0, 2), (3, 0), (6, 0), (6, 8), and (0, 5). Let F = 4x + 6y be the objective function. The minimum value of F occurs at:

Question

Mathematics · Linear Programming

Verified Solution4 OptionsUpdated: October 2026👁️1 View

Share:

Correct answer

Any point on the line segment joining the points (0, 2) and (3, 0)

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

The Dandi March, also known as the Salt Satyagraha, was led by which influential leader?

Which act formally granted independence to India, marking the end of British rule?

Who was the key figure in establishing the Indian National Congress?

Answer 1

(0, 2) only

Answer 2

(3, 0) only

Answer 3

The midpoint of the line segment joining the points (0, 2) and (3, 0) only

Answer 4

Any point on the line segment joining the points (0, 2) and (3, 0)

Related Practice Questions