Q1: a company engaged in producing tinned food has 300 trained employee on the rolls each of whon can produce

one can of food in a week. Due to the developing taste of public fo0r this kind of food, the company plans to add the existing labor force by employing 1 0 people in phased manner, over the next five weeks. !he newcomers have to undergo as two week training programme before being put to work. !he training is to be given by employee from the existing ones and it is known that one employee can train three trainees. "ssume that there would be no production from the trainers and the trainees during training period as the training is off the #ob. \$owever the trainee would be remunerated at the rate of 300 per week, the same rate as for the trainers. !he company has booked the following numbers of cans to supply during the next five weeks: %eeks : )o. of cans &1 &'*0 ' '+* 3 30 ( 3,0 (00

"ssume that the production in any week would not be more than the numbers of cans ordered for so that every delivery of food would be -fresh.. /ormulate a 01 model to develop a training schedule that minimise the labor cost over the five period. 01 model formulation: !he data of the problem is summerised as given below: 213 2'3 233 2(3 2 3 2,3 2:3 4ans supplied weeks : )umber: 1 '*0 ' '+* 3 30 ( 3,0 (00

5ach trainee has to undergo a two week training. 6ne employee is re7uired to to train three trainee. 5very trained worker producing one can8week but no production from trainers and trainees during training. )umbers of employee to be employed91 0 !he production in any week not to exceed the cans re7uired. )umbers of weeks for which newcomers would be employeed: , (, 3, ', 1

/rom the given information you may be observe the following facts: 213 2'3 233 workers employed in the beginning of the first week would get salary for all the five weeks those employed at the second week would get salary for ( week and so on. !he value of the ob#ective the function would be obtained by multiplying it by 300 because each person would get a salary of 300 per week. ;ne7ualities have been used in constraints because some workers might remain idle in some week2s3. respectively.

Decision variables: let x1, x', x3, x(, x 9 number of trainees in the beginning of week 1,',3,(, and !he 01 model <inimi=e total labor force =9 x1>(x'>3x3>'x(>x ?ub#ect to the constraints 2a3 capacity constraints 300@x183 A9 '*0 300@x183@x'83A9'+* 300>x1@x'83@x383A930 300>x1>x'>@x383@x(83A93,0 300>x1>x'>x3>@x(83@x 83A9(00 new recruitment constraints x1> x'> x3> x(> x 91 0 and

2b3

x1, x', x3, x(, x A90 Q.2: " company has two grades of inspectors 1 and ' who are to be assigned for a 7uality control inspection. ;t is re7uired at least '000 pieces to be inspected per *@hour day. " grade one inspector can check pieces at the rate of (0 per hour, with an accuracy of +:B. " grade ' inspector checks at the rate of 30 pieces per hour with an acuracy of + B. !he wage rate of grade 1 inspector is per hour while that of grade ' inspector is Cs ( per hour. "n error made by an inspector cost Cs 3 to the company. !here are only + grade 1 inspector and 11 grade ' inspector available in the company. !he company wishes to assign work to the available inspectors so as to minimi=ed the total cost of the inspection. /ormulate this problem as a linear programming module. 01 model formulation: the data of the problem is summerised as follows:

;nspectors Drade 1 )umber of inspectors Cate of checking ;naccracy in checking 4ost of inacuracy in checking %age rate8hour !otal pieces which must be inspected9'000 + (0 pieces8hour 1@0.+:90.03 Cs. 38piece Cs grade ' 11 30 pieces8hour 1@0.+ 90.0 Cs. 38piece Cs.

Decision variables: let x1, x'9 number of grade 1 and grade ' inspectors to be assigned for inspection, respectively. !he 01 model \$ourly cost of each of grade 1 and ' inspectors can be computed as follows: /or inspector grade 1:Cs 2 >3E(0E0.0339Cs. *.,0 /or inspector grade ':Cs.2(>3E30E0.0 39Cs. *. 0 Fased on the given data the linear programming problem can be formulated as follows: <inimi=e 2 daily inspection cost3 =9 *2*.,0x1 > *. 0x'3 9 ,*.*0x1>,*.00x' ?ub#ect to the constraints 2a3 2b3 !otal number of pieces that must be inspected in an * hour day constraints (0 E *x1 > 30 E *x' A9 '000 )umbers if inspector of grade 1 and grade ' avaivlable constraints x19G +H x'9G 11 x1, x' A90 Q.3: " manufacturing company engaged in producing three types of products: ", F and 4. the production department daily produces component sufficient to make 0 units of ", ' units of F and 30 units of 4. !he management is confronted with with problem of optimi=ing the daily production of products in assembly department where only 100 man@hours are available daily to assemble the products. !he following additional information is available. !ype of product profit contribution per unit of product 2Cs.3 "ssembly time per product 2hrs3 " F 1' '0 0.* 1.:

F and 4 to be produced respectively !he 01 model <aximi=e 2total profit3 J 9 1'x1 > '0x' > ( x3 ?ub#ect to the constraints 2a3 labor and material constraints 0. hrs87uintal 1. x39 7uantity of product " 2in 000 gallons3 to be produced in plant 1 and ' respectively . in plant '. %hereas these cost are Cs 1*000 and Cs '.*x1>1.x'. !\$5 46<1")I \$"? a daily order commitment for '0 units of product " and total of 1 units of F and 4 products. hours a day. Decision variables: let E1.000 gallons * 7uintal plant 1: 1 000 '. 10. .* '0 1' product type F 4 ' 1.: 1 '0 30 '.4 ( '.x3A90 Q. 1 000 to prepare and 1"4K 1000 gallons of " and Cs. /ormulate this problem as an 01 model to find out as to how the company should organi=e its production so that re7uired amounts of the two products be obtained at a minimum cost. 7uintal of F. '*000 to prepare abd pack a 7uintal of F. it takes ' hour to produce and pac# 1000 gallons of " and 1.4: " company has two plants each of which produces and supply and supplies two products: " and F. 01 model formulation : the data of the problem as summari=ed as follows: Cesources8 4onstarints " product F total availibility 2hours3 1reparation times 2hrs3 1lant ': 'hrs81000 gallons <inimum daily production 4ost production 1lant ': 1*000 plant 1: 3 hrs81000 gallons 1. hours to prepare and pack a 7uintal of F. x39numbers of units of products ".000 respectively in plant '. !he plant can each work upto 1.8unit3 " 0 0. /ormulates this problem as an 01 model so as to maximi=e the total profit. in plant 1 it cost Cs.n plant 1.000 '*000 1hrs81 7uintal 1. !he company is obliged to produce daily at least 10000 gallons of milk and * 7uintal of F. x'.:x'>'. ( total 100 Decision variables: let x1. x3 9G100 x1 9G 0 x' 9G' x39G30 2b3 order commitment constraints x1 A9'0 x' >x3 A91 x1. it takes three hours to produce and pack 1000 gallon of " and and 1 hour tp prepare and pack . 01 model formulation: the data of the problem is summarised as follows: Cesources 8 4onstraints 1roduction capacity 2units3 <an hours per unit 6rder commitment unit 1rofit contribution 2Cs.

000x( ?ub#ecte to the constraints 2i3 1reparation time constarints 3x1>x'9G1. 01 model formulation Cesources8 constraints Fudget 2Cs3 <achine time "ssembly time ?elling price 4ost price c1 108units 3 \$rs8unit ' hrs8unit Cs 30 Cs 10 !he data of the problem is summari=ed as follows: components c' (08units ' hrs8unit 3 hrs8unit Cs :0 Cs (0 total availibility Cs (000 '000 hrs 1(00 hours Decision variable: let E1. .E'.x( 9 7uantity of product F 2in 7uintal3 to be produced in plant 1 and ' respectively 01 model <inimi=e 2total cost3 J9 1 000x1>'*000x'>1*000x3>'. x'A9 0 Q. minimum daily production re7uirment constaints x1>x39A10 x'>x(9A* x1. ?econd the company has available in each period '000 hours of machine time and 1(00 hours of assembly time. 2'3 . 5ach units of 41 cost the company Cs in material. x(9G1.t purchases casting of the parts from a local foundary and then finishes the part of drilling and shaping and polishing machine.s labor and material expenses must be paid in cash.s production capacity is however is limited by two considerations. while each of 4' cost the company Cs ' in wages and Cs 1 in material.x(A9 0 2ii3 and Q.x'. !he production of c1 re7uires 3 hours of machine time and ' hoyrs of assembly time whereas the production of c' each c' re7uires ' hours of machine time and 3 hours of assembly time. (000 2cash plus bank credit plus collection from past credit sales3.5: "n electronic company is engaged in the production of two component c1 and c' used in radio sets. !he company. x'9 number of units component 41 and 4' to be produced respectively !he 01 model <aximi=e 2 total profit3 J9 ?elling price@ cost price 9230@103x1 > 2:0@(03x' 9'0x1>30x' sub#ect to constraints 213 the total budget available constraints 10x1> (0x'9G(000 1roduction time constarints 3x1>'x'9G '000 'x1>3x'9G1(00 x1.x3. Fecause of the string monopoly of the company for these components it is assumed that the company can sell at the prevaling prices as many units as it produces. /irst at the beginning of period 1 the company has initial balance of Cs.6: " company produces 3 types of parts for automatic washing machine. !he selling price of 41 is Cs 30 per units and of 4' is Cs :0 per units. 'x3>1. /ormulate this problem as a 0p model so as to maximi=e the total profit of the company. !he company sells both product on period credit terms but the company.

. shaping and polishing.s run. x'. . F and 4 parts to be produced per hour respectively profit must allow not only for the cost of the casting but for the cast od drilling . ?ince ' types " parts per hour can be run on drilling machine at a cost of Cs '0. F and 4 cost Cs. x3 A90 .x3 number of type ". "ll parts made can be sold.' profit for type F part 2 10@. then Cs '08' 9 0. !he capacity 2 part per hour 3 for each part on each machine are shown in the following table: <achine Drilling ?haping 1olishing capacity per hour 1art " ' ' (0 1art F (0 '0 30 1art 4 ' '0 (0 !he management of the shop wants to know how many parts of each type it should produce per hour in order to maximi=e profit for an hour. /ormulate this problem as an 01 model. 3@ 2 308(0>308'0>30830391 1rofit of type 4 part 2 1(@10 3 @ 2 '08' >308'0>308(0390. !hus the drilling machine constraints is E18' >x'8(0 >x38' 9G1 ?imilarly other constraints can bwe established !he 01 model <aximi=e 2 !otal 1rofit 3 J9 0.x'. Cs 30 for shaping and Cs 30 for polishing.*0 is the drilling cost per type " part. 01 model formulation : Decision variables 0et x1. F and 4 respectively are Cs *.1 2 x18' >x'8'0>x38'09G1 2 x18(0>x'8'0>x38(039G0 x1.+ x3> ?ub#ect to constraints 2i3 Drilling machine constraints 2ii3 2iii3 and ?haping machine constraints 1olishing machine constraints 2 x18' >x'8(08x38' 39. and * respectively.!he selling price of part ".00x'>0. Cs 10 "nd Cs a(. !he shop posses only one of each type machine. 4ost per hoyr to run each of the machine are Cs '0 for drilling. 4asting for the parts ". ?imilar reasoning for the shaping and polishing gives profit per type " part9 2 *@ 3@2 '08' >308' >308(0390.' x1>1. a type F part consume 18(0th and a type 4 part consume a8' of an hour.+ 6n the drilling machine one type " part consume 18' th part of available hour .

130 units of model for F and and units of model for unit 4. during the forthcoming week the company has available 130 hours of manufacturing and 1:0 hours of assembling and ' hours of packaging time formulate this problem of production scheduling as an 01 model so as to maximi=e profit.0 respectively. ( and ' and for a do=en units for model 4 are .. ?ome of this by product can be sold at a unit price Cs. ( ' (0 4 .7: " tape recorder campany manufacturer models " ..8: . a do=en units of model " re7uires ( hours for manufacturing. x'81'>. x'. and ( hours and hours per unit for F on operation one and two respectively. 01 model formulation0 the data of the problem is summarised as follows: Cesource 8 4onstraints production re7uirement 2units3 manufacturing time per do=en "ssembling time 2 per do=en3 1ackaging time 2per do=en3 4ontribution per unit 2Cs3 model " ' ( 3 1 1 !otal availability 2hrs3 F 130 '. Fecause the product 4 results from producing F. the remainder has to be destroyed and the destruction cost is Cs 1 per unit. !he product " can be sold at the profit of Cs. !he 01 model <aximi=e 2total profit 3 J9 1 x1>(0x'>.n a chemical industry two product " and F are made involving two operation.no time is . !he manufacturing time are 3 hours per unit for " on operation one and two respectively.x3 A9 0 2ii3 2iii3 2iv3 "nd Q. 3 hours for assembling and 1 hours for packing.x381'9G130 "ssembling time constraints 3x181'>(x'81'>+x381' 9G1:0 1ackaging time constraints E181'>'x'81'>(x381'9G ' x1. !he weekly minimum production re7uirement are ' units for model ". + and ( . !he production of F result is also in a by@product 4 at no extra cost. /orecast show that upto unit of 4 can be sold.Q. 3 per unit and F at a profit of Cs.x39 units of model ". for assembling and for packing. each type of recorder re7uires a certain amountr of time for the manufacturing of component parts. * per unit. . !he corresponding figure for a do=en units of model F are '. Cs (0 and Cs . + ( . F and 4 which have profit contribution per unit of Cs. 1 . !he company get 3 units ofd 4 for each units of F produced.0x3 ?ub#ect to constraints 2i3 <inimum production re7uirment constraints E1 A9' E' A9130 E3 A9 <anufacturing time constraints 2(x181' >'. '. specifically. F and 4 produced per week respectively.x'.0 130 1:0 ' Decision variables let x1.

x39 unit of product ".08minutes 1 1 @ 0. ounce bottles. 4 to be produced respectively E(9 units of product 4 destroyed !he 0p model <aximi=e 2total profit 3 J9 3x1>*x'>'x3@x( ?ub#ect to the constraint 2i3 for two products " and F 3x1>(x'9G1* 3x1> x'9G'1 for by@product 4 @3x'>x3>x( x1.09'(00 minutes 300.000 ounce and the market can absorb ' .9: 4onsider the following problem faced by a production planner in a soft drink plant. !he planner wishes to maximi=e his profit sub#ect. F.x( x39G 90 A90 2ii3 Q. /ormulate this problem as an 01 model in order to maximi=e total profit. \$owever each can be used on both types with some loss of efficiency. 01 model formulation: the data of the problem is summarised in the following table: Constraints <achine " time <achine F time 1roduction <arketing profit8units 2Cs.000 units8week ' 000 units8week :000 units8week :000 units8week .000 * ounce bottles and :.x'. 1rofit on an *ounce bottle is 1 paise and on an 1. of course to all the production and marketing restriction. ounce bottles (08minutes : 8minutes !he machine can be run * hour per day. \$e has two bottling machine " and F. /ormulate an 01 model in order to determine the 7uality of " and F which should be produced keeping 4 in mind to take the highest profit 01 model formulation : the data of the problem is summeri=ed as follows: !ime 2 hrs re7uired by 4onstraints " 6peration one 3 6peration two 3 Fy product of F @ 1rofits per unit 2Cs3 3 F ( 1 * 4 @ @ 3 ' availibility 1*hrs '1hrs units Decision variables: let E1. !he manufacturing dat ais as follows: machine " F * ounce bottles 1008minutes .x'.00. the available times are 1* hours and '1 hours of operation one and two respectively.000 1. %eekly production of the drink can not be exceed 3.3 Production 8 ounce bottles 16 ounce bottles 1008minute .08minutes 1.x3. " is designed for * ounce bottles and F for 1.' availability *E E. ounce bottles per week. days per week.1 (08minute : minutes 1 @ 1 0. ounce bottle is ' paise.used in producing 4.09'(00 minutes *E E.

3 )umber of component units of final product constraints .3 x1>*x'>:x3 9G'00 2 raw material .' x' ?ub#ect to constraints 2i3 2ii3 2iii3 machine time constraints x18100>x'9G8'(00 H x18..x'A90 Q.00. 1 : ' ( * 3 ' : output per run 2units3 component component " F . 0p model formulation: 0et E1.1": " complete unit od certain product consist of four units of component " and three units of component F. '. 3 respectively ?ince each unit of the final product re7uires ( units of component " and 3 units of component F.x1> x'>:x38( and (x1>*x'>3x383L also if y is the number component units of final product. ( * : 3 formulate this problem as linear programming model so as to determine the number of productions for each department which will maximi=e the total number of complete units of the final product.x39 number of production run for department 1.x'.x1> x'>:x3@(yA90 (x1>*x'>3x3@(yA90 2ii3 .000 marketing constarints and x19G ' .x'>3x38(N ?ub#ect to the constraint 2i3 raw material constraints :x1>(x'>'x3 9G100 2raw material . !hree department are engaged in the production process with each department using a different method of manufacturing the component per production run and the recoulting units are given below: Department input per run 2units3 Caw material raw material . we have .x1> x'>:x38(A9y and (x1>. ounce bottles to be produced weekly the P !odel <aximi=e 2 total profit 3 J9 0.x1> x'>:x38(H (x1>. therefore maximum number of units of the final product cannot exceed the smaller value of &total number of units of " products8( H total number of value F83L or &.x'>3x38(A9y the 01 model <aximi=e J9 <in M ..000 x1. .0>x'8: 9G'(00 production constarints x1>x' 9G 3.1 x1>0.decision variables: 0et x19 units of * ounce bottles to be produced weekly x'9 units of 1. the two component 2 " and F 3 are manufactured from two different raw materials of which 100 units and '00 units respectively available. then obviously.000 x'9G:.

x'.cc9 number of kg of cc in " xa.cc9 number of kg of cc in b xb.w9 number of kg of % in b /or gift pack 4 xcoc9 number of kg of 64 in 4 xc. 01 model formulation: /or gift pack " xaoc9 number of kg of 64 in " xa.w9 number of kg of % in 4 /or gift pack d Decision variable 0et .3 /ormulate an 01 model to find the production scvhedule which maximi=e the profit assuming that there are no market restrictions.cc9 number of kg of cc in 4 xc. chocolate cream 2443 and wafers 2%3.11: " manufacturer of biscuit is considering four type of gifts pack containing three types of biscuits.x3 A90 Q.w9 number of kg of % in " /or gift pack F xboc9 number of kg of 64 in b xb. a market research study conducted recently to asses the preference of the consumer shows the following types of asortments to be in good demand: "ssortment " contents not less than (0B of 64 )ot more than '0B of 44 "ny 7uantity of % not less than '0B of 64 )ot more than (0B of 44 "ny 7uantity of % )ot less than 0B of 64 )ot more than 10B of 44 "ny 7uantity of % )o restriction selling price 1er kg 2Cs3 '0 F 4 ' '' D 1' /or the biscuit the manufacturing cost and capacity are given below: !ype of biscuit 64 44 % '00 '00 1 0 plant capacity * + : manufacturing cost 2Cs8Kg. 6rrange cream 2643.and x1.

(02xc.cc>xb.cc>xb.w3 Ea.00 .w>xb.ocA90. !he particulars of sales forecasts and estimated contribution to overheads and profit are given below Penus <aximum possible sales 1er month 2kilometeres3 4ontribution 2Cs.cc>xc.00 1'.cc>xd.oc>xc.00 tonnes 100 machine shifts *0shifts !here are no limitations on the other resources.'02xa.w9 number of kg of % in D !he 01 model <aximi=e 2total profit3 J9'02xa.ocA90.oc9G'00 xa.oc>xd.cc>xb.w3 /or gift pack F Eb.oc>xb.w3 > ''2xc.w3 O*2xa.(02xa.w>xd.cc>xd.w3 Eb.8litre3 <illing kilolitres8 machine shift 1acking kilolitres8shift Penus 0.oc>xc.oc3@ +2xa.'02xb.cc9G0.00 '000 Due to commitment already made a minimum of '00 kilolitres per month of "urora has to be necessarily supplied next year.cc>xc.cc>xa.w>xb.xdoc9 number of kg of 64 in D xd.00 Drade Dianna 0.00 1'.cc9G0.w>xd. an offer was received from the nearby competitor for hiring (0 machines shift per month of milling capacity for grinding diana paint.w>xc.8 kilometres 3 100 (000 Dianna "urora (00 3 00 .w3 > 1'2xd.cc>xd.cc9G0.cc>xc.oc>xd.oc>xb.oc>xd.w3 Q.oc>xb.oc>xa.00 "vailibility 2 capacity8month3 "urora 0. Qust as the company was able to to finalise the monthly production programme for the next 1' month.cc>xa. /ormuluate this problem as an 01 model for determining the monthly production programme to maximi=e contribution.w /or gifts pack 4 EcocA90.: .oc>xb.cc9 number of kg of cc in D xd.cc>xb.cc>xa. !he plant operates on a three shift basis and the following data are available from the production recordes: Ce7uirment 6f resources ?pecial additive 2kg.w3>' 2xb.w9G1 0 specification constraints /or the gift pack " Ea.oc>xa.w3 Ec.oc>xc. 01 model formulation: Decision variable let E197uantity of venus 2kilolitres3 produced in the company E'97uantity of Dianna 2kilolitres3 produced in the company E397uantity of Dianna 2kilolitres3 produced in the company E(9 7uantity of "urora 2kilolitres3 produced in the company . that could be spared for at least a year.oc>xc.'02xc.1 3. \$owever due to the additional handling the profit margin of the competitor involved by using this facility the contribution from the dianna will get reduced by Cs.30 '. Dianna and "urora.oc>xb.00 1'.(02xb.cc>xb.w3 ?ub#ect to the constrains 2a3 plant capacity constraints constraints xa.12: "bc company manufacturer three grade of paints : Penus.cc9G'00 xa.cc3@:2xa.oc>xa.w>xc.oc>xc. 1 per litre.cc>xc.cc>xc.

!he 0p model <aximi=e 2total profit3 J9 (000x1>3 00x' >23 00@10003x3>'000x( ?ub#ect to constrains 2a3 special additive constraint 0.1 x'>0.4\$ !\$5 1C6DR4! 46R0D F5 1rocessed.00 1* .x(A90 and Q.0 total '000 1 100 100 *0 3000 product ' 00 :.91.00 2"urora3 x1.00 2b3 6wn milling facility constraints E18'>x'83>x(8 9G100 2c3 2iv3 2d3 \$ired milling facility constraints E383 9G(0 packing constraints x181'>2x'>x3381'>x(81'9G*0 <arketing constraints E19G1000 2venus3 E'>x39G2dianna3 '009Gx(9G.13: /our products has to be processed through the plants. 1roduction 0ines 2days3 1 1 0 ' '00 3 1.!? !\$5C5 "C5 !\$C55 1C6DR4!.)5? 6) %\$.33 !he 01 model <inimi=e 2total cost 3 J Z = . !he cost of the using lines is Cs . 2.6) 0. 0p model formulation: Describe variable 0et Ei#9number of units of product .1 x3>0.( 3 produced on production line # 2#91.x3. the 7uantities re7uired for the next production period being: 1roduct1 '000 unitsH product 3 3000 units 1roduct ' 3000 unitsH product ( .000 R).3.00.000 line formulate this problem as an 01 model to minimi=e the cost of operation.'.: x(9G. !he rates of the production in units per day and the total available capacity in days are given below.30x1> 0.0 *+0 3000 maximum 3 ( (00 '0 (00 '0 .'.00∑ xi1 + 00∑ xi ' + (00∑ xi3 i =1 i =1 i =1 ( ( ( ?ub#ect to the following constrain 2i3 1roduction constrain 2b3 3 j3 =1 j =1 0ine capacity constrain 3 j= 31 ∑ x1 j = '000H ∑ x' j = 3000 ∑ x3 j = '000H ∑ x ( j = 3000 j =1 0ine capacity constrain s . Cs 00 and Cs (00 per day respectively.x'.

ts production cost is 1 ..000 for a part produced in regular time and ' . of parts to be shipped 3000 (000 000 000 !he company can manufacture 3000 parts of engimes per month on a regular time basis and '000 parts per month on overtime basis.3.14: EIJ company produces an automobile spare part. its monthly inventory holding cost is 00. k 93000 9(000 9 000 9 000 "nd . and # Q.(3 !he 01 model <inimi=ed total cost J9 regular time production basis > overtime production cost > one month inventory cost > two month inventory cost > three month inventory cost & 1 0002 x111> x11'> x113> x11(> x'1'> x'13> x'1(> x313> x31(> x(1(3L > & ' 000 2 x1'1> x1''>x1'3>x1'(>x'''>x''3>x''(>x3'3>x3'(>x('(3L > & 002x11'>x1''>x'13>x''3>x31(>x3'(3L > & 10002x113>x1'3>x'1(>x''(3L > 1 002x11(>x1'(3L ?ub#ect to the constrain ts 2a3 monthly regular timwe production constraints x111>x11'>x113>x11( 9G3000 x'1'>x'13>x'1( 9G3000 x313>x31( 9G3000 x(1( 9G3000 2b3 monthly overtime production constrains x1'1>x1''>x1'3>x1'( 9G'000 x'''>x''3>x''( 9G'000 x3'3>x3'( 9G'000 x('( 9G'000 2c3 <onthly demand constraints E111>x1'1 E11'>x1''>x'1'>x''' E113>x1'3>x'13>x''3>x313>x3'3 E11(>x1'(>x'1(>x''(>x313>x3'(>x(1(>x('( Ei#kA90 for all . '.x11 x '1 x31 x (1 + + + ≤ '0 1 0 '00 00 (00 x1' x '' x3' x (' + + + ≤ '0 '00 100 :.'3 and shipped in month k 2k91. /ormulate this problen as an 01 model to minimi=e the overall cost.'.0 *0 *+0 .0 (00 x13 x '3 x33 x (3 + + + ≤ 1* 1. . 2. #.00 "nd Ei# A9 0 for all . !he contract that it has signed with a large truck manufacturer calls for the following ( month shipping schedule <onth Qanuary /ebruary <arch "pril )o. 01 model formulation: Decision variable 0wt Ei#k9 )o. of units of automobiles spare part manufactured in month .9 1.000 for a part produced in overtime . 3. ( 3 using shift # 2 #9 1.

000x1 > '0.00.000x'>(.000x' > 1 . 4.radio.00.00 formulate this problem an 01 model to determine the number of each type of advertisement to purchase respectively 01 model formulation: Decision variable 0et E1.0003x' >23. newpaper and maga=ine afdvertisement to purchase respectively !he 01 model <aximi=e 2total nomber of exposure of both groups3 J 9 2'. !he company has allocated capital expenditure budget e7ual to Cs .00.N 3'0x1> +(x'>'03x3>3(0x(>(:(x 9G. D and respectively !he 01 model <aximi=e 2net returns 3 J9 '(0x1> 3+0x' > *0x3> 1 0x( > 1*'x ?ub#ect to the constraints 2a3 capital expenditure budget constraints 1'0x1> 0x'>11*x3>' 0x(>3'(x 9G 1 Mfor year 1++.x'. and x 9 proportion of investment in the pro#ect ". 0.. and 3'0 in 1++:3 is invested then th resulting net returns in it would be '0B 2 of '(03.00>1.000x3>'. F.0003x( 9 . x3..000>3. 01 model formulation: decision variable l0et E1.0 @0.0B of all the advertisement in news paper and maga=ine there must be at least 30.18: an enginnering comapany is planning to diversify its operation during the year 1++.000 exposure to the families with income over 0. x(.00.@+:.x(3L9G0. '0B 2of 1'0 in 1++.n -000 Cs. .00.000x( 9G .000x( ?ub#ect to the constraints 2a3 2ii3 2b3 or 2c3 "nd "vailable budget constraint (0..x'.00.000x3 > . Iear 1++* year 1+++ " '(0 1'0 3'0 F 3+0 0 +( 4 *0 11* '0' D 1 0 ' 0 3(0 5 1*' 3'( (:( "ssume that the returns from a particular pro#ect would be in direct proportion to the investment in it.00. if in a pro#ect say ".00. x'.000 <aximum !v advertisement constraints x19G( maximum newspaper and maga=ien constarints &2x3>x(382x1..00.000>1.(x3>0.x'. !he estimated net returns at present value and expected cash expenditure of each pro#ect in the two year are as follows: 1ro#ect estimated net returns cash expenditure 2 in -000 Cs.0003x1 > 2 . 0.0003x3>21. so that for example.x3 and x( 9 no.000 exposure to the families with income under Cs. 0 Mfor year 1++:N 2b3 0@1 integar re7uirment constarints.x3. and Cs. !h ecompany has five investment pro#ects under consideration. 0 crore in the year 1++:.000x1>1'.3 .000>:.00. of !P . .x1@0.(x(9G0 <aximum maga=ine advertisement constarints E(9G( 2because maga=ine wil appear only four times in th next month3 x1. !his assumtion also implies that individuality of the pro#ect should be ignored.1 crore in th year 1++.00.000 there must be at least ( . 0.. /ormulate the capital budgeting as an 01 model to maximi=e the net returns.00.x'>0.x3 and x( A9 0 %inance Q.00.2a3 2b3 2c3 2d3 no more than ( !v advertisement no more than .

x: A90 T.>0x:9G0.>x:91 and x1. '0 timing of return possible 1 years later ' years later 3 years later immediate reinvetment yes yes yes .x(>10x > x.. the company has developed the investment alternative for 10 year period as a given in the following table. 2ii3 the average risk for the portofolio should not exceed 2iii3 the average growth potential for the portofolio should be at least 10B 2iv3 at least 10B of all available funds must be retained in the form of cash at all times.'0x(>0.19: EIJ is an invetment company .x'.10x3>0. 0 1 ( * .x.1 x >0. /ormulate this problem as an 0p model so as to maximi=e the return 01 model formulation: decision variable 0et E#9 proportion of funds to be invested in the #th investment alternative 2#91.0:x.x(.nvestment alternative " F 4 D 5 / 4"?\$ ( : * .00x: ?ub#ect to the constraints 2i3 length of investment constraints (x1>:x'>*x3>.3'x(>0. 10 3 0 length of investment 3 1' + '0 1 . !he risk coefficient and growth potential are sub#ective estimates made by the portofoilio manager of the company.x.0+x3>0.03x1> 0. !he return on investment is expressed as an annual rate of return on the invested capital.x .>0x:9G 2iii3 growth potential constraints 0=1>0.00.x >3x.000 unlimited 0. !huis guidelines for selecting the portofolio are: 2i3 the averager length of the investment for the portofolio should not exceed : years.000 1+ 1.x A90 Q.00.10 2v3 proportion of funds constraints 2vi3 x1>x'>x3>x(>x >x.x3. 3 0 annual rate3 Cisk coeeficient grwoth potential of return 2year 3 returns 2B3 0 1* 10 3' '0 : 0 !he ob#ective of the company is to maximi=e the return on its investment.1*x'>0.>0x:9G: 2ii3 Cisk level constarints E1> x'>(x3>*x(>.0. " summary of the finincial characteristics of the three invetment alternative is presented in th efollowing table: investmen alternative 1 ' 3 "llowable si=e oft return B initial investment 2Cs3 1.x(.'SS:3 !he 01 model <aximi=ed 2total return3 J90.x'.x3."nd E19G 1H x(9G1 E'9G1H x 9G1 E39G1 x1.>0. and also has a total of Cs .1'x'>0.10 2iv3 cash re7uirment constarints x:A90.'0x >0. to add in its investment decision. !he terms aof investment is the average length of time period re7uired to reali=ed the return on th investyment as indicated: .000 vaialable for the invetment vat the beginning of the first year.'0: "n invetor has invetment opportunities available at the bergining of each of the next five year.

000H x339G x1(9G1. 4ash income can be obtained from three main crop and two type of livestock: dairy cows and laying hens.@1.000H x3(9G x1 9G 1.000 0. 0.33 at the beginning of the year U#91. 5ach cow will product net annual cash income of 3 00 for the farm.'0x3'@1.x'3@1..00. . man hours during sep@may.1+x11 or Oy1@1.S 3 I19amount not inveted in any of the investment alternatives in period # 001 model <inimi=e total return J 9 1.3.00. 01 model formulation: the data of the problem is summari=ed as follows: constraints 4rop extra gpurs total availability cows hens paddy ba#ra #awar sep@may #une@aug <an@hours ?epUmay 100 0. !he correspondingfigure for each hen are: no acrage.000 si=e of invetment constraints x119G 1.00.'0x31@1.x'1@1.S 2ii3 remark: to formulate the first set of constraints of yearly cash flow the following situation is adopted: 2invetment alternatives8x1'>x''>x3'>y'3 9 2invetment alternatives8 y1>1.000 in funds for invetment the form member can produce a total of 3 00 man hours worth of labour during the months of sep@may and (000 man hours during the month of #une@august.x'(>1.this investor wishes to determine the investment plan that will maximo9i=ed th amount of money which can be accumulated by the beginning of .H #91.'.1.000 2year .000H x3'9G x139G 1. !he chicken house canm accomadate a maximum of (000 hens and the si=e of the cattle@shed limits the members to a maximum of 3' cows 5stimatwes man @hours and income per acre planted in each of the three crops are : 1addy ba#ra #owar <an hours ?eptember O <ay (0 '0 ' Qune U "ugust 0 3 (0 )et annual cash income 1'00 *00 * 0 !he cooperative farm wishes to determine how much acrage should be planted in each of the crops and how many cows and hens should be kept to maximi=e its net cash income.'.'1: " cooperative form owns 100 acres of land and haas ' . 100 man hours during the summer.1.000 0.000H x319G x1'9G1. 0.1+x1 >1.1+x11>x1'>x''>x3'>y390 2year '3 @y'@1.'.1+x1'>x13>x'3>x33>y390 2year 33 @y3@1.000H x3 9G and Ei#H IiA9 0 for all . )o invetment funds are needed for this crops.x''@1.00.f any of these man hours are not needed some members of the firm will use them to work on a neighbouring farm for Cs ' per hour during september@may and Cs 3 per during #une@august.1+x13>x1(>x'(>x3(>y(90 2year (3 @y(@1. /ormulate this problem as an 01 model so as to maximi=e total return 01 modeule formulation: Decision variables 0et Ei#9amount to be invested in investment alternative 2.1+x11Ux1'>x''>x3'>y'90 a\$riculture T.3 @y1@1.'0x33>y ?ub#ect to the constraint 2i3 yearly cash flow constraints x11>x'1>x31>y19 .000 0..000 0.91.1+x1( >x1 >x' >>x3 >y 90 2year 3 0.( man hours during #une@augsut and an annual net cash income of Cs '00. (0 '0 ' 1 @ 3 00 .00. \$owever each cow will re7uire an invetment outlay of Cs 3'00 and each hen Cs 1 <oreever each cow will re7uire 1 acres of land.th year in future.1.'.00.1.

x'.9 extra man hours utili=ed in sep@may E:9extra man hours utili=ed in #une aug.93 00 2?ep@may duration3 0x1>0. 01 model formulation: 4rop " farms 1' x11 3 x1' the data of the problem is summari=ed below: crop re7uirment 2.3 0 @ @ 1 3 00 0.x'>(0x3>'0x(>' x >x. \$owever any combination of the crops may be growth at any farms .n order to maintain uniform workload among the farms it is the policy of the organi=ation that the percentage of the usable acerage planted by the same at each farms.x(.n acres3 x13 :00 (000 expected proffitVacre .>3x: ?ub#ect to the constarints 2i3 man #ours constaints 100x1>0.ncome 2 Cs.( 1 @ @ '00 0 1 @ @ 1'00 3 1 @ @ *00 (0 @ @ @ * 0 @ 100 @ @ ' 1 3' (000 3 (000 Decision variable: let E1 and x' 9 number of dairy cows and laying hens respectively E3.n acre feet expected prifit per acre 2Cs3 .'': " certain farming organisation operates three farms of comparable productivity.00 300 1 00 '000 +00 water available in acre feet the organisation is considering the crops for planting which differs primarily in their expected profit per acre and in their consumption of water.x . /ormulate this problem as an 01 model in order to maximi=e expected total profit.x3. the organisation wishes to how much of each crop should be planted at the respective farms in order to maximi=e the expeted profit .(x'> 0x3>3 xy>(0x >x:9 (000 2Qune@"ug during3 2ii3 land availability constarints 1.. !he output of each farm is limited to both bythe usable acrage and by the maount of water available for irrigation. /urthermore the total acrage that can be devoted to each of the crop is limited by the amount of appropriate harvesting e7uipment available.x(.x. !he 01 model <aximi=ed net cash income J9 3 00x1>'00x'>1'00x3>*00x(>* 0x >'x.Qune O"ug 0and 1. 4rop " F 4 maximi=e average :00 *00 300 ( 3 (000 3000 1000 water consumption .x 9 average of paddy.x:A90 T. ba#ra and #awar crop E. 4ows 1 \$ens @ )et annual cash .. !he data for the upcoming season is shown below: farm 1 ' 3 usable acrage (00 . x1>x3>x(>x 9G100 2iii3 livestock constarints x9G3' 2dairy cows3 x'9G(000 2laying hens3 and x1.

4ost Ce 1' per unit overtime cost Ce '( per unit inventory carrying cost Ce ' per unit per month shortage cost Ce ( per unit per month .9.2.'3 !he 01 model <aximi=e 2net profit3 J9 (0002x11>x'1>x133>30002x'1>x''>x'33>10002x31>x3'>x333 ?ub#ect to the constarint 2i3 crop re7uirment nconstarint x11>x1'>x139G:00 x'1>x''>x'39G*00 x31>x3'>x339G300 2ii3 available acrage constraints x11>x'1>x319G(00 x1'>x''>x3'9G.0 0 (0 normal prod.00 92x13>x'3>x3338300 2c3 2x13>x'3>x3338300 92x11>x'1>x3138(00 Ei#A9 0 for all the . /luctuating production made overtime work necessary the cost of which is estimated to be the doubble the normal production csot of Cs 1' per unit. 01 model formulation: the data of the problem is summari=ed as follows. trans&ortation T.00 2b3 2x1'>x''>x3'38. 1roduction capacity sales <onth regular overtime 1 0 30 .0 ' 0 0 1'0 3 .'.333 to farm #2#91.'3: "F4 manudfacturing company wishes to develop a monthly production schedule for the next thnree months. Depending upon the salews commitment the company can either keep the production constant allowing fluctuation in inventory or inventories can be maintained at a constant level with fluctuating production.'.00 x13>x'3>x'39G300 2iii3 water available constraints x11>(x'1>>3x31 x1'>(x''>>3x3' x13>(x'3>>3x33 9G1 00 9G'000 9G+00 2iv3 and social e7uality constraints 2a3 2x11>x'1>x3138(00 92x1'>x''>x3'38.0 ' 0 0 1'0 3 .3.'.3: and #91.F x'1 4 x31 Rsable acrahge %ater available x'' x3' (00 1 00 x'3 33 .00 '000 let *00 300 300 +00 3000 1000 Decision variables: Ei#9 nun9mber of acrage to be allocated to crop .9 1. /luctuating inventories result in an inventory carrying cost of Cs ' per unit8month if the company fails to fulfil its sales cimmitent it incurs a sales shortage of Cs ( per unit8month. !he production capacity for the next three month are shown below: 1roduction capacity sales <onth regular overtimesales 1 0 30 .0 0 1(0 formulate this problem as an 01 model so as to minimi=ed the total cost.

>x:A93 .'. '.e. !he demand for th#e three month will be the sales during these months..0 0 . (.0 0 ( nomore than (0 doctors can start their five working days on the same day. /ormulate a general linear programming model to minimi=e the number of doctors employed by the hospital. "ll supplies against order have to be made and can be made in subse7uent month if not possible. !he information given can now be presented in matrix form as follows: <1 1' 1. !his balance can be supplied during month 3 at an additional production cost of Cs.x13 > 1.0 30 <1 <' <3 <126!3 <'26!3 ?ales demand Decision variable : 0et Ei# 9 amount of commodity sent from source of supply . # 2ii3 and &ersonal T.'(: evening shift resident doctor in a government hospital work five conse7uive day and have two consecutive days off.assume five sources of supply: three regular and two overtime 2because second month overtime production is =ero3 production capacity. !heir five days of work can start on any day of the week and schedule rotates indefinetely.0 x1'>x''>x3'>x('>x '9 1'0 x13>x'3>x33>x(3>x 39 (0 xi#A9 0 for all . in month '.'. '0 '( 3' .0 x(1>x('>x(39 30 x 1>x '>x 39 30 sales demabd constraints x11>x'1>x31>x(1>x 19 .. !he 01 model <inimi=e total number of doctor J9x1 > x' > x3 > x( > x > x.x(' > '*x(3 > 3'x 1 > '*x ' > '(x 3 ?ub#ect to the constarints 2i3 production supply constarints x11>x1'>x139 0 x'1>x''>x'39 0 x31>x3'>x339 .x3' > 1'xx33 > '(x(1> '. during the month of order with additional cost e7uivalent to the shortage cost .S. !he hospital re7uire the following minimum number of doctors working: sun mon tues wed thurs fri sat 3 . > x: ?ub#ect to the constarints x1 > x( > x > x. !he culumative production of month 1 and ' in regullar and overtime is 130 units while the order are for 1*0 units.21.0 m' 1( 1' 1. 1( 1' '* '( 1(0 production 2supply3 0 0 . '* 1'0 m3 1. 01 model formulation : decision variable let E#9number of doctor who start their duty on day # of the week. 3 to destination #291.33 !he 01 model <inimi=e 2total cost3 J9 1'x11 > 1(x1' > 1.x'1 > 1'x'' > 1'x'' > 1(x'3 > '0x31 > 1.

!he training programme lasts for one month.n #anuary there are 10x1 trainees in the program and out of those only : x1 will become trained machinist 2iii3 total trained machinist available at the beginning of march 9number of machinist in Qan. x3 x(.3 sub#ect to constraints 2i3 total number of trained machinist available at the beginning of #anuary 9number of machinist doing machining > teaching > .dle 1309 100 > x1 >x' x1 > x'930 2ii3 total trained machinist available at the beginning of february 9number of mechinist in #anuary > #oining after training program 130>:x19 1 0 >x3>x( :x1@x3@x(9'0 . <arch '00. /ebruary 1 0. x(9 trained machinist teaching idle in /ebruary respectively E .9:0 company re7uires ' 0 trained mechanist by april 130 > :x1 > :x3 > :x 9' 0 :x1 > :x3 > :x 91'0 x1.A9( x#A9 0 for all # T. 01 model formulation: decision variable let E1 . !here are 130 trained machinist available at the beginning of the year. x.s re7uirement for the next three months are as follows: Qanuary 100. > x' > x3 > x( >x A9 0 x: > x3 > x( > x >x.' : " machine tools company conduct a #ob training programme for machinist.n addition the company re7uires ' 0 machinist by april.x' 9 trained machinist teaching and idle in Qanuary respectively E3. > Qoining after training programme in Qan "nd /eb. 1+00 1:00 formulate this problem as an 01 model so as to optimi=e the cost of hiring and training schedule and the compan.0 x. 1ayroHH per month are: 5ach tarinee : Cs 1(00 5ach trained mechinist 2machining and teaching3 each trained mechinist 2 idle3 : Cs.")D x' > x > x. > x: >x1A9 x3 > x. x'. . only seven complete the programe sucessfully and t he rst are released. !rained machinist are used as a teacher in the programme at the ratio of one for every ten trainees. x .9 trained machinist teaching idle in march respectively !he 01 model <inimi=e 2total cost3 J9cost of training program 2teacher and trainees3 > cost of idle mechanist > cost of mechinist doing machine work 2constant3 9 1(00 2 10x1>10x3> 10x 3 > 1+00 2 x1>x3>x 3 >1:002x'>x(>x.r re7uirments. :x1> :x3@x @x. !rained machinist are also needed for machinig and company. /rom past experience it has been forund that out of ten trainee hired. 130 > :x1> :x3 9 '00 > x > x. A90 2iv3 and . > x: > x1 >x'A9.0 x( > x: > x1 > x' >x3A9 0 x > x1 > x' > x3 >x(A9. x.

00 units. !he profit per production run from process 1 and process ' are Cs 300 and Cs 00 respectively.t takes three hours to produce a unit if " and one hour to produce a unit of F.nputs 2unit3 6utput 2units3 4rude " 4rude F Dasoline E Dasoline I 1 3 * ' ( ( ( the maximum amount available of crude " and F are '00 units and 1 0 units respectively. the management want to set a schedule that would minimi=e total manpower costs. 1art timers earn '* per day on the average.000 units and that of F isd 1'.'. of worker )55D5D '' 30 ' '3 the super ba=ar now employes '( full time worker but need a few part time worker also. " part time worket must put in exactly ( hours per day. but can start any time between + "< and 11< full time worker work from + "< to 1< but are allowed a hour for lunch 2 half of the full timers eat at 1' "< the other half at 1 1<3 full timers thus provided 3 hours per week of productive labor time. <arket re7uirement shown that at least 100 units of gasoline E and *0 units of gasoline I must be produced. 11"<.'* !he manger of an oil refinery must decided on the optimal mix of two possible blending processes of which the input and output per production run are given as follows: 1rocess . E#A90 for all # Problem on production Q. !he rusg hours are between noo and ' 1<. /ormulate this problem as an 01 model so as to minimi=e total manpower daily cost. while full timers earn +0 per day in salary and benefits on the average . the market has been surveyed and company.33 !he 01 model <inimi=e 2total daily manpower cost3 J9 +02y>'*2x1>x'>E33 ?RFQ54! !6 46)?!C".000 man hours. !he table below indicates the number workers needed at various hours that the ba=ar is open. /ormulate this problem as a linear programming model . !he management of the superba=ar limits part time hours to a maximum of 0B of the day. /ormulate this problem as a 0inear programming model.: !he super ba=ar in a city daily needs between '' and 30 worker depending on the time of the day. !he production process has a total capacity of 30. products can be sold in any combitations. they ar eproduced in a common production process and are sold in two different markets. .T. T.)!? I>x1A9'' M +"<@11"< needN 218'3y>x1>x'A930 M11"<@11< needN 218'3y>x'>x3A9' M11<@31< needN y>x3A9'' M 31<@ 1< needN y 9G'( Mfull time availableN (2x1>x'>x339G0. 01 model formualtion: decision variables 0et I9 full time worker E#9part timer worker starting at +"<. 02''>30>' >'33 M part timers time cannot exceed 0 of total hours re7uired each dayN and y. ?ub#ect to these limitations. and 11< respectively 2#91.'. !ime period +"<@11"< 11"<@11< 11<@31< 31<@ 1< no.s official feels that the maximum number of units of " that can be sold is *.s total re7uirement . making a profit of Cs (0 and Cs 30 respectively per unit on them .27 " company sells two differenet product " and F.

. !he raw material re7uirement per unit of the three model are as follows: Caw material " F re7uirement per unit of given model . bored and polished.. !he prices at which the firm buys and sell vary every month.. capacity of boring is '* per hours for " and 3 per hour for F and the capacity of polishing is 3 per hour for " and ' per hour for F. and three times that of model .. !he three machiness have running cost of Cs. 1. Q. /ormulate yhis problem as an linear programming problem T.'+ " firm places an order for a particular product at the beginning of each month and the product is received at the end of the month.3 of a certain product product. !he firm sells during the month from the stock and it c an sell any 7uantity. !he terms of contract re7uire that 1. and does not wish to have any stock at the end of #uly.0* 1. !he following table shows the pro#ected buying and selling prices for the next four months: <onth "pri <ay Qune Quly selling price 2during the months3 @ +0 .. a company received a contract to supply . !he company can produce 1 . 1:.0 @ !he firm has no stock on hand as on "pril 1..0 : purchasing price 2beginning of the month3 : : . Q. Cs 10 and Cs. formulate this problemas an 01 model to determine the product mix which maximi=e profit...32 6n october 1. 3. !he entire labor force of the factory can produce the e7uivalent of ' 00 units of model . is twice that of model ..000 units per month on regular time and : 0 units per month on overtime..:0 1..000 units of speciali=ed product.31 consider a small plant which makes two type of automobiles part say " and F. .000 units in november and '. !he firm has a warehouse of limited si=e. each and those of for part F cost is Cs. \$e uses two type of raw material 2" and F3 of which (000 and .000 units be shipped in october. . .. the wine maker wishes to blend . !he manufactureing cost per item produced during regular time is Cs. "ssume that the profit per units of models . /ormulate this problem as an 0p model in order to determine the number of units of each product which will maximi=e profit. \$owever the ratio of the numbers of units produced must be e7ual to 3: ': .. 0 per hour. . each. .0.33 " wine maker has stock of three different wineswith the following characteristics: %ine " F 4 1roofs ': 33 3' "cids B 0..3' 0... !he problem is to determine the number opf units to buy and sell each month to maximi=e the profit from its operation.T. 00 and 3: units respectively. 3 and the cost per item during overtime is Cs ( .30 " manufacturer produces three model 2. casting for part " cost Cs ' and sells for Cs.00 units respectively are available.0( stock2gallons3 '0 3( '' " good dry table wine should be between 30 and 31 degree proof.0. '0. "ssume that any combination of part " and F can be sold.30 specific gravity 1. Q. ' 3 ( ' : !he labor time of each unit of model .. " market surveys indicate that the minimum demand of the three model are : 00.000 units in december. it should contain at least ' B acid and should have specific gravity of at least 1. is Cs . /ormulate this problem as an 01 model so as to get optimum schedule....'0 0. !he capacity of machine is ' hour for " and '( per hour for F. 3 and sell for Cs .t buys casting that are mechined. (0 and 1000 respectively.. !he monthly storage cost is Cs. which can hold a maximum of 1 0 units of the product. .

Q. protein and vitamin content of three basic food are given in the following table: Pa\$e 56'61 shamshad . 10 per hour actually worked and who will work upto a maximum of (* hours per week. /ormulate this problem as an 01 model.have agreed to aplan whereby they average (0 hours per week each. \$owever his stock od wine " must be completely used in the blend because further storage would cost it to deteriorate. !hese specification along with the calorie . Iou are advised to formulate the production schedule which will maximi=e the profits in the kight of the following information:: !ype !otal componet cost per radio 2Cs3 '00 1. presently '00 radios of each type are manufactured per week.0 <an hours of assembly time per radio 1' .'0. !he only other cost incurred by the company are fixed overheads of Cs.the company can obtain a maximum supply of . 5ach radio of either type re7uires one speaker.the three types of wine to produce a as large a 7uantity as possible of a satisfactory dry table wine.6nly speaker actually used need paid for. "verage man@minute of inspection and correction time per radio 10 3 ?elling price per radio 2Cs3 (00 '*0 " F !he company employs 100 assembler who are paid Cs. " and F.!heir cost has been included in the components cost given for each radio in the table above.35 "F4 foods company is developing a low calorie hihg protein diet supplement called \$i91ro. the four inspector have certain other administrative duties which have been found to take up an average of * hours per week. %hat 7uantity of wine F and 4 should be used. \$owever.00 in any one week. !he inspectors who are presently four.34 the EIJ company assembles and marketing two types of transistor radio. Q. !he specification for \$i@pro have been established by a panel of medical expert. the type being the same for each radio.000 per week. \$owever.