EduFarming
Your list · 0हिं

Type at least two letters. Press Esc to close.

↑↓ navigate↵ openTAB cycle filter

Linear Programming · Question 41 of 59

Question 41

MediumOriginal question

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

Options for question 41

Show the answer and explanation
CorrectNot quiteAnswer D

Correct answer: D

Explanation

  1. Corners: (0,0)(0, 0), (0,4)(0, 4), (6,0)(6, 0), (6,1)(6, 1); ZZ is 00, 2424, 1818, 2424.

  2. The maximum, 24, comes at both (0,4)(0, 4) and (6,1)(6, 1), because Z=3(x+2y)Z = 3(x + 2y) is parallel to the edge x+2y=8x + 2y = 8; every point of that edge is optimal.

Worth noting

'Exactly two' counts only the corners, but every point between them on the edge gives 24 too.

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.