Description

This activity is based on the material you learned in Unit 17, Linear Programming.

You will also need to be familiar with the material from lab 18 as you can make use of techniques covered in this lab for utilising available software to solve linear programming problems.

You can choose to complete this activity either by completing the graphs and calculations by hand or by utilising appropriate software.

The logbook activity must be written up in the form of a brief report so that it can be printed and handed it at the end of the module. You may present a hand drawn graph but it must be clear and neat, if it is not marks will be deducted. All discussions and calculations must be typed, and the length of your report should not exceed 2 pages.

Tasks

A manufacturer produces two types of electrical components, X and Y. The table below gives information about the production of batches of these components. Each component must go through three departments, Pressing, Wiring and Assembly.

1. Draw a graph of the constraint inequalities, clearly marking the feasible region.
2. How many batches of each type of component should be produced to maximise profit? Evaluate the maximum profit achieved.

Price: $5.57

Solution: The downloadable solution consists of 3 pages, 257 words and 2 charts.
Deliverable: Word Document