om 203) sic version doll A and a deluxe version doy g seine doll of type A The company have time to mofo” ces two types of 309. A toy manufacturer produces Wo tyP nng to produce as one it. The deluxe version, i.e. type f ch doll of type B takes twice as long t0 p requires equal amount of it. acne oF 200 datts per day and each Oe eat eaiable Ifthe company makes a profit of Rs, qo s. 50 ind B; how many of each should be produced per day in order to maximiz, er doll reapectvely, on doll A and ? many of each shi re pr te Rs, $0 per doll, respectively. 0 soothe b I ceediiecs) ic for television sets and certain printed circuit Me Te ae ee jn expands a nul ea peace eel marketing of AM and AM-FME radio. for radios, The company has just expanded into fu veck. Production of an AM radio in the new plant will require ts bei anew plant hat can operate 48 hours per week, Production of an AM radio inthe new Rs. 40 to profits : contribute Rs, ofits. , Srevmind thar a anu of 1S AM adie and 10 APM radon cn be sd each week. oe (0 Bormulate a linear programming model to determine the optimum production mix of AM-FM radios that ‘will maximize profits. (Gi) Solve ic aiore problem using the graphic model. | [Delhi M.B.A. (Nov) 1998) SUL. A firm makes two products X and Y and has a total production capacity of — per day, X ad ¥ requiring the same production capacity. The firm has a permanent contract to supply atleast 2 tonnes of X and Tad chan ims 7 er day to another company. Each tonne of X requires 20 machine hours’ production see SESS" anne LY reaures $0 machine hours of production time, The daily maximum possible nunbes ‘machine hours is 360. All the firm’s ‘output can be sold, and the product made is Rs. 80 per tonne of X and Rs 120 per tonne of ¥. It is required to determine the production schedule for maximum profit and to calculate this profit. (Dethi M.BA_ 2009) Products are produced and sold on a weekly 5 for product P, because of limited available Product Pj requires 2 man-weeks of labour, while Py requis requires 60 and on P, is Rs, 40. Formulate it as a linear Programming 312 Anita Elecris Company produces two products Py and tess, The weekly production cannot exceed 25 for product Py ands ‘silts. The company employs total of 60 workers, ne man-week of labour. Profit margin on P, is Re Problem and solve for maximum profit 2 A consumer durable manufacturer has potenti markt for €¥0 products P, and Ps. In the production shop he finds that two of his machines Mi and M which are necessary for the Products P, and Py are having “ented capacity. The following table gives the maine cure teauited and machine hours available MACHINE-HOURS REQUIRED PER UNIT : 0 per pieee and of Py as 0 2 as Rs. 50 per piece. only 10 units of P\, Find out the best ne required to machine and drill one casting Machining hours . x 7 Drilling hours me Vt fathes and three dt ; oe eae co % ee Si there is no lost time and. umber of X and P casings eX i RS. 3 ae nit Whilst samings that can be sold Pt it and Ys Re ghee ded costs amount to Rs. 1,000 per ft The co er unit. Th PROBFAMMING Model forthe prope eY,Midhes to marae tit There are no limitations on the ‘ou are required to: ly.LINEAR PROGRAMMING PROBLEM—GRAPHICAL SOLUTION AND EXTENSION 4 An oll refinery can blend thee grades of erie oil w produce quality & and auality $ Pant Two possible blending proceses are availabe, For each pradition ran n,preduce ize uses 5 unite of crude A. 7 uni posse B and 2 units of crude C to produce 9 units of R and 7 unite of S. The newer Froes uses 3 units of Gude A, 9 units of crude B and 4 units of crude C to produce 5 units of K and '9 units of $ petrol. Because Wor contract commitments, the refinery must produce at least 500 units of an Jon) units of § for the Pret onth Tt has avaiable 1500 units of crude A, 1900 units of crude Hand 1000 unis of rae C. For each anit new te refinery receives RS. 60, while foreach unit of Sit receives Re, 90. Write down the linear programming ot Malation of the problem so as to maximize the revenue and solve it by graphical ret le blending processes of ‘316, The manager of an oil refinery must decide on the optimal mix of two possi wich the inputs and outputs per production run are a follows Input (units) Process Sh an Grade A Grade B = 7 3 3 2 4 5 _ The maximum amounts available of crudes A and B are 200 units and 150 units respectively Market The profit airements show that at least 100 units of gasoline X and 80 units of gasoline Y must be produced. Heuston run for process | and process 2 are Rs, 300 and Rs. 400 respectively. Solve the LP protic 9 go graphical method. [Osmania MBA. 2001) S17. A firm plans to purchase at least 200 quintals of scrap containing high quality metal X and low quality metal ¥. It decides that the scrap to be purchased must contain at least 100 quintals of X-meta! ‘and no more than +35 quintals of Y-metal. The firm can purchase the scrap from two suppliers (A and B) in unlimited quantities. The ercentage of X and ¥ metals i terms of weight in the sap supplied by A and B is given bsiow ‘Metal Supplier A ‘Supplier B x 25% 5% 10% 20% a ‘The price of A's scrap is Rs. 200 per quintals and that of B's is Rs. 400 per quintals. The firm wans © ermine the quantities that it should buy from the two suppliers so that total cost is minimized. Si8, A cold drinks company has two bottling plans, located at two different places. Each plant produces three Jifferm drinks A. B and C. The capacities of two plants, in number of bottles per day are as follows Product A Product B Product C Plant 1: 3,000 1,000 2,000 Plant I: 1,000 1,000 6,000 ‘A market survey indicates that during any particular month there will be a demand of 24,000 bowties of A: 16.000 aitles of By and 48,000 bottles of C. The operating costs, per day. of running plants J and. i are soy G00 monetary units and 400 monetary units, How many days should the company run, cach, plat oseg the momth so that the production cost is minimised, while still meeting the market demand? Us Graphic method. [Pure MBA. 1999) 319. A company has two grades of inspectors 1 and 2, who are to be assigned for a quality contra inspection ‘per 8-hour day. Grade I inspector can check pieces at the rate of In is required at least 2000 pieces be inspected toner Bane fn an accuracy of 97%. Grade 2 inspector checks atthe rate of 30 pieces per hour with an accuracy of 95%, “The wage rate of a Grade 1 inspector is Rs, 5 per hour, while that of a Grade 2 inspector is RS. 4 pet hour. [An error mate by an inspector costs Rs. 3 t0 the company. There are only rine Grade 1 inspectors and eleven Grade 9 inspectors available in the company. The company wishes 10 assign work to the available inspectors 50 Ca ees al cost of the inspection, Formulate this problem as a linear programming model and solve it by sraphical method, [Delhi M.B.A. 2004; Panjab B.Com. 2008) 320, A manufacturer employs three inputs: man-hours, machine-hours and cloth material to manufacture. wo Iypes of dressce: Type A dress fetches him a profit of Rs. 160 per piece, while type B, that of Rs. 180 per piece. ‘The manufacturer has enough man-hours to manufacture SO pieces of type A or 20 pieces of type B dresses per day, while the machine-hours he possesses suffice only for 36 pieces of type A or for 24 pieces for type B dresses. Cloth material available per day is limited but sufficient enough for 30 pieces of either type of dresses. Formulate the linear programming model and solve it graphically. [Delhi M.Com. 2008) int: ints re H+ Esl Hee 42 [Bint Constraints Sts etme Ss! ot 30S! 1, th The standard weight of a special purpose brick is 5 kg. and it contains two basic ingredients B, and B, costs Rs, 5 per kg. and By costs Rs. 8 per kg. Strength considerations dictate that the brick contains not more76 OPERATIONS RESEARCH than 4 kg. of B, and minimum of 2 kg. of Bo. Since the demand for the product is likely to be related to the price ‘of the brick. find out graphically minimum cost of the brick satisfying the above ne mangers seman 322. Find the maximum value of z = 50x, + 60x) subject to the constraints : 2x; + 3ty < 1500, 3x + 2x < 1500, 0S 4 S400, OS HS 400. 323. Maximize = = 1.75x, + 1.50x2 subject to the constraints : 8x, + Sty < 320, 4x, + Sx < 200, OS x, 2 15, OS m2 10. 324. Find the maximum value of z = 7x; + 3x2 subject to the constraints : ny ty 23 xp ty S4 OSH 5/2, OS my 8 3/2 325. Show graphically that the maximum or minimum values of the objective functions for the following problem are same Maximize (or Minimize) z = 5x, + 3x, subject to the constraints : xy +X) $6, 2x, + 3x23, OS x, 23 OS x > 3. [Purvanchal M.C.A. 1996) 326. Find the maximum value of z = 5x, + 3x2 subject to the constraints : x) +4) 6, Wy + 3y 26, 05454 05553. 327. Solve graphically the following L.P.P. : Maximize z = 3x, + 2x) subject to the constraints : Hy teh ay Say tay S 3, yay 2. 328. Find the minimum or/and maximum value of z = 3x, + Sxy subject to the constraints : (a) -3, 4x, < 12 ~ , ay + day S12, Day - xy 2-2 (b) MPSA 2 SO ax, + 2 S18 24 Bay 212 424,20, 224,20, My +X SW Y 20. : 2 Ure n Xn te .