function satisfying the various ..... 3.2. FOMULATION OF A LINEAR PROGRAMMING PROBLEM Ilustrated through what is ulation of a linear programming problem can be ii noon at a product mix problem. Typically, it occurs in a manufacturing industry where itis possible to manufacture a variety of products. Each of the products hat certain margin of profit per sinit. These products use a common pool of res ‘ whose availability is limited. The linear programming technique identifies the combination of the products wich will maximise the profit without violating the resource contraints. The formulation is illustrated with the help of following example. Example 1 Suppose an organisation is manufacturing two products P,and Ps. The profit per tonne of the two products are Rs. 50 and Rs. 60 respectively. Both the products require processing in three types of machine. The following Table indicates the available machine hours per week and the time required on each machine for one tonne of P; and P2. Formulate this product mix problem in the linear programming ~— form. Table Showing the available machine capacities and machine hour requirement of the two products Profitionne Product Product 2 Total available - Rs. 60 Machine hours/weeks Machine 1 1 300 Machine 2 3 4 Machine 3 7 “ 812 Solution Processing in machine 1 while the Corresponding requirement o} Py r i : 7 4 sc f P2 is one hour the St + 4x, < 509 4x, + Ixy = 812 In addition there cannot be algebraically as © any negative Production whi which may be Stated 20 er Thus, the decision y, th ive ‘on and the constra; Nts Of the pro di , S100 variables, the objecti " : es, the objective functi rx Problem have been identified. The problem can now be gi ae ; ified. Th al be stat ed s in theyt sam Bey bday © 500 any + Tn) © NN oy eo This procedure is alse commonly: refes his proces r wily referred ty as the lation of the problem Activity 2 Himalayan Orchants have canned apple and bottled Ite products with prof margin Ry 2 and Rs. L respectively per wn The folhom adscites ie fabour, equipment and material to produce exch pric? per Hated Juice Canned Apple Total Labour (man hours) 40 0 1 Equipment (machine hours) 10 4 9 Material (unit) Lo ' 19 Formulate the linear progeansming problem 5 1 mix which maximise profit without exceciiiny the va Activity 3 A television manufacturer must decide how many black-and-white and how many olour sets he should produce for each day's sate so as to maximize hus datly prot Each day he has available the following supplies: TV Chasis Production hours 160 Colour Tubes 10 A-and-white set requires 5 production hours and yields « Fach Lach colour set requires 10 production hours and yields 2 profit ot Rs. the manufacturer's problem as a near programming prodlein “3,3. FORMULATION WITH DIFFERENT TYPES OF ‘The formulation of « linear programming problem when the constraints have emerged due to resource limitation has been illustrated in the previous section, ‘These constraints are of or equal to" type. However, there may be constraints of other types as well. The formulation of linear programming problems with different types of constraints is illustrated in the following examples Example 2 Three nutrient components namely, thiamine, phosphorus and iron are found in aad Praprnanag ss Tier rograian sh ‘netics “jjorams per ounce jent (in milligr® diet of 10 food items A and B. The amount of each nutrient ( jet of 170 food jtems - ie, myfory is given below + : A 0.10 mg/oz ‘Shiamine 0.15 mgsoz ooage Phosphorus 0.75 mgoz cagel Iron 1.0 mgfoz / a oz. respective Be oom ‘of thiamine, 7- i é ‘The cast of food A and B are Rs. 2 per a7. an seast a the linear programming minimum daily requirements of these nutrients are at yg of phosphorus and 10.0 mg of iron, Write the prot form. : : Solution Let us define by, and x2 the number of units (ounces) of inimise the total purchased everyday. Since the purpose is to minimise ? ne sd to satisty the minimum daily requirement of nutrient the linear P problem is given by Mani Subject to, 015K + 0.10%, 2 1.0 075k + 1.70%, > 7.5 1.30%, + 1.10%, > 10.0 my 29, 1 20. ly ‘A and B respective! J cost of the food items yeramming lise 2x + 1.Tieg snple 3 An oil refinery can blend three grades of crude oil to produce quality R and quality. S petrol, To possible blending processes are available. For each préduction'run the older provess uses 5 units of crude A, 7 units of crude B and 2 units of crude C to produce 9 units of R and 7 units of S. The newer process uses 3 units of crude A, 9 units of crude Band 4 units of crude C to produce 5 units of R and 9 units of S petrol. Because of prior contract commitments the refinery must produce at least $00 units of Hand at least 2hV-units of S for the next month. It has available 1500 units of crude A, 1A) units of crude B and 1000 units of crude C. For each unit of R the rehincry receives Rs. 0 wile for each unit of Sit receives RS, 90, Find out the linear progratnming formulation of the problem so as to maximise the revenue. \ Solution ‘the decision variables in this case ure \ x; = no. of production runs of the older process. %, = no, of production runs of the newer process, Fractional runs are permissible in blending processes. ‘Then from the giv iti the problem can be formulated as € given conditions Maximive Ix, + 5x5) + 97x, + xs) = 170K, + 110%, Subject to: ’ 9; + Sq = 500 (commitment on R) Tay + 9x2 = 300 (commitment on $) Shy + 3 < Ths + Sz = 190 (availability of B) 2a + 4x2 < 1000 (availability of C) wy 20 fn the example 2 of this section the linear progr 2 , ramming probe Miao 0 exual to” type constrains, fn the example 3 ike ash fae only “sreater € as both “greater