linear programming

1. A food company produces a cereal from several ingredients. The cereal is enriched with vitamins A and B which are provided by two of the ingredients, oats and rice. A 1 g of oats contributes 0.32 mg of vitamin A and 0.08 mg of vitamin B, whereas 1 g of rice contributes 0.24 mg of vitamin A and 0.12 mg of vitamin B. Each box of cereal produced has to meet the minimum requirements of 19.20 mg of vitamin A and 7.20 mg of vitamin B. The cost of 1 kg of oats is RM5 and the cost of 1 kg of rice is RM4. The company wants to determine how many grams of oats and rice are to be included in each box of cereal in order to minimise cost. (a) Formulate a linear programming model for the problem to minimise the cost. [5 marks] (b) Using a graphical method, determine how many grams of oats and rice are included in each box of cereal to minimise cost, and find this minimum cost. [8

2. A chemical company produces two types of organic fertilisers at its factory. Three types of raw materials P, Q and R are mixed to produce Type X and Type Y fertilisers. Each ton of Type X fertiliser is a mixture of 0.4 ton of P and 0.6 ton of R, while each ton of Type Y fertiliser is a mixture of 0.5 ton of P, 0.2 ton of Q and 0.3 ton of R. The profit yields for each ton of Type X and Type Y fertilisers are RM400 and RM300 respectively. The quantities of raw materials useable per week are shown in the following table. Raw material Quantity of material useable per week (tons) P 20 Q 5 R 21 (a) If x and y represent the quantities, in tons, of Type X and Type Y fertilisers produced each week, formulate a linear programming model that can be used in order to maximise total pro_t per week. [4 marks] (b) Construct the initial tableau for the linear programming model. [2 marks] (c) Based on the following final tableau, state the quantity of each type of fertiliser that should be produced per week in order to maximise the total profit, and calculate the total profit. 3 An electronics company manufactures LCD televisions of models P and Q. Each unit of model P requires 3.5 hours of production time, 1 hour of assembly time and 1 hour of packaging time. Each unit of model Q requires 8 hours of production time, 1.5 hours of assembly time and 1 hour of

packaging time. The maximum available resources for each process in a day is as follows: Process Resource available per day (hours) Production 280 Assembly 60 Packaging 50 The manager of the company wishes to maximise profit. Each unit of P yields a profit of RM400 while each unit of Q yields a profit of RM800. Due to high demand, the company has to produce at least 10 units of each model per day. (a) If x and y represent the quantities of models P and Q produced each day respectively, formulate the problem as a linear programming problem. [5 marks] (b) Plot a graph for the above problem, and shade the feasible region. [7 marks] (c) Using the graph that you have plotted in (b), i. determine the quantity of the daily production for each model which gives the maximum profit, [1 marks] ii.find the daily maximum profit.

4 . A factory assembles three models of chairs using six components. The following table shows the number of units of components needed for each model and the total units of components available per week. Component Number of units of components Total units of components Model P Model Q Model R available per week Type 1 seat 100 500 Type 2 seat 011 1000 Chair frame 111 1000 Chair leg 444 4000 Type 1 backres 111 1000 Type 2 backrest 0 0 1 500 The profits for models P, Q and R are RM35, RM40 and RM50 per unit respectively. The manager of the factory wishes to determine the number of chairs of each model to be produced per week in order to maximise the total pro_t. (a) If x1, x2, and x3 represent the numbers of chairs of models P, Q and R respectively, formulate a linear programming model to determine the number of chairs of each model that should be produced per week in order to maximise the total pro_t. [5 marks] (b) Construct the initial tableau for the linear programming problem. [4 marks] (c) Based on the _nal tableau given below, state the number of chairs of each model that should be produced per week in order to maximise the total pro_t, and calculate the maximum total pro_t. [4 marks] 5. A factory produces two types of batteries A and B. Every unit of battery A requires 2 hours of

assembly and 1 hour of testing, whereas every unit of battery B requires 2.5 hours of assembly and 1.5 hours of testing. The factory has at most 500 hours of assembly per week and at most 300 hours of testing per week. It is specified that the number of battery B produced per week exceeds the number of battery A produced per week and that the number of battery A produced per week exceeds 50 units. The profits for battery A and battery B are RM80 and RM90 per unit respectively. (a) Formulate the above problem as a linear programming problem to maximise the profit. [6
marks]

(b) Using the graphical method, determine the number of battery A and the number of battery B that should be produced per week and find the maximum profit per week. [10 marks]

6. A computer manufacturing company produces three types of computer: home desktop, business desktop and notebook. Each type of computer needs to pass through three processes: assembling, testing and packaging. The profits for a home desktop, a business desktop and a notebook are RM200, RM350 and RM450 respectively. The table below shows the number of hours required to produce a home desktop, a business desktop and a notebook and the number of man-hours available per week. Process Number of hours required Number of man-hours Home desktop Business desktop Notebook available per week Assembling 5 6 8 400 Testing 10 12 12 648 Packaging 2 4 2 60 (a) Formulate the problem as a linear programming problem. [4 marks] (b) Using the simplex method, _nd the number of each type of computer to be produced to maximise the weekly pro_t and _nd this maximum pro_t.

7. A company produces two types of lamps, A and B, which are made of three types of materials: iron frame, electrical component and plastic component. Each lamp A requires 1 unit of iron frame, 2 units of electrical components and 3 units of plastic components, whereas each lamp B requires 3 units of iron frames, 2 units of electrical components and 1 unit of plastic component. The company has 300 000 units of iron frames, 300 000 units of electrical components and 400 000 units of plastic components in stock. The profits made from each lamp A and lamp B are RM15.00 and RM20.00 respectively.

(a) Formulate a linear programming problem to maximise profit within the constraints.
marks]

[4

(b) Using the graphical method, determine the number of lamp A and the number of lamp B which give the maximum profit and find this maximum profit.

8 A chocolate manufacturer produces two types of chocolate bars of orange and strawberry avours. It costs RM0.22 to produce a 10 g orange-flavoured chocolate bar which is sold at RM0.35, whereas it costs RM0.40 to produce a 15 g strawberry-flavoured chocolate bar which is sold at RM0.55. The manufacturer has 426 kg of chocolate in stock. A minimum of 10 000 orange-avoured chocolate bars and 12 000 strawberry-avoured chocolate bars have to be produced. The number of strawberryavoured chocolate bars produced has to be more than that of orange-avoured chocolate bars. (a) Formulate a linear programming model that can be used to determine the number of chocolate bars of each avour that should be produced in order to maximise total profit. [6 marks] (b) Show the feasible region and hence solve the linear programming problem using the graphical method. [9 marks] 9. A manufacturer of wooden furniture produces two types of furniture: chairs and tables. Two machines are used in the production: a jigsaw and a lathe. Each chair requires 1 hour on the jigsaw and 1 hour on the lathe, whereas each table requires 1 hour on the jigsaw and 2 hours on the lathe. The jigsaw and lathe can operate 10 hours and 12 hours per day respectively. The profit made is RM27.00 on a chair and RM48.00 on a table. The daily profit is to be maximised. (a) Formulate the problem as a linear programming problem. [4 marks] (b) Using the simplex method, find the maximum daily profit and the numbers of chairs and tables made which give this profit. [9

10. A factory produces two types of products, A and B. Each unit of product A requires 2 labour hours and 1 machine hour, whereas each unit of product B requires 2 labour hours and 4 machine hours. There are not more than 120 labour hours and not more than 96 machine hours available in the factory each day. The factory also decided that the number of units of product B produced each day should not be more than 60% of the total daily production of both products A and B. The pro_t for each unit of A is RM120 and each unit of B is RM200. The factory intends to maximize the total

profit each day. Formulate the problem as a linear programming problem. [6 marks] By using graphical method, determine the number of units of product A and product B that should be produced daily in order to maximize the total profit, and find the maximum total daily profit.
[9 marks]