1 / 14

3.2 Linear Programming

3.2 Linear Programming. 3 Credits AS 91574. Linear Programming. Learning objectives. I can find the maximum or minimum of an objective function using the moving line approach. Define the unknowns x = y =. x = number of hectares of barley y = number of hectare of swedes.

montana
Télécharger la présentation

3.2 Linear Programming

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 3.2 Linear Programming 3 Credits AS 91574

  2. Linear Programming Learning objectives • I can find the maximum or minimum of an objective function using the moving line approach

  3. Define the unknowns x = y = x = number of hectares of barley y = number of hectare of swedes

  4. Define the constraints Land Cost Man power Land x + y ≤ 20 Cost 30x + 20y ≤ 480 manpower x + 2y ≤ 36

  5. Profit P = P = 100x + 120y

  6. the problem can be summarised as maximise the profit P = 100x + 120y subject to x + y ≤ 20 30x + 20y ≤ 480 x + 2y ≤ 36 x ≥ 0 y ≥ 0

  7. profit P = 100x + 120y the gradient of this line is draw lines parallel to this to find the maximum

  8. this should give you x = 4 and y = 16 maximum profit is 100 x 4 + 120 x 16 = 2320 the farmer should sow 4 acres of barley and 16 acres of swedes

  9. Success Criteria • I can find the maximum or minimum of an objective function using the moving line approach Delta 4.02 page 56

More Related