IEEM 202, Assignment #1 Solution Due date: 21 September 2005, Wednesday, 12:00 noon. Question 1 (30 marks): For the blending problem: The problem is to determine the optimal amounts of three ingredients to include in an animal feed mix. The final product

IELM202
Exercises
1/6/2011
1. Zales Jewelers uses rubies and sapphires to produce two types of rings. A type 1 ring requires 2 rubies, 3 sapphires, and 1 hour of labor. A type 2 ring uses 3 rubies, 2 sapphires, and 2 hours of labor. Each type 1 ring sells

IELM 202, Assignment #4 Solution Due date: 9 November 2005, Wednesday, 12:00 noon Question 1 (20 marks): Consider the maximum flow problem as below, where the source is node A and the sink is node F, and the arc capacity are the numbers shown next to the

IELM 202, Assignment #5 Due date: 23 November 2005, Wednesday, 12:00 noon Question 1 (30 marks): The Fly-Right Airplane Company builds small jet airplanes to sell to corporations for the use of their executives. To meet the needs of here executives, the c

IELM 202, Assignment #5 Due date: 23 November 2005, Wednesday, 12:00 noon Question 1 (30 marks): The Fly-Right Airplane Company builds small jet airplanes to sell to corporations for the use of their executives. To meet the needs of here executives, the c

IELM 202, Assignment #4 Due date: 9 November 2005, Wednesday, 12:00 noon Question 1 (20 marks): Consider the maximum flow problem as below, where the source is node A and the sink is node F, and the arc capacity are the numbers shown next to the directed

IELM 202, Assignment #6 Due date: 12 December 2005, Monday, 5:00 pm Submitted Location: Room 3208, near Lift 21 Question 1 (30 marks): A political campaign is entering its final stage, and polls indicate a very close election. One of the candidates has en

IELM 202, Assignment #6 Comment Q. 1 The question is similar to the example in the lecture note. Most of you can handle the questions. Q 2. I provided a lot of hints to you in order to make you understand how to do so. Some students considered a lot of co

IELM 202, Assignment #6 Due date: 12 December 2005, Monday, 5:00 pm Submitted Location: Room 3208, near Lift 21 Question 1 (30 marks): A political campaign is entering its final stage, and polls indicate a very close election. One of the candidates has en

IELM 202, Assignment #5 Comment Q. 1 In general, most students had some careless mistakes. They forgot to set up positive integer constraint. The solution may be fractional. Some students forgot to set up the customer handling constraint. The set up cost

IELM 202, Assignment #4 Comment Q. 1 In general, most students demonstrated to find the maximum flow by augmentation. Q 2. Most students could give correct answer. In part a), some students forgot to provide the capacity of the arcs in the network. In par

IELM 202, Assignment #3 Solution Due date: 26 October 2005, Wednesday, 12:00 noon Question 1 (20 marks): Consider the primal problem as below: Maximize Subject to: Z = 2x1 + x2
x2 10 2x1 + 5x2 60 x1 + x 2 18 3x1 + x2 44 and x1 0, x2 0 a). Construct the du

IELM 202, Assignment #3 Comment Q. 1 In general, the students understood how to convert a primal problem to the dual problem. However, some students forgot to point out which variables are basic and which variables are non-basic. The characteristic of non

IELM 202, Assignment #2 Comment Q. 1 In general, the students can answer the question. However, some students made the following mistakes: Missed to define the decision variable Do not consider the inventory issue. Consider some inventory is produced in p

IELM 202, Assignment #2 Solution Due date: 5 October 2005, Wednesday, 12:00 noon Question 1 (25 marks): A company has two manufacturing plants (A and B) and three sales outlets (I, II, III). Shipping costs from the plants to the outlets in $/unit are as f

IELM 202, Assignment #1 Comment Q. 1 Some students are found some difficulty to answer the question. Especially part a). The objective of the question is to make you understand the effect of change of cost parameter towards of the solution. In the sensiti

IEEM 202, Assignment #1 Due date: 21 September 2005, Wednesday, 12:00 noon. Question 1 (30 marks): For the blending problem discussed in class: The problem is to determine the optimal amounts of three ingredients to include in an animal feed mix. The fina

Decision Variable Working hours Objective Values Objective Function Constraints Midnight to 4 a.m. 4 a.m. to 8 a.m. 8 a.m. to noon noon to 4 p.m. 4 p.m. to 8 p.m. 8 p.m. to midnight
Midnight to 8 a.m. 4 a.m. to noon 8 a.m. to 4 p.m. noon to 8 p.m. 4 p.m.

Project Planning
Project planning problems and techniques
AOA networks and critical path
LP for critical path
1
Project Planning Problems and Techniques
Project planning with Gantt Chart
Build a house chart 1
Build a robot chart 2
Product developme

IELM 202
Tutorial 11
1/6/11
definitions of concave function: Formal: Given any two points x1, x2, if f(x1+(1-)x2) f(x1)+(1)f(x2), for all , 0 1, then f(x) is a concave function. Less formal: Informal : If we draw a line segment linking any two point on th

IELM 202
Tutorial 10
1/6/2011
1. Equipment Replacement Problem: N time periods (we must own a machine during each of the N time periods) y = age of machine at the start of year 1 c(x) = annual cost of operating a machine which is of age x at the start of

IELM202
Tutorial 8
1/6/11
1. The Toys-R-4-U Company has developed two new toys for possible inclusion in its product line for the upcoming Christmas season. Setting up the production facilities to begin production would cost $50,000 for toy 1 and $80,000

IELM202
Tutorial 7
1/6/11
1. Example: Construct a project network for the project of building a house. The activities, their durations (in days) and their precedence relationships are given in the table below. Activity A. Excavate B. Foundation C. Rough w

IELM202
Tutorial 5
1/6/11
1. You need to take a trip by car to another town that you have never visited before. Therefore, you are studying a map to determine the shortest route to your destination. Depending on which route you choose, there are five othe

IELM20205 1. Consider the linear program (P) Max Z= 3 X 1 + 5 X 2 X1 4 Subject to 2 X 2 12 3 X 1 + 2 X 2 18 X1, X 2 0 Write down the dual of this LP
Tutorial 4
According to the following table Primal model (MAX) Constraint j is Constraint j is = Constrain