Site pages

Current course

Participants

General

28 July - 3 August

4 August - 10 August

11 August - 17 August

18 August - 24 August

25 August - 31 August

1 September - 7 September

8 September - 14 September

15 September - 21 September

22 September - 28 September

29 September - 5 October

6 October - 12 October

13 October - 19 October

20 October - 26 October

27 October - 2 November

3 November - 9 November

10 November - 16 November

17 November - 23 November

1. A farmer has 1000 acres to be allocated among three crops. The number of person-hours per acre required for each corp and its profit per acre are given as follows.

Person-hour per acre

Profit per acre

Ifthe farmer has at most 6000 person-hours available, determine the number of acres of each crop that should be planted to maximize the total profit.

It is desired to maintain a balanced loading on all machines such that no machine runs more than 30 minutes per day longer than any other machine (assume that the milling load is split evenly among all five milling machines).

Divide the work time of each machine to obtain the maximum number of completed assemblies assuming an 8-hour working day.

Formulate this problem as linear programming problem.

Person-hour per acre

Crop A | Crop B | Crop C |

3 | 5 | 4 |

Profit per acre

Crop A | Crop B | Crop C |

$600 | $300 | $500 |

Ifthe farmer has at most 6000 person-hours available, determine the number of acres of each crop that should be planted to maximize the total profit.

- Formulate this as a linear programming problem.
- Use a spreadsheet to solve the problem.

Part | Drill | Mill |

1 | 3 minutes | 20 minutes |

2 | 5 minutes | 15 minutes |

It is desired to maintain a balanced loading on all machines such that no machine runs more than 30 minutes per day longer than any other machine (assume that the milling load is split evenly among all five milling machines).

Divide the work time of each machine to obtain the maximum number of completed assemblies assuming an 8-hour working day.

Formulate this problem as linear programming problem.

Available from: | Friday, 3 October 2008, 6:30 PM |

Due date: | Monday, 6 October 2008, 5:30 AM |