EduFarming
Your list · 0हिं

Type at least two letters. Press Esc to close.

↑↓ navigate↵ openTAB cycle filter

Linear Programming · Question 35 of 59

Question 35

MediumOriginal question

Maximise Z=2x+2yZ = 2x + 2y subject to x+y≤5x + y \le 5, x≥0x \ge 0, y≥0y \ge 0. How many optimal solutions are there?

Options for question 35

Show the answer and explanation
CorrectNot quiteAnswer D

Correct answer: D

Explanation

  1. At the corners (0,0)(0, 0), (5,0)(5, 0) and (0,5)(0, 5), Z=0Z = 0, 10 and 10: the maximum 10 is reached at two corners.

  2. Then every point of the edge joining them gives Z=2(x+y)=10Z = 2(x + y) = 10 as well, so there are infinitely many optimal solutions.

Worth noting

Two optimal corners is not 'exactly two': the whole edge between them is optimal.

Concept
Multiple optimal solutions
Typical time
90 s
Your time
—
The rule this testsThe corner-point method
Practise this chapter →

Ten questions from Linear Programming, at your own pace.

Practise this chapter →

Ten questions from Linear Programming, at your own pace.