Midterm Exam OR Modelling 3 November 2010

Problem 1 A company manufactures four products (1,2,3,4) on two machines (X and Y). The time (in minutes) to process one unit of each product on each machine is shown below: Machine X Y Product 1 10 27 2 12 19 3 13 33 4 8 23 Product 1 must be produced on both machines X and Y but products 2, 3 and 4 can be produced on either machine. So, one unit of product 1 is processed 10 minutes on X and 27 minutes on Y, but one unit of e.g. product 2 is processed 12 minutes on X or 19 minutes on Y. The factory is very small and this means that floor space is very limited. Only one week's production is stored in 50 square metres of floor space where the floor space taken up by each product is 0.1, 0.15, 0.5 and 0.05 (square metres) for products 1, 2, 3 and 4 respectively. Customer requirements mean that the amount of product 3 produced should be related to the amount of product 2 produced. Over a week approximately twice as many units of product 2 should be produced as product 3. Machine X is out of action (for maintenance/because of breakdown) 5% of the time and machine Y 7% of the time. Assuming a working week 35 hours long, formulate the problem of how to manufacture these products as a linear program, given that the objective is to maximize the profit. The profit per unit for each product (1,2,3,4) is 10, 12, 17 and 8 respectively. Problem 2 Consider the following problem. maximise 13x1 + 5x2 125 such that 15x1 + 7x2 <= 20 25x1 + 45x2 <= 15 x1 <= 37 x2 <= 14 x1, x2 >= 0 Graphically depict the feasible region and determine the optimal solution. Problem 3 Use the simplex algorithm to find the optimal solution to the following problem: Maximize Z = 3x + 2y subject to: 2x + y 18 2x + 3y 42 3x + y 24 x0,y0

1/2

Problem 4 Consider the following problem: Max s.t. z = 5x1 + 7x2 x1 2x1 + 3x2 x1 + x2 x1, < < < x2 6 19 8 >0

Feasibility area and Optimal Solution

x2
8 7 6 5 4 3 2 1

Optimal: x1 = 5, x2 = 3, z = 46

10

x1

Determine the shadow prices of all constraints. Problem 5

Consider the example of a manufacturer of animal feed who is producing feed mix for dairy cattle. The feed mix contains one or two active ingredients and a filler to provide bulk. The ingredients have the following nutrient values and variable (i.e. per unit) cost
Ingredient 1 (gram/kg) Ingredient 2 (gram/kg) A 100 200 B 80 150 C 40 20 D 10 Cost/kg 40 60

If we use any of ingredient 2, then we incur a fixed cost of 15 . The sufficient quantity of a nutrients for one kg of feed mix is given below for each nutrient.
Nutrient gram A 90 B 50 C 20 D 2

We need not satisfy all four nutrient constraints, but need only satisfy three of them. Give the complete formulation of the problem, where the objective is to minimize cost.

2/2