EduFarming
Your list · 0हिं

Type at least two letters. Press Esc to close.

↑↓ navigate↵ openTAB cycle filter

Linear Programming · Question 30 of 59

Question 30

EasyOriginal question

The corner points of a bounded feasible region are (0,0)(0, 0), (5,0)(5, 0), (3,4)(3, 4) and (0,6)(0, 6). What is the maximum of Z=4x+3yZ = 4x + 3y?

Options for question 30

Show the answer and explanation
CorrectNot quiteAnswer C

Correct answer: C

Explanation

  1. For a bounded region, the maximum is at a corner: work out ZZ at each.

  2. Z=0Z = 0, 20, 12+12=2412 + 12 = 24 and 18, so the maximum is 24, at (3,4)(3, 4).

Worth noting

20 is ZZ at (5,0)(5, 0), the corner with the largest xx; the largest ZZ can be elsewhere.

Concept
Evaluating Z at given corners
Typical time
60 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.