Scribd Logo
Upload

Welcome to Scribd!

  • 156 views

    Or New 2020

    Uploaded by

    narayan patel

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd

    Or New 2020

    Uploaded by

    narayan patel
    156 views238 pages

    Original Title

    or new 2020

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Download as pdf
    156 views238 pages

    Or New 2020

    Uploaded by

    narayan patel

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Download as pdf
    You are on page 1of 238
    Pee ee eee EY A As Per Revised Syllabus under CBCGS System of BMS Course under Mumbai University w.e.f. June, 2018 Vipul’s™ OPERATIONS RESEARCH (BMS Third Year : Sixth Semester) (Core Courses - Compulsory) NITIN KULKARNI B.E., MMS BMS Coordinator, Viva. College of Arts, Commerce and Sciencé, Virar (W), Dist. Thane. THIRD REVISED EDITION pose ™ VIPUL PRAKASHAN 161, Jagannath Shankar Seth Road, Girgaum, Mumbai - 400 004. ‘TelefF'ax: 2387 1127 / 2387 9395 E-mail: [email protected] Apu Aw 10L i | IXXWIT | LEO OOF - QUIN “PEPE | ‘aeavyg Sodpl, vEPEM “FT | wayO ATOL | eee 2hq pared 00°OST 2 > Taping aa Fo Coad waa sd By OW BAITED TB | supose, Rindesoiayd Bupnpur Yeouoypou 40 34022979 ‘sue As | [ete do pom n ponrne 2 “Tow Joways od hao 20 wonerqand sep Jo 232 MU ORBAN. Se ada Aqumtioypousroy Zou ayy xe A at no orp envoy oon 2 fo Bupun puD Zunuud Bump opi vPwer L2Pd #0 219 SG RON 6-9-5 £6gV6-18-846 ‘NASI i | suojnipa avant (spe) qeanaing suopmasdo, P00 OOF - QUINTA, ueyseyerd I oor ‘AN 28 paqsnqud Preface It gives me a great pleasure to present the Third Revised Edition of this book to students and my fellow teachers. A number of changes have been incorporated in this edition nce as a teacher and feedback based on my personal experi of students and other teachers. Concept questions with answers have been included at the end of every chapter. Solutions to university question papers’ questions has been provided in respective chapters. The book has been made moré comprehensive. Attempt has been made to make it more teacher friendly as well as student friendly. ‘Any more recommendations and suggestions for further improvement of the book are most welcome, both from students and my fellow teachers. | hope the book ful their expectations. | the cooperation | sincerely thank Vipul Prakashan for and encouragement. Author email: [email protected] Syllabus Objectives: {2) To help students to understand operations research methodologies. (2) To help students to solve various problems practieolly. (3) To moke students proficient in case analysis and interpretation. No. of No. Modules/Units taclnae 1_| introduction to Operations Research and Linear Programming: 15 (a) _ Introduction to Operations Research: + Operations Research: Definition, Characteristics of OR, OR Techniques, Areas of Application, Limitations of OR, (b) Linear Programming Problems: introduction and Formulation: iction to Linear Programming. ications of LP. = Intro = Ap = Components of LP. = Requirements for Formulation of LP Problem. © Assumptions Underiying Lifear Programming, = Steps in Solving LP Problems. * LPP Formulation (Decision Variables, Objective Function, Consteaints, Non Negativity Constraints}. Linear Programming Problems: Graphical Method: + Maximization and Minimization Type Problems. (Max. Z and Min. 2) * Two Decision Variables and Maximum Three Consteaints Problem + Constraints can be “less than or equal to”, “greater than or equal to” or a combination of both the types Le. mixed constraints © Concepts: Feasible Region of Solution, Unbounded Solution, Redundant Constraint, infeasible Solution, Alteristive Optima. {d) Linear Programming Problems: Simplex Method: ‘© Only Maximization Type Problems. (Only Max. Z}. No} Minimization problems. (No. Min, Z) Numericals (011 Degeneracy in Maximization Simplex Problems. = Two oF Three Decision Variables and, Maximum Three «i Wts Problem, (Up to Maximum Two Iterations} + All Constraints to be “less than or equal to” Constraints. ("Greater than or Equal to” Constraints not included.) (@) (yay i -auyses> Jo. suone: (po) anog wnweW uo paseq ‘aul, vonadwo3, ppaforg lewndo pue ys09 wales (wnu “s3609 [e101 pue Is09 yseID “Ae ‘paupur ‘Annoy ue jo adols 1509 “sapunaay Jo 3509 luserp ‘Ouily ysei9 “IS09 [eWON “SUNIL ICUUON :s1daqu0y HBuyyses9 woafosd OU & ‘sapinnay-(0t) UaL WnUIKeW jo BuRSIsUOD jeu — ‘Bu1ysesd waloig Jo SS990K4 = ae -Auyysesy woford Ul yo apes ‘soy AWL& pana yum sjeoyounN sBulyser y2elo1d UH paAjonu| ISD & ‘Buyysesy vatosg jo Buueove —« 701g BuvopewUE pue e014 uapuadapul “eO1s 2944 “IeOHd FELOL "4>eIS UIA we. “3peIS 1U9A9 PeDH “LT “AST “143 “LS3 Jo uONeIND}eED> -spowpaw ssed puemyoeg pus sseg puemiog + “aul wojiaiduiog Ypafoug ‘SaINADY “sanianay (01) uy, wnwixeny jo “Aynnoy Awuing yo 960 “wes8eig oman unsnnsuod Jo saidrua ‘diysuoneloy aouaped.ig pUE Ciysuoneiay apON “wesdeId YOMIEN e Jo UORONASUOD “Ayanpy 161g pue yUs.sN2uOD ‘ueAg ISIN YusmaN UaAg ‘AIANDY :sYd99uED + Hiwdd) pouray yea fe) Taishreuy jamin "RUBIN 1 papmpul aq OF JON 2427 jonjd9D109 10 Ayu pasano> 2q 01 1d22u07 Aao184269q “papnypus 10U 5) waygoid voUUzHLILIPY ausLL ‘papnjow you s1 w2jqorg Buynpayps uorsznpalg te) ca oo 10M | a ‘sal uyxeyy 31) suopes23) omL WNUK (v pue A‘n) ‘pona {raow) vonnaiasia pauIPOW Aa uonnjes jewndO FUIPLE seuvew vonevodsueLs BuISvaDUT CZ) Axxouosa jo woezyEqoIg (1) ~ suosvas Sujao[oy 0} aNp d10ur UaAa pasee1du Supper ucrspep jo souejoduyy oyp ‘TuowoeuLLr ssoursng WopoL “en0}983 DIAIOUOD? OIL PUP OsONU rAYRO pure sroMaduro> q SEH” aannaduios apqissod ‘uoneznuvlzo sry jo Atiqe aanosox oY uNOD2" O}UL D721 0} Sey a} ‘AjUFEySIUN Jo suOAENYS sApUT. BuDpOM ay Bupjet JZo}Spop Jo He oy Paz9]seUr Sey OM oUO ayy sf IoeUET [NZSSIDINS ‘saaqynooxa pur siaBeueus 31 JO Gmige Supjeur uoyspop op uo qUaIxe juLoyTURts eo} spuadep astidanyuD ssauisng Aue so ssasons at|| “ssa001d Supyeus uorstoap uo paseg st Anaype uawadvuvur Grog “Aue Jf ‘suondumese a[qeyms 2p PLP JO 195 a]quTeAw 2p Uo poseq suoIsHap Zureur jo ssaoid ayy st juoMBeUEyy ‘NOMONGOULNI = 'E 2 ee eee ea ere NE suo;sondadssuep suonsend ennselag = sanbluypa) ypurasay suoneiado jo suonmaur] 9° sonbluyse) youeosoy suonesed 40} seosy uoneoyddy $1 sanbuuypey ysuvasay suoneiodo +1 ypuvosoy suontiedg jo Bojopomay 1 yauzesoy suonesedg Jo punosByseg OHOISIH 71 uopanposuy |} yoleasay suoneiodg 0} UORNINpo.uy T saideyd BABAR ypueasay suoneadg 01 uonsngonuy i | e zrusy sadeg onsen Aajssaniun :9- mpuaddy | = osvuze sas1axa leouownn 02 siemsuy 29 -xIpuaddy | = strstr ayaeL Ageaoia 1ewuON zy - xipuaddy | = “= seojpueddy a ser-sor sowen jo Asoaut | ‘TT vop-zee surojqoig Bujauanbas Gor | “OT N-mn (sya) anbquyzay momoy pun vonnnyorg 2UUs016014) |g tase MN. SISAeuy 1OMI0N (Gu143019 228/014 | g aee-co ISATEUY LOHAN (argo) powaawn yp0d 12282) ) zoe-esz T= SISeUy HOMION mean ose-erz swjgord awowunissy | 9 areoer suajqosd vonepodsuest |°s nw (pounary x0;2u15)) erie Bujuuutes#og 4200" (pourayy woorydor5) | exe 1-Suquusessong 2e0un (vonojnussoy wiajqore pun sidoou0g 21806) |.» ee6 1 BujuausesBoig se9un et upseasoy suotesadg 03 uoranpostt |r tau | “sa6og eadoy i “ON sqUuaqzuUoy 13 oe ‘Viput’s™ operations Research (MS) (3) Dynamic and ever changing business environment (4) Technological advancement (5) Importance of protecting the bottom line (profit) of the balance sheet (©) Protecting interests of stakeholders (2) Formation of new partnerships (joint ventures) or Mergers and acquisitions of global scale ‘The process of decision making will be more scientific if a manager uses quantitative decision making models. Operations Research deals with quantitative models which can be applied under various problem situations. It provides a manager necessary quantitative tools to make a better decision. 1.2 HISTORICAL BACKGROUND OF OPERATIONS RESEARCH: ‘Though the exact beginning of Operations Research is difficult to mark, we can say that Industrial Revolution brought 2 scientific approach to decision making, Operations Research grew more during the Second World War. It was used to find solutions on how to use scarce military resources to fight war. Since it was used to carry out military operations, it was called ‘Operations Research’. ‘After the war was over, Operations Research techniques were adopted by industry. Later on, with the advent of comp: development of Operations Research was even faster. Problem solving became much easier using combination of OR techniques and computer programs. Definition of Operations Researcl ‘One of the classical definitions of OR is — “Operations Research is the application of scientific methods, techniques and tools to problems nvolving the operations of systems so as to provide those in contro! of operations with optimum solutions to the problems.” Jn other words, we can say that OR is a collection of diiferent quantitative methods which can be used for solving problems in functional areas such as ~ production, transportation, distribution, project management ete. Features of OR: (G) Decision making: OR is used for obtaining numerical solutions to problems. Based on these numerical solutions, the manager can make decision making, TTT TTT fff fff tft tt tt tot Introduction to Operations Research 2 3 “ roe 3 Scientific nature: OR is quantitative in nature, not qualitative. Hence, it is not judgmental in nature. The problem is clearly defined. Numerical data is collected. This data is analyzed using the appropriate technique and the solution is obtained. Well defined goals and objectives: The problem is clearly stated. ‘The objectives are quantitative in nature and realistic. ‘Computer programming: A computer program can be created for a particular OR technique to solve problems involving large set of data. 1.3. METHODOLOGY OF OPERATIONS RESEARCH: a 2 ‘The application of OR generally involves following steps: (Problem formulation (2) Constructing a mathematical model and representing the problem in the format of the model (3) Data collection (4) Substituting the data in the model and then solving the mathematical model to obtain solution (5) Interpretation of solution (6) Decision making (Accepting, modifying or rejecting the solution) Problem formulation: The first step is to identify the problem and then representing, it precisely. This includes steps starting from problem discovery and ending in problem definition. Model construction: After defining the problem, a model needs to be developed to represent the problem, Models can be ~ (A) Physical model: It is a physical representation of the real situation. Eg. model of a proposed building, model of solar system, model of a missile or fighter plane ete. (8) Symbolic model: Symbolic models use symbols, letters, and numbers etc. 10 represent things associated with real life situations. Symbolic model can be verbal or mathematical. Verbal model is descriptive. It describes the situation in words. Mathematical model uses symbols and uses mathematical relationships. [Bg In wor, area of a rectangle is the product of its length and | breadth. In symbols we will express it as A=Lb cay usu Jo 3S09 UM 20) amRpayss UOREOdsuEN sURUIADP OL Cd) juamedeueu uopeHodsues | “Bunswios0j sores (6) -ypeor ummuupcein soy SusNIaApe OJ VOHDAPS BPW (Z) yyord umurpeur 405 xna jonposd jeundo aprep o1. (1) auaurefeuew Sunapeyy -parapso 2g 09 2218 30] sruTOUED ApMIs OL (1) quowageurur A10ju9Au] ramodueur syBry 10 pueutap jo ase> ut Aqpireys uo xday aq 04 posmbor jousosrod jo Joquin apPap OL (¢) Suprueid aomosar weumy op of @) “seaoumy zoey Apmas 01 «1) auaweSeueur ouuosi9g paouatibas aq prnoys sof yoryas ut aouanbas umurpdo pur sgof jo uopeoqe umuinds apap oF @) +219 aur Sumanb ‘our Supra oy anp suMN Jo sso] a1eINITL OF, (1) sjusuraSeuvur uoHonpory @ @ 2 (a) w) raze sajduexa swog ‘swolgord ssauisng jo Area vo pordde are sonbruy9) xO. 3SANDINHIAL HONVESIY SNOILVYIdO YO4d SVaYV NOLLVINddv quowedeuvur AiuaAu] (2) ‘Aro uorspag “pouyaur ped eon swoqgoad yuouutse sswwajqord u SurwmumeiBord svaury sonbiuysoy YO. Ae OSL sisdqeue uoyeyesio> pur sishqeue uoyssa80y (F) $s BS upieasoy suonesedo 0} uo! ST (a) Aroayy MyqeqoLd (2) uoHerAsp puvpurys pue uOHEEAap WEI @) spout pure uvipaur ‘Uva (1) rare sofdusexa 2 BBP 105 ayy je stuog “stsSzeue sonspmg ur par > pur u Jae sonbanpay anbrrypa3 peonsness CV) ‘sonbanjooy Suumumesord pue sanbrmypas yeonsnes ‘sdror :S3NDINHI3L HOUWASAY SNOLLWYAdO -symnsor peryse YIM [apout ayy Bupreduros Aq_ pais} aq ue jopour enyIs [ear ayy JO TOIARYag ay ypard UL '29q 0} spaot japou! y :uOHEPHTEA [POP \daose 40 wou nyos aup afar Ajayaqduzo> “uoRN}os o[sibap [eu pyew uOrs!>9CL quyardsaqut joe Jo autos are ‘230 Surpumouuns jo aouanyut ‘Seq Jos owres ay spear JaBeULUT JoyJOUR e sjaidioyur zaBeueur auo MOPY ‘OaTyeU ayy adasse £129 ayy “uonryo: yuepodun awg sunus019p i yoaqfo> 0} paar 9 (pucurop 40H qeqord “suonentis quaraysIP ae paxly aney you op Ady “anyeu UL wopueL 40 910s /2se> SHY UT :s]9POU IHSHFAEAeLA (A) -Ayuyeysao qi jo sonqea yuaxeyEp asaup yuarayyip 49put ue Aayy “sar are saiquerea ut st ayayp aseo sip UT ~ ary, B88 (swe) youeasay su0n210d0 SAMBA 1 payisseja aq ued sonbruysay saneAuENd, vt ippeaiq=q wwe =T Taare = a | ® o° @) © Introduction to Operations Research ‘w Viput’s™ Operations Research (BMS) @) Project management: i © parameters in the linear programming model are assurned to (1 To tent critica and non-csitical aves of a project Seas a tates ge OGL @) Te determine minimum project completion time. (Operations Research simply helps in improving the 3) To determine optimal project cost solution but may not result in a perfect solution. (G) Financial management: {@) Quality (i) Clarity (ii) Look Gv) Transparency (@) To decide investment portfolio to maximize return on (i) Operations Research involves analysis of complex investment. problems to arrive at the optimum solution. {@ Scientific Gi) Systematic (i) Both (I) and (i) (iv) Statistical Research solution may be extracted from a model either of the 1.6 LIMITATIONS OF OPERATIONS RESEARCH TECHNIQUES: wo ha Or Some of the major limitations of OR techniques are: { fo conducting experiments on it i) Mathematial analysis (ii) Sth 4) In construction of mathematical models, sometimes assumptions (i) and (ii) (iv) Observation Techniques are necessary to simplify "model construction. Bat "over: | 4) Oporations Reveorch tars, models to help the management £9 simplification of a model or too many assumptions can make the model unrealistic. Gv) Efficiency (2) OR techniques are quantitative in nature. Hence, these techniques (Which technique is used for finding a solution for optimizing a given do not consider qualitative or intangible factors such as customer | ‘objective, such as profit maximization or cost minimization under perceptions, employee motivation levels, quality of executives, | certain constraints? fe advantage of experience ete. G@ Queuing Theory (i) Waiting Line Gil) Both (i) and (ji) iv) Linear (3) All business situations, cannot be responded with quantitative — Programming niques. Some business situations require gut ini Jans: (a ~ Deterministic); (b ~ Probabilistic); (e ~ Central tendency): techniques. Some business situations require gut feeling, initiative (a_ CPM, PERT): (@ - Quantitative); (f ~ Constraints); (g ~ Quality); or managerial juclgement. OP techniques cannot be applied in such situations. (h— Both (i) & Gills @— Both ( & (ti; Gj ~ Both (i) & (id); (k ~ Linear Programmting)] (2) State whether following statements True or False: OBJECTIVE QUESTIONS: i fa) One of the areas of application of Operations Research is in () _Fillin the blanks with appropriate words given below: : Agric (a) Operations Research Models in which values of all variables and all [Ans.:(a) T possible outcomes are known with certainty are called __ | @)_ Match the following: models. ( Physical (i) Symbolic ii) Deterministic (v) Probabilistic Group 'B’ (@ Economic lot size o (©) Operations Research Models in whi variables are i ) Managing workers’ allocation ranclom jn nature are called i i) Quality control @ Physical (ii) Syrnbolic (ii) rministic (iv) Prot } 7 doy Piss G9 Syl i Determine Prob i iaBOS ) Managing routes (©) Mean, median aad mode are measures of 7 Ps ent (soc (#) Project managemen' Central tendency 6 (© Application of OR, in HRM| (vi) To maximize per capita income @ (Oct. 19) and ____ are techniques applied in project m (@ CPM and PERT GD Assignment and Transportation (iv) Decision | in Finance | (vi) Traini rogramme theory and Inventory models : | Ee reir tritit i tackeauiag Peoee te (©) Operations Research techniques are___"_ in nature. | =r ins: (a~ tify (#0); (e~ W); (d ~ 9h; Ce = tii); (Ff VHD); (GQ DIT Qualitative (ii) Judgemental (iii) Approximate Gv) Qt fAns.: ( - toile r See tttd tt?) dirt Tr???) 1?) 1)? iit TET TELL LLL LLL LOL LLL LLL LLCO LOLI heel xjur pnpoud jpundo puy 0 apeur a 9S juaraysrp pure s}S09 yuDs9}}1p Supaey syonpoad uOIsPep xRU-HNpeLd (1) wuoneordde jeunsnpuy ¢y) worstoag ‘aon 8 jo Ayuea v aonposd uv Audios y IDNIAWN VED OUd UVANIT HOS SVBYV NOLLWINddY ZT vonbrysay wonezrando ue st Sursaure Bord 20a) ‘pie owy wanULU ‘qyord umuspeeun ‘anaes wuLiajap 10j anbruypay e st SurmuesBo.d sour) INOILINGOWLNE = TZ aspiexg suonsondade2u0y = suopsond aanraidg = ‘Sui9}godd PEAS 9° suoneanur g suondumssy ‘seBauepy 5% dd j9 voREMUOY HT BunuuresBoid seoury jo MBojourusio, EZ Bujmuerosg swoury 104 seouy vonrayiddy 7% uonanponuy 1% (uonnjnutsog Wwajqoig pup s3}daquo) Ispg) | - SulmwesZ01g 1edUl] Zsaidey 1 Buywures30%§ 220UN 6 S Es EX El ‘gr WoNDag ayy UY asanbanpas YO Jo suoneru upew ap arereuM (©) dsonbqaypey YO. 2095 stent woneoydde afew a4y | a1e TEA ojo uonnqusip eatsdyd uauraBeuwus polord ‘eoueuy ‘oneuodsiren ‘woupnpoid — se yons seare yeuopsuns stopea wy suaqord Buajos 40) pasn 9q wes yorym sporRaus aaneyuENb yusrayip Jo WOND—T|OD © S| YO swaiqoid an 0 suonnjos umuindo yma suonerado jo jonuos up asoyp apracid 0} se os suzays4s jo suonezedo ruypat ‘sporyauu a1gmua}os Jo uonoNddE rs0dO,, $1 0 ‘worsap 12 jonEMS we[gord sno1zes 19pun s(eap ypsvosor suoneiadg vsuy apreacoy suonendo euyag #SNOLLSIND AYOSHL 8 8 Viput’s™ operations Research (2M) ree 10 Production scheduling decisions: If a number of jobs are to be performed on a number of machines, the production schedule heeds to be optimized to maximize profit or minimize cost or time. ‘Another form of production scheduling problem is to meet seasonal or fluctuating demand. This may involve use of overtime or extra capacity during peak demand. Production distribution problems: Different products could be manufactured at different plants at different costs and could be sold at different prices, Hence optimal allocation of production and distribution centres is to be determined. (8) Management applications: () Portfolio selection: Investment related decisions regarding selection of specific investments from a wide availability of choices needs to be finalized. The risk and returns associated with each alternative could be different. Media selection: To decide optimal media mix for execution of advertising strategy. This helps in making optimal use of the advertising budget. Travellnig salesman problem: ‘To find the shortest route for a salesman who wants to cover a number of cities without visiting any city twice. Staffing problem: To find work schedule for places like restaurants, police stations, etc where need for staff may vary throughout the day (peak hours and non peak hours). To minimize total number of employees. (C) Miscellaneous applications: @ @ 2 @ @ the (@) Airline routing: To make best use of aircrafts and crews, schedule of airlines should be planned in such a way that the crews and equipments get a desired minimum rest or lay-over time and at the same time flight schedule for ‘to & fro’ flights is optimized. (2) Diet problem: The objective is to satisfy the minimun: nutvition requirements of humans or animals at minimum cost of di + (3). Farm planning: In farming, there will be restrictions on availability ‘of resources such as land, labour hours, working capital ete. At the same time, it may be possible to grow a number of crops on the available land where revenue potential and cost for each crop is different. Hence, we have to make decisions regarding optimal mix of crops, Unear Programming «1 were Pry TERMINOLOGY OF LINEAR PROGRAMMING: Decision variables: Decision variables are entities (e.g., products, services, etc.) whose values are to be determined from the solution. ‘An optimal solution is the one for which the values of individual Variables are such that total profit is maximum or total cost is minimum, ‘The decision variables consume resources. It means they compete against each other for sharing the available limited resources. Notation used for decision variables is X1, Xz; Xsyovo @tC: Hence, if a company manufactures three products — televisions, refrigerators and washing machines, then: X1 = no. of units of television sets. X= no. of units of refrigerators. X= no. of units of washing machines. The decision variables have a ‘linear’ relationship among themselves and with available resources. Linearity means if resources are increased by 100%, then production will increase by 100% and hence profit will increase by 100%. Objective function: It specifies the objective of finding the solution to the stated problem and it is expressed in terms of decisicr variables, The objective of the solution could be maximization of profit or revenue or sales, or minimization of cost or time. (Max. Z or Min. Z) Coefficients of decision variables in the objective function represent the profit per unit or cost per unit for each decision variable, 2.3 o @ ‘In the above example: If Profit/ T.V.= Rs. 2,000 Refrigerator = Rs. 3,000 Washing machine = Rs. 1,500 Then, objective function will be “Max. Z = 2000X; + 3000 Xa + 1500 Xs straints are the restrictions or limitations imposed (3) Constraint on the problem. Constraints are of three types: (@ Less than or equal to (S) Gi) Grea equal to (2) ‘are smoy smoge] OFZ PUR sINOY aURpeUI OOE “MUO e UI -—P: axe sinoy anogey g] pue ssnoy ounppeuE g% “q JNpord amyeymveur of ‘pasmba aie smoy snoge| ¢z pur simoy auRpeUr ¢] “y 30 WM duo sunpemmue oy “g Pee Y spnposd omy sampeUeU 410120) ¥ ap ajdurexg, suratqord XNA Pnporg (¥) ‘STAN VXI squpensuos aenusiog ¢€) uopouny aanzalgo anim (@ ‘sajqenea worstoap AUP (D) ssdaig idd1JONOLWINWUOS = T 02 RRR oes ELO+ EE EST OSES ®XSL + Exe + IXE OOTS GO + EXST + xz “squtesisuo2 03 al 2xongt + *x000E + kO00T= ZEW aquow /sounpeur Zurysem jo-oN = “yrwour/sioyera8uyar jo-oN = & aNUOU /sy95 UO}AgIA Jo SHUN Jo-ON= 1x uonemuazos ajapdu09 ayy °S ‘o18z 40 aamisod aq wes] aATeBou aq jouLleD sounpeu duysem pur sxoyrs8uyar “Ay Jo uogonpord ayy, ze xx auiensuos AnaneBau-uon (6) 0008 5 xSZ10 + xh + XSL sy20a (2) OSES GT +z + IE "ytd (2) sny 9001 = Gmiqepea umuneyy sry 2xg79 aureus Surysem Jo syrun &x 20) /souapy ‘papaau ase sxy cp SuTIpeUT Burysem jo UM 1 105 -sny 2xG"] soy s08uf02 Jo synm are any g'f s0ye20813j02 Jo RM | JOp . ‘Sy XZ AL nop] “papaou ase Sm Z “A'L JO. MUN T Jos muoneuridxg OOO 5 &XxS°0 + BxG'L + IX YN Joy :sjurensuod y ‘@UAHT “pay uaa st 995‘AL akou, CATE 105 turensuo> kddns 1 94 1 gop juauraamnbar Sy BW TAL 39) waa S SW IN MW 40} ype auUO ‘SuENSUOD Apedes ¢ aq [TIA AIL ea oH] =H | SH >| cooe | oost_| o00r /W3unsem ¥ [oe pet TOTTI e [| @ mL w | Ww jug/sasanORT eet wuz0g S42. UT Be JO WOISTOAUOD, “314 000€ “amy 00St S34 000K SSW ZHU HX UO sxnoY Jo ATIGeTeAL AT UOY yuo sty ¢0 pue ALO smoy ¢"1 “Py Uo smoy 69 sostNbax ouryoeUT BuTYseM JO NM 3UO “3 Co sxy f pur smoy ¢"t sasmbar 20127081 ya jo anu 2 “SALUO sy S11 pur yy Wo sinoy ¢ “WA UO smoy z.sexnbaz “A“J JOIRM UO -souryouur Surysea pure 10}0108 12493 4) pash are YA A pUe ZY “YA souRpPeut vajcuiexa anoge a UT ‘3a BA UO sunoY Z WAU ppMpord & JO Ui AHA pareposse oaqenba (| 7 BB (sa) vaseasey suone290 SAE eae aomnosox umuUnxeyy a Viput’s™ operations Research (BMS) ue hapeaenitast ree 1s Solution: Solutios ‘Tabular Form Decision variables: . Tesway | Resourcesfanit_| tr Eo. of units of A Machine] Labour x2 =e. of units of B A as [25 xy = No. of units of C 7 25 7 Objective Function: Availability] 900 His | 240 Hrs Since profit per unit is given, objective function is maximization. 7 Max. Z = 5x1 + 3xz + 4x3 ‘There will be two constraints. One for machine hours availability and aie for labour hours availability. For F: Decision variables: 20x; 30% 80 X; = number of units of A manufactured per month, (For A, Pis not requized) Xz = number of units of B manufactured per month. For Q: The objective function: 20x1 + 30x + 20x35 100 Max. Z = 50x1-+ 40x2 : For R: Subject to Constraints: 50x) +40x3 = 150 For machine hours: (for B, Ris not required) 15Xi+25x: = 300 : Xu Xn Xs 20 For labour hours: {B) Portfolio Selection (Investment decisions) 25X:+1.5x, <240 Example 3: ‘An investor is considering investing in two securities ‘A’ and risk and return associated with these securities is different. Y. The Non-negativity: xx 20 Example 2: Security ‘A’ gives a return of 9% and has a risk factor of 5 on a scale we. of zero to 10. Security ’B’ gives return of 15% but has risk factor of 8. ‘A company produces three products A, B, C. 7 fed ; edie Fiore seek ' Total amount to be invested is €5,00,000. Total minimum returns on Se eae | the investment should be 12%, Maximum combined risk should not be Profit per unit: | more than 6. A-Rs.5,B-Rs.3, C= Rs. 4, | Formulate as LPP. Resource requirements/ unit: : | Solution: K Decision Variables: X = Amount invested in Security A a Xo = Amount invested in Security B 7 Objective Function: Lo. ad ‘The objective is to maximize the return on total investment, aseernian Fa eater Max Z = 01.09 Xi + 0.15 Xa (9% =0.09, 15% = 0.15) P - 80 units, Q- 100 units, R - 150.units. Formulate a, LPP. ecbaatatar | Investment: 5,00,000 (D_ Related t XX: Oe RX K 00g x FOr + KG O00 = xP +mxg + xOT vepnd Py Sts OOLS Ext yodedsmany 10) geixy or x “AL 295 -squpesysuos Sukydunrs :10N oz KKK Ge8pnq py)“ o00'000'0% 5 ® OON‘OF + % O00‘ + ' 0OO‘00z (aadedsman 207) “0000001 =< 000'0F (AL403) "* Q00'000'0L = 000/000 :spupensuo9 01 390/qng © 000'007 + * 000'0001 + *x 000'000Z = Z XEN (uypeas azine) suonsuns aan2aleo ope sodedsmanjo sum jo oN = “spe orpey jo stunjo-on = % Spt “A°L Jo sin JOON = sso[qenre, us montijos or'60z ‘000% wodedsmon ‘000'0001 0008 orpey .000'0002 o00'00z “WL ‘GproWEsNOY ;0-OND co auungad ysesy | spun gad 3509 wap 101, 'SDey OO'OL “sy ey az0UI aq ou “AL yBnonp paypeas aq 0} are spjoyssnoy oo0‘000'OT tam {509 quaxayyIp pur TeF sey ummpour yeq xodedsmony 7p orpey “A"| 228 UOHEIEp! wrpay ustedures pe ue youn] 0} Sunuueyd sf Aoua8e Busniape uy ss adwexg MOHDETS IPI (9) o< KX ooo'o0s.zt = OT + {ooo'o001) $zt = * ex0z + +. (sumer uy) 1 © 1 Buyuswestosg seoun (isu xe) 010009 = XB + Hh (000'0001) 9 = xg +h o00'002 = x © (puny arSurs e ur Fi quaounsoauy umUspeyy) 00004 = xk @ (Gquaurjsenut e105) 000'000t = xe ssyupensuo> 01 7alang XTO+XGLO= ZEN suopouy 2an2af4o a pemy we-sy uF OURSOAT = =X y pumy ut “sy ur uaunsaaup= 1X. ssayqeuzea oss EE SL0= 92 were) ezt= aigesojog wenuuarey | sumVOY MUM @ e0= me a © sro= 4ST Vv Tai5ep FART Su puns a UWHIOJ eINGeL smopmnjog sda se ayenur0g “KEYSTY “AL 105 9 81 101985 YSU aqquse[oy ume. PUR %EZT axe SuIDX passa UME, oa {0} ple FEY 10} ‘210 GT-O Jo AILS € UO sBuNex s0}>ey SHE BUL “ed 9607 JO Susrgas Said g puny -y ‘ed acy Jo suumar sar y pung “puny ours e UT [paysaauy aq qT 000°00L “SY EYP 210ur 1Ou PUP OOO‘OOOL ‘Sy Sf IuaUNSOAUE Trio} SIpY “a 2 VY SPUN jeryMT omy UI yoAUT O} SIUM ALYY “WC : sp ajdurexa oexXx sAyrageBau- oN (F) 000/09 < *XSTO+™ 600. {o00'00's * ZrO] < *X STO + 'x 600 :sUIMaY 0} PETA 000'00'0E 5 *X8 + "XS [o00‘00's « 9] > *x8 + *XS piRLer power ame -. ov ) (sina) yose9s0y su0983900 yy a8 ‘Vipul’s™ operations Research (M5) Example 6: ‘M/s, NMK Enterprises wish to launch an advertising campaign targeted at two sets of target audiences ~ Monthly income = Rs. 25,000 and Monthly income < Rs. 25,000. Total adv. budget is Rs. 500,000. The company plans to use two media~T.V. and Radio. Cost per advertisement is Rs. 100,000 for T.V. and Rs, 40,000 for Radio, Minimum 4 T.V. ads should be shown whereas upper limit for Radio ad is 6. Reach per ad is as below: "T tncome = 25,000_| Income < 25,000 TN | 450,000 150,000 Radio | 126,000 180,000, Formulate as LPP to maximize reach for total number of target audience. Solution: Since the objective is to maximize total number of target audience and not a particular income group, we can ignore two separate income groups and find total reach of one T.V. and Radio ad. Reach/T.V. ad = 450,000 + 50,000 = 500,000 Reach/Radio ad = 120,000 + 180,000 = 300,000 Decision variables: x: = No. of TLV. ads. x2 = No. of Radio ads. Objective function: Max. Z = 500,000 xi + 300,000 x2 Subject to constraints: 100,000 x1 + 40,000 x2 < 500,000... (Ad. budget) x 24 -+- (Min. T.V. ads) x 56 (Max. Radio ads) xx 20 (D) Diet Problem: Example 7: Vitamins By and By are found in two foods Fi and Pa. 1 unit of Fr contains 3 units of By and 4 units of Bz. 1 unit of P: contains 5 units of By and 3 units of Ba Minimum daily prescribed consumption of By & Bz is 50 and 60 units respectively Cost per unit of F; & Fz is Rs. 6 & Rs. 3 respectively. Formulate as LPP. nest Prograrnmine=1 » Solution: ‘TabulanForm [Vitamins Foods Minimum oR Er Consumption a 3s % @ j 3 @ Decision variables’ x1 = No. of units of Fy per day. x2 = No, of units of F2 per day. Objective function: (Minimise Cost) Min. Z = 6x1 + 3x2 Subject to constraints: (Min. supply of Bi) ax) + 5x2 = 50 axi+3x2 = 60 (Min. supply of Bs) myx BO Note: F; & F; are decision variables and not Bi & Bz because cost is associated with Fi & Fa E Example & “Two autrients Ni & Ne are recommended for athletes which are available in two products P; &,P2. Minimum daily intake for 1<: & Nz is 30 and 40 units respectively Cost for 1 unit for Pi & P2 is Rs. 100 & Rs- 180 respectively 1 unit of Pr contains 3 units of Ni and 5 units of Nz 7 unit of P> contains 5 units of Ni and 7 units of No Formulate ‘as LPP. Solution: Tabular Form Products, "Nutrients Pi Pe rt EE # L 5 | 40. ‘Minimum Intake Decision variables: x= No. of units of Ps per day. xo = No. of units of P2 per day. Objective function: Min, Z = 100%, + 1502 Subject to constraints: 3x14 5x2 = 30 (for Ny) algo sofeur auo Ayuo sanzoaur urayqord ay ¢%) WUEISUOD aL SIOIE; [PUIBIXA [TW (€). -“sasmnoso1 Jo uoRduunsuoo s1 08 ‘suonsey Aue ut ayqissod st sjonpoxd paysiuy fo uonanporg (z) “Aqure}i29 ui pur Apex UmoUY s} SaoInose WO3} ayun sad uondumsuos pure sesmosar jo sonnuenb aiqeeay (1) "uy suondumnssy (@) uoneool|e aomosex pauyuEANs (¢) “Bupjeur vorspap syns (Z) mpord Jo s10}9"5 Jo asnIUOPYJA (1) 'd'1 50 safequeapy (Vy) ISNOILVAIINNT ® SNOLLAWNSSY ‘SADVINVAGY = _S'z OS KKK Gmoyreur sey) 0000 = OL + x1 + xOT (puey pero) os Kae 4K sshutemsuoa 01 1>a/qng 0086 + 2x OZER + KOORL= ZX ex ong sx ace. 00h. eayong OD OF SED OF ® (00 OF +1509 an0ge7 (00D T =x (002) 1 x (002) 909 707111304 o (0002) | x fo009) er _| (0008) z <= onuanay Zz x x 07 palqng 2x 0008 +X 000F = Z "XPT uopauryy 2020/40 neiado soON = °x tg yo suoneiedo j0-ON = 1x ssa1qeyrea woIsPaC, jos. ‘syum 00z - xR Ee sim ooe - Xsaunyosesyx0y pueurop amu ‘situ OOF - aepep sagun gos - Vapery so apni jo Ayiqereae wnETNEH, 000'S Sa- Fd) Z S801, 000% SU- (td) 1 Ss9001d suopeaado sad yyorg s T s 9 s 4d ¥ 9 ta aepaa | VepAD Ge SPR) AUT, a "ae Sdar1 sv ayeULIO, “sassapord Sutpua|q mwa geurydo, 6) suem Auvduios po ue ye saSeueur y oxy jo xpa eundo pug cee amaqqorg Supuata (a) oz &% N49) oF = BL +S {swa) yosessay svonciado ys mesA, | 8 cd 2 rr Viput’e™ Operations Research (MS) (©) Limitations of LP: (2) Linearity is necessary in objective function and constraints. Q) If there are multiple objectives to be achieved, LP cannot be used. (3) All costs and benefits related to the problem may not be quantifiable (4) Economy of scale and learning curve effect cannot be incorporated in LP. 2.6 SOLVED PROBLEMS: Example 11: (MU, Oct. 2006) Suzan and Co. manufactures two items X and Xz. It purchases raw materials which are then processed on three machines. The 2er unit cost of the raw material of items X: and X are Rs. 2 and Ps. 3 respectively. These items are sold in market at Rs. 5 and Rs. 6 per unit respectively. ‘The running cost for these processing machines are Rs. 20, Rs. 14 and Rs. 17.50 per hour respectively. The capacities of machines are given below: Tiems X_| items Xp 35/he | 40/hr 2e/he | 35/he s/n | 25/he jon ava Linear Programming Pro Solution: Capacities are given on per hour basis. Hence, x1 = No. of units of X: produced /hr Profit/unit of X: Profit/ unit of X Fixed cost/hr for machines Objective function: = No. of units of X2 produced/hr = Rs. 5—Rs.2=Rs.3 =Rs.6-Rs.3=Rs.3 = 20+ 14+17.50=Rs, 51.50 Max.Z = 3xi +3x2—5150 Where -> Z__ = Total profit per hour Subject to constraints: In.this problem constraints are indirectly specified. rere 23 Linear Programming - G) eg. for Machine A, hourly capacity is 25 units of Xi OR 40 units of Xe . ~~ fer product = for Product %— [Production | Used Capacity |~ Production | Used Capacity Buns | T [a0 units T 1 unit 125 [1 unit 1/40 Xi units Xi 7/25._| Xs units Xa 7/40 But total capacity used for Xi and Xz cannot exceed actual capacity 7 XT XT 5 +40 ST 8X14 5X. = 200 --- Simplifying Similarly, constraints for Machine B & C are: (2) 5X1 + 4X < 140 for B (3) 5X1 + 7X S175 for C XX =0 .. Non-negativity Example 12: A firm assembles and sells two products P, and P2 Two assembly ‘operations are performed. Capacities are as below: Operation 1: 200 units/day of P: OR 300 units/day of Pa Operation 2: 100 units/day of P) OR 200 units/day of Pz Profit per unit: P;: Rs.10, Pi: Rs. 6 Formulate as LPP. Solution: x: =No. of units of Pi/day xz = No. of units of Pa/day Max. Z = 10x) + 6x2 Subject to constraints: 3x1 +2xr S$ 600 Operation 1 2xi+x2 S200 s+. Operation 2 nim 20 TET -ys0o aznunnune 0} {aT se ayejnuss04 2 Josmnun gp 9 1A Jo stun of +2 tq yo sium ofp tA JjosnmME = raue Gy 29 ty Jo num sad ayqeyeae sunueyia Jo AyueNd “Ajaatredsax 0g “SH pue OZ “Sy St Ty pue Ty soy yruN ad ys05 Ty pur ty spoo; omy “ur punoj aze surweyta oy “ep sod sun og pur gg Jo QHueNb umurrutut ul sympe Stmok soy papuounnorar xe ZA pure TA suTUTEHA OMI so ajduuexg oz KK toy oor = xP + Ix9 V30p 0g = xg EK ‘Syupensuod 0) 329/qng ixg+IxOL= Z “UN tayo sun jo-on= & myovoN= x or a 3 a 8 3 ¥ viteeet qau=nTRb Sy erm a ‘a wweHnAN WOE Te RGEL suonIOS : +3009 oznurrurun 03 dd’] se ayemunog “Ajaanoadsax g ‘sy PUL OT “Sy St Fg 2 fq 10) UM Jed 380 'g Jo symm F pue Y jo simm g suTeIUOD zg JO MM UG “Gg Jo SHUN 9 PUP Y Jo Sif y SUEHUOD 1 Jo ILM BuO “a =P ¥ UlEHUOD 7q 29 'q sjnpord omy, “Afaansadsaz sinun QQT 29 08 St € 29 Jo juoWarInbar Kep wmUMTUTYL s[ewunTe wre; 0} siseq Arep Uo uaars aq 0} are gq 27 Y SON se aydurexg Oz KKK wa" oS &g +01 Ox OS Mp + tMy + xg Canuee ODS xO FE ssquyenstia> 0 12alqng eg HOT + Os Z-XCW 730 STUN JOON =. AJOsHIN jO-ON = 7% Jo sIRUN jo-ON= 1K sMopnjos se 6.58 {- BuyawesBoug se9un “ga se oyeprmasiog ‘9° SAX yun sad yyord ‘syrum og 2 ‘SHUM OZ 'D ‘SHUM OL ed 1 euronews ner jo AnTqeIpene UINETKEYA gz Or" ("ae ¥ 9 Zz | on ¥ - x = 9 é x u 3 a SEBO APU senpord et grm Jed yuaureamber aainosay aD ‘Awe Me ‘gang sasn 3 wien soy “ZA ’X SPHpord 2anp saonpord Aueduto V. spt epdurexg, ox x sxnoy moqe OS CHG sioy eURPER ool G+ IXE ssyurexsio> 03 3901485 xg + XO ZW sjaaon sod paonpord O jo situ jo"ON = sjoam rod poonposd ¢ Jo sitm Jo"oN =X oF OL. E s ¥ € aaanoqe1 | SH SUNPEN uysoamnosoy wmpord WHOL TMGEL ruopnjog “da se ayenusi0g “Sjasoadsor OL 29 091 St (Fear 0d) smoy mogey 79 siNoy auNYpeU Jo AaETEAY Gfoansodsar § “S29 OL “SH st O 7 4 sof uN sod yyory “paxmnbsr gue sirioy moger ¢ pue smoy aumpeur g ‘O JO uM suo smny>emMuELT Oy pasmbar axe sinoy snoqel F pur sinoy auRPeUT ¢ ‘d JO INT guo sunyreynuous of, ‘D pUB-d Slnpord omy samyemuTus 420198) V seraqdurexa, (svia) uoseasoy suonesodo SEAL . we 2 vee Viput’s™ operations Research (8S) | Lneur Programming -t anne i (3) 0.2%; + 0.22 + O-txs + 0.09% = 0.12 x (200,000) ... Rettarns ERE te tabalae eon | 0.21 + 0.282 + 0.1x3 + 0.08% = 240000... Returns Vitarnins Foods | ei ar 7 « = Example 18: 7 o o ‘An advertising agency wants to prepare media mix to launch - advertising campaign of a FMCG product. Three Media are under j Bi tr Notef tanilt of Fs consideration - T.V., Radio & Newspaper. Available data regarding xz = No, of units of Fa | reach and cost of each media is as below: Min. Z = 20x: + 30x2 t 7 [7 Medium ‘Cost/unit Reach/unit Subject to constraints: TN. Rs. 200,000 1000'000 households 5x1 + 10x. = 60 for Vi : Radio Rs. 50,000 300,000 households 10x + 15x: = 80 wu for Vo Newspaper Rs._15,000 50,000 households xx 20 Total advertising budget is Rs. 100,000. ! Minimum 500,000 households should be reached through Radio alone. Expenditure on T.V. should not be more than Rs. 600,000. PP to maximize reach. Example 17: Four investment 0; retirement funds. Fils pr ns are available for Mr. X to invest his iples for inv Formulate (@) Maximum total risk of 2 on a se Solution: @) Minimum return on investment of 12%. xy = No. of units of LV. Investment options: xz =No. of units of Radio Investment | Return on | Risk factor x1 = No. of units of Newspaper investment Max. Z_ = 1000,000 x; + 300,000 x: + 50,000 x3 Equity 20% 5 i Subject to constraints: helene eee ete i 200,000 x, + 50,000 x2 15,0003 = 1000,000 need mt ; su Adv. budget he _ 2 300,000 x2 = 500,000 Formulate as LPP to maximize return on investment. Total funds available for investment = Rs. 20 lacs, s+» Min, reach through Radio 200,000: = 600,000 Solution: x. expenditun Ve x: = Amount invested in Equity. aE “ ‘penditure on T.V. x: = Amount invested in Real Estate: : ite Xa xs BO. 3 = Amount invested in Bank t Example 19: : ea a tae oa NSC. foe ‘A.company produces two products P and Q. Profit per unit for P and pe eee pe t Qis Rs, 400 and Rs. 300 respectively. Both the products are processed on Max. Z = 0.2x1 + 0.2x2 + 0.13 + 0.09% Subject to constraints: M) tet tx = 200,000 To (2) Sxy + xz ~ x3 + xe + 2x (200,000) ... Risk ng maximum capacity of 30,000 machine hours. ¢ for P and Q is estimated at 80 and 120 units ine unit of P, 300 machine hours are required. For one hine hours are required. For one unit of Q, 100 machine Formulate as LPP to maximize total profit. funds ‘von ay uoqeziam somos 4 ana syqteod seo Spy ou suvods aera 1 enbe 30 een “enon 2 ue nea, 57 j ssomnonss var y0 kyoede vatps oo oe 40) woasS st yun sad syoud jt 7 xe st Ja] ¥ 30 UORSUNy aanoal ap jo uss avg “uaa L(uojssaude pwoprrnuoy yp JwopDuIM Q NoRdrosep jwqusa 943 Suszs2au09-u4 sidj24 37 sroypej uorstpap Buoure drysuone: s[epour euros Upras 3106 09 sayo2d sioqeur-uoTsD9q uojssaidxa jpaRRUIAAELT OF wep fespaumu 2p uondyosap jeqiea at Sunsoauos uy sdjoy oo Aouepumpay (rH) ayaeHeA uoIsIOg (er Hdy) “worqord amp Ka pasodurt suoreynTy a Jo uopenbs jeoneurayyeur syussord: ‘Supunueifox ep soea8 30 uAA $597 ( quTeNsUO> ,0} jenba 10 8] 995n/0502 © jo Apedes umunxeur soyads yorym jureysuos yo addy a 0) wey 1298915) “dal Mp to pasodn sto! saiqene, worsioaq 2 50 suzien ut passaudya st uoRDuny 241 3500 Aqunizoddo, sjurensuo3 saiqene, vorspeq (1) worsuny-aan2lGQ, “dat atn Buaj0s Jo jw08 30 aansalgo arp sayraeds sis09 Anrumsoddo swurensue> GH) sageueA “vorsDaq GH) ORIN} aAH201G0 {de O48 Jo ORMIOS ous wou} pouMsID}9p 9q OF Oe SanfeA asoyM sORNUE ay Te © :moTRq uaAi8 sprom ayeycdordde spy suey amp ETT sz RAR w #SNOILSAND 3AILIa‘GO. 1 Sujwwestioug se8un, oz x + ose BEHOS gsz , 0St Tea dous rounpert x03 Aawpunos 305 006 5S +6 cat, 008 rs Si ssjurensuoo or alans zxo0z + OOF = -Z XP “PROWL JO sinin Joe = jePOW TAVJO siRUM JO"ON = AWORNTOS -qyord azpurpxeut 0} 4a1 Se vEMNUIOS BN OS, ‘sifu OBI aw oO x0 yun ot sau 001 doug ouPEW ‘aepunog PPOW ‘aie Sonpedep ouN|PeU OUT, “kyaaadsar 00z ‘Sa PUP OOF ‘Sa AL PUP AL oy ypu aad wyorg de loug aunpepy pur Axepunog tt passeooad axe sjepour ‘aumypeut Jo s|apour O23 seanpaad Atreduod y aun wpog WW PuE tea oz ix D293 puewop xe ots x {soy PUeMIOP “XLT” as % smoy aunypey coo'oe = =00T + *x00E :squensuos 03 192/4NS exo + xCOv = Z XE Dyosmmjo-oN= *& “oer 08 BUNS SUPE puewisp wnUIPEAL wirog TeINGEL (Ga) yoveasoy suone!9d0 iS IAEA AB aopnyos az 30 re Vipul’s™ Operations Research (BMS) fe) Ina LPP, Decision Variables are always assumed to relationship with Resources. (A linear programming model consists of only decision variables and constraints. (Oct. 19) tans. (a False); (b ~ True) (e~ False); (d~ True); (e~ Trueh f~ Pals) (@)_Mateh the following: Group *A’ Maximum capacity (©) Minimum requirement (©) Linear relationship of variables | ave a linear “Group 8 Min. Z Less than or equ mote than or equal to constraint constraint @) Profit data Gy) LPP (©) Cost data 7 (w)_Max.Z a TAs. (a =i); (b~ iii); (eto) (d— W); Ce D1 THEORY QUESTIONS: ) Explain the concept of linearity in linear programming. ‘Ans: in LPP, it is’assumed that the production or output is directly proportional to availability of resources or input: Mathematica!’ we can sy that Y = £00) ie. ¥ (output) is a linear function of X Ginput)Y lependent variable and X is the independent variabl If we represent this equation on a graph showing output at v% input, the result will be a straight line. ‘Y (Output) levels of (Resources) In other words, the output will increase or decrease in the same proportion of increase or decrease of resources, ie, if resources are increased by 50%, output increase by 50%. (2) Explain what is meant by. decision variables, objective function and constraints in linear programming. Ans: Decision variables: Decision variables are entities (e.g. products) whose values or quantity is to be determined from the solution of the LPP. Hence, these are the unknowns ir the problem. Decision variables are represented by X1, X2 ete. ft t Linear Programming -! ror aL Objective function: It specifies the objective of finding the solution ic, ion of cost (Min. Z). The value of is denoted by ‘Z’ mnstraints are the restrictions or limitations imposed on the problem. C scan be elated with availability of resources, supply or demand conditions etc. There are three tye of constraints ~ Less than or equal to (=) Greater than or equal to (=) Equal to (=) @)- What are limitations of linear programming? ‘Ans: Limitations of LP are: Linear relationship is necessary in objective function as weil asin constraints LP cannot be used to solvea problem having multiple objectives Qualitative factors cannot be incorporated in the formulation of LP. Economy of scale and learning curve effect cannot be incorporated in LP. (4) What are the different types of constraints in linear programming? Ans.: In LP, there are three types of constraints: to (5) nt represents the maximum capacity of a resource or lity of @ resource or ind for X1 is 100 units is represented as: XI = 100 or equal to (=) represents the minimum consumption of a resource oF n variable; e.g, minimum utilization or consumption of a resource of minimum supply of a product. The value of LHS (left hand side) of the constraint can be equal to or more than the prescribed limit in the RHS. e.g, Minimum supply of X2 shouild be 200 units is represented as: X2 = 200 (©) Equal ‘This type of constraint represents an exact equality. The value of LHS should be exactly equal to the value of RHS. Here there is no maximum or minimum limit, The variable/s on the LS can take only one exact value which is equal to the limit given in the RH e.g, Daily production of product X3 is 500 units is represented as: X3 = 500 EXERCISE: wo An inves! identify how much to invest in two funds, one equity al amount available is Rs. 500,000, Not more than bbe invested in-a single fund. Returns expected are - 30% debt. Minimum return on total investment should be PP, uaunso Aun uo wnyar a7quspeue OF ger Se ayEMLUIOS ‘SST SEE OTquanoTTe ue (P) “seST tumTutur aq pmoys summar pazyennuy ©) ‘qupicmagsuy afSurs & ul paiszaut 2q 0} %OF MELA aZOULION ”¢a) “MONTE I “yj = uBUNSaAUE IO} B}qEHEAW spun TOL (2) pau T ‘Or 9 woe 4 ist COT as FRET | Wausaau wo ume | WwoUMASUT ‘are ajqeueat suondo eaaia>. ureyaD uo paseq ofosied quaunsaaur sry aznundo 04 jue JOIS9AU! UY (OT) ‘pureaq posnZOApe ayy Jo Yeas azTLATKCUE OF der ST SM St Bpnq Teo] “A'L UO quad Tq ueip zou pupds 6} you pur ‘se ayejmunsog “YONA, ‘ynonn sployesnoHy “Q00'0OSL 18821 1¥ y>eay o} SF UOHDNSAY ay 0000S AT SPIOUSSHOH 000 00Z oper oo0'sz “a sprowesnors 000/001 wud 00/001 “st Spjotfesnor 000/005 eeeerAe aRENABOD TaN AED SREP "ys00 7m ‘1 0s 4uaxayp st Tenuajod y>ees sioys, “ompey PUE IMIG “AGL - pueiq mou B aspiaape o1 saBeuey SuBayeW v Joy SuNdo argeteae samy av ay, “06 “94 St Bag JO PUP Oz awe g. ©) 60 vanusturus ye squsurazmbos oy ApSHeS Of JT] $e AEINIOG ue y 20 syuowrast (dy Jo stun sod ys03 -yseo WS 1ecy ‘a Jo WE Z pure VY Jo WS T sus Jo 18m 9uG -g JO WB T pue V Jo WR Z supsquos eudy Jo IRM ay 1 PUY Sumutejen ureyBO9 Yorn eon = siseq ee ep uo sywauraddns BG | Se UaAKS aq 0) axe g PUL fey sinposd omy are azayy.“stu9pNys OF ysunueyiaomi (8) 1 -Auuuertoig seu “det Se BVETAUIIOT eee ee ae re ere re Sots x0 ay/siran 09 aH /SIRM OS d Tr uReedo THoHe=dO) weapon “aoe won 5 genes somos Due esos siosoxg “OF 8 “D104 Pue O8 “RT - d 20} St UM zad org “pawiopied axe FERN Mh aemhornctur sony pate qavmpord on o Su PeTUC UT jord oxy o ameodxs aziuspeeus 0} "1 S® ate|RULES “000'O0E A er aSipng pe (eo, 000'007 “HE WENA S10 24.20% POS AJ. UO ampuEdeA, Tid uBnonp payseax aq PIOYS sPIOYsnoy VOTH € SE IV -yumn tad spyoyesnoy G1 st o1pey Wid J PE sployssnoy OHTA OZ St “AL JO MPR val 5 Olen J 403 PUE QOO'OS “RI $1 “AL 40} NM sad 3S0D “OIPEH 29 “AL “Wipou Ow PayNUEP! ener, Yt Guade Bursnionpe ue papeordde sey dureduse> sonpoad sevansu0 y 3800 1saM0T se ayernomoa, ‘aun we pamgiry 29 we quowsanimbar warm We YRS JIT $e BET 309 OS1 "SY PUL 1a 20} ODE “FU SEAT 32d 3805 7N jo 87 pur ty o 8; sumqua9 24 Jo 190M UO NJ Be puR IN Jo Sz supeaOD Ha jo num aug tq pue tq sonposd oon Wi aqetfeae axe sion 98H, fepArana epg 20) wi8 SE pUC IN; 10) WS OT $f HEY EMU, sdepGiond SN pee IN SUBLIME owl papuauRoDes UoDq Fey IHOREM V “gel $2 AIP IMUION run ogi 3 dousLIOM, nm goz Tt doystioM :mopoq waai@ se axe sonppedeo doysyiomy 4 1 @ pur Vy 10) yequatod word “A V. ~sjonioedsos-wyun sod og pue OL “SY 518 PUP V 105 1 Sonipord ox uisnpoid £09 pasn aq ue yrs sdoyson ow sey OWE] “ger SP aveIMUTIO ‘ay. sinM OL YO. jo sinm gzt YO V 3° ‘eanoy 2n0921 ST sinoy supe ot coe sino snoge sanou ange goeg fsmoy ape Smoy suRPeW OZ x Kauaerteay asinosey quoutosinboyt 9m0sy PAPO Aso ost na Pus Joy opt a ssn sed yyoud A Sumo poxd 15 yu Us AHL POA aoe eran og eamusTuN “A Pub x sioner tt SOONPOAA wa UUs ae 2% P (q sionpord ony sammpesnueur Auedwoo Y O) w 34 Viput’s™ operations Research (BMS) Chapter 3 Linear Programming - Il (Graphical Method) ES 3.1 Introduction 3.2 Methodology of Graphical Method 3.3. Solved Problems 34 Special Cases in Linear Programming = Objective Questions = Concept Questions = Exercise ————e 3.1 INTRODUCTION: ‘There are two methods available to find optimal sol Programming Problem. One is graphical method aad Ae oth simplex method. Graphical method can be used only for a two variables problem ie. a problem which involves two decision variables. The two axes of the graph (X & Y axis) represent the two decision variables X: Xs, 3.2 METHODOLOGY OF GRAPHICAL METHOD: Step 1: Formulation of LPP (Linear Programming Problem) Example 1: ‘A company manufactures two products A and B. Both products are processed on two machines My & Ma, Linear Programming - I 3s My Ma a 6 Firs. /unit« 2 Firs/unit 4 Hrs./u 4 Hrs. Availat "7200 Firs. /mor 4000 Firs. /month Profit per unit for A is Rs. 100 and for B is RS. 80. Find out monthly B to maximize profit by gr wphical method. = No. of units of B/month = 100% + 80X2 Subject to constraints: 6X; 4X2 < 7200 2X 4X2 4000 20 Step 2 : Determination of each axis. Xe Horizontal (X) axis: Product A (%:) Product B 0%) 0) ia Fig. 31 es to represent constraint s1uTeN|stio> [Le AystIVs UoYBax apqISvay auf Jo s1aUI0D ayy Te 10 oLar ‘aqaiseay ey) Jo Atepunog aip uo 10 uor8ar o]qIsvy ap apysur sjuTod WV “sour woBoy a1q1Se9q Jo uoNRoIHUEP! :¢ dars ve Sty (002) _(o'o0z0) (o00r 5 *xy + xz) (o001'0) (ooze s *x» + *xe) (ooat'o) x oa des ay MON 000% > xt + xt (we ssap Aiqenbauy aug Ayspes [TEM aur] ap Mojaq quod $y 00ZL> EXP + x9 (wo Seah ssoj)-Anpenbour ap Ajsnes qe * aur] ay Mojaq juIod amt am) wo quod Lieaq ‘00% > Xb +149 urensuOD ap siuosoidax (002d = Kr + XS) “NY ooo (e080) (oogi’o) PUP (o'o0zT). syed “[rewss 00) aq jou pmoys uresSerp ay Jey YPNs aq PInoYs ares PUL (spe x) qwo6.= sim Oost (spe x), uD OT = Siu 000Z sinmooz= UPT SY “uno gz UT surequ0D 00g Jo onjva umnuurxeur ‘six X YoY Jey YORS soUT| IO aepouTUEOIe 0} poou am “UD o¢ x Og Heded ydes3 e savy am jeIp SuruMssy 00st = BX zy onjea xe 001 Pure QOgT & sompen Z aAvY am KX FOI 00 =X Aos antea KEL “0007 Pue QOZT < sanqea z aAvy am "NX 105 “sa)eups0-03 woyy 2x 2p x Jo angen vmnupeeun wo puadap TIM ayer OF OTS LRM, “oqwos ayersdozdde yoapas 0} paar am “ydes ax uo sjurod ayy EEE OL dvs uo sour quyexgsuos Supuasazday + dag Toor) PuE (O'OGG),_ ZONIHPASHOD @) (oogt‘o) Pur (ofooct) — :L-oNTHENSUOD —«D) :are squtod Jo seyeuyps0-09 Oy, -soury 7ySteRS ouay ‘siuexsuo> omy are ary, ‘ude ay '» Xq paniosaados aq [ft TUTEHSUOD PET (oor'o) = 'X ‘o00t =X 000r = XP : 0= x 391%X PU OL (o’0002) 0=*X “0002 = 'X * coor = xz : 0= 2X 391 "X PU OL oor = XP + IXEIT ON THTENSHOD “(0081'0) 2x8 sarvUTpI0-0> sy ‘OOUazy “OUST St 2X PUB OraZ Sf IX-AUMOd puODds 103 AITEHEUTIS (ozs) 2q qHim sayeurp10-oo sy} UPLB ‘0197 St 2x PUE OTT SF FX qIOd & 20} FE ‘aoulayy 2X Jo anjea usu PUR asxy WaHEM 5X JO aMTBA YL CX) dytinn ekume om ‘Tutod Kure Jo Sayeutpi0-09 omkse 2s UUM [ION (eve) wpasay suonei9d0 a RMA, BRE 9 ‘Viput’s™ Operations Research (8MS) ‘Seate: tem = 200 units (0,120) 4 (6K. + 4X, 5 7200) (0.1000) Feasible Region: OABC (2x, + 4X, 5 4000) (2000.0) ° (0.0) 1200.0) Fig. 3.5 Both the constraints are ‘less than or equal to’ () type. Hence, the feasible region should be inside both constraint lines. Hence, the feasible region is the polygon OABC. ‘O’ is the origin whose co-ordinates are (0,0). O,A.B and C are called vertices of the feasible region. Step 6: Finding the optimal solution ‘The optimal solution always lies at one of the vertices the feasible region. To find optimal solution: We use corner point method. We find co-ordinates ( for each vertex or corner point. From this we find 2’ va corner point Vertex Co-ordinates Ze 100Xi + 802 _| o X= 0,Xe=0 Ze = From Graph a Xi= 0, Xa= 1000 om Graph = 800, Xe = 6 From simultaneous equations € X= 1200,X%2=0 ______From Graph | Max. Z = Rs. 128,000 (At point B) For B -> Bis at the intersection of two constraint lines 6X. 7200 and 2x, + 4x2 = 4000. Hence, values of Xi and X2 at B sw both the equations. We have two equations and two unknowns, X1 and X: simultaneously: + corners of values) for each | oor 29 Uinear Programming OX + 4X = 7200 a) 2X1 + 4X2 = 4000 7 = Q) 4X, = 3200" .. Subtracting (2) from (1) x) = 800 Substituting value of X1 in equation (1), we get 4X2_= 2400 X= 600 = Solution: Optimal profit » Max. Z = Rs. 128,000 Product Mix X, = No. of units of A/month = 800 Xo_=No. of units of B/month = 600 180 profit line: 180 profit line is the line which passes through the point of optimal solution (Maximu:n profit). The slope of the iso-profit Jine depends on the objective function. in the above example, the objective function is: Max. Z = 100X1 + 80% How to find slope of iso-profit line: Equation of a straight line: y = mx +e lope of the straight line 5 Xe" and x means *X:". where, a In out case, y 0 ic means ‘2’ Xp =mX4Z Converting original objective function in this format: Z = 100X1+ BOX 80X2_ = Z-100%X) = 100%; + Z x Slope of ISO pro! Negative siyn indicates that the line will slope from left to right downwards. And slope will be 5/4. Every 4 unjts on X axis for 5 units on Y axis. Ow o=% =x © w= 1x9 7 0 = 8X 291K Puy OL ZL= XIE HKD sAayqenba ony Sunz00U0D, UL = XP + IXOT "ON IENSUOD (8r0) 0='x’8r=*% - I= 8xct = X91 PUG OL @®) 0=x'e=% o= Kee 0 =" 321 "x Puy OL 91 =. XL + Xez -Ayqenbo oju Supaaauio3 912 S EXCL XCEL" “Aqqenba ont way jEAUOD PInoys ayy ‘ed4y ,0 jenbo 10 wep JoWeaus, are syUIENSUOD TY ydes8 ayy uo sour quyeNsuod judsordax 0} sauT{ JUFEHSUOD Jo sayeUTpr0-09 SuIpUty i¢ daig ves % oo (@d) axmpory spre (x) wons9, (0 V Pmporg —_sspce (x) wRLOZUOHT a Spee ypea jo uoprrurunaieg dog oz xX"xX 00 = *x0z + 'xoF BS ITH IXD gle = XCEL + Xe squTensuos 0} 33a/qng "X08 + 'XOF= Z UUW 30D 18OL = Z @go.smun jo ON =. *X Wyosmm joon= 1 dd1 Se uoneinutog = daig -yuourastabaz jeuoyt yu Wunumm opraoid 0} uoAI8 9q 0} «139 V PApoId jo Apuenb no puny ‘0g “sal -A ‘OF “SY =Y - axe UM Jad js09 yONPorg w junwuesioig se9un ou oO OF € zu a z 91 a ue 1 qwouoambar a v_| TTaninweN | sw “gyuDLyAU porfnbar Sang ap WyEHIOD pny q pue y sonpord omy aze azul, cgaai3' 9g 0} aue stemmue ayy, “Suypsarq epkroao sjuauroiddns worn umue ut paeSuo st UE Vv z ajdurexg, ruonezrerRUTy -uonnjos peurndo au st q ‘sousry “aut yord ost ayp Aq parsesiay azruancear 0 yexp worSax aiqyseay ayy uo yurod Se} axp St 0 uroxy Aeme of pur utBio oxy wiI0y yey ‘goad ee Ba o' SS vopea 40} uoH=N (oozz = *xv + x9) (o' WI urn woss-osi A \oooav'0) mx souyy y1yord-OST YIM UOTINIOS oe Bt. eur moié-osi 10 dors —* eee A (sway ypseassy suoneiedo ysandsa, oo 0. - a BS id 42 ore Vipttt’s'™ operations Research (BMS) To find X, let X1 = 0 2X, =72 2X2=3,Xi=0 (03) (3) Constraint No. 3: 40X; + 20X2 = 200 Converting into equality: 40%: + 20%: = 200 To find X;, let X2 = 0 7 40x, = 200 Xi=5,%=0 (0) To find Xa, let Xi = 0 20X2_, = 200 X2=10,X:=0 (0,10) ‘The co-ordinates of points are: () Constraint No. 1: (3,0) & (0,18) 2) Constraint No. 2: (12,0) & (0,3) (3) Constraint No. 3: (5,0) & (0,10) Step 4: Representing constraint lines on graph To select scale: Maximum value for Xs = 12 Maximum value for X= 18 Scale: 1m=1 unit Constraint No. 1: % (o8)| 72K, 412%, > 216 0) 7 Fig. 3.9 Every point on the line will satisfy the equation (equality) 72X1 + 12X2 = 216. Every point above the fine will satisfy the: inequality (greater than) 7X: + 2X2 > 216. Similarly, we can draw lines for other two constraints. Linear Programming - I a3 Constraint No. 2: 3) x 0x, + 28%, 272 (20) Fig. 3.10 Constraint No. 3: Xe (@.10) 40X, + 20X, = 200 Step 5: Feasible region: ‘The final graph will look like: ‘Seale: 1 om=1 uni Feasible Region: ABCO| 72K, + 12K, 2216 (0,10) ° G20 Fig. 3.32 All constraints are greater than or equal to (=) type. Hence, feasible region should be above (to the right of) all constraints. The vertices of the feasible region are A,B,C & D. FN ser z 21 1209-081 woadars . OB 4 ex ZF Z*'XOr-= *X08 2X08 + XOF= Z 1X SEX 29 eX SLA “aseD Sip UL ados= uw axym 9+ xu = 4 sount ysreays jo vonenby 2X08 + 'XOP = 'Z swOHSUNy 40. Qs0> mur) uognyos jeundo jo wed am yBnonp sessed au] 1509 OST 9x (Zo au yoq Gsnes pmoys 3 aurod “oust DIL = ®X¥E + 1X9, SOUIT TULEHSUOD Jo WOH>aSI2 ap 10g Aysnes. PL = XCT + IXTL, SOUT JUTEHSUOD Jo VONDSIA}U! Ie STG UII & @ JOE "te & Sb=PE-ZL= XW 193 om “(1) uonenbe ur "x Jo anqea SummansaNg ye x og= 'xoIz Oezt = *Xozt + "x08 ose = *xozt + Ix0E 00z = *X0v + 'XOF w= Xt XD ssuogenba oz = *XOc + 'XOH, PUR ye S| D qulod € D tog 9= & wea ppl-9te= TE 48 4m (1) vonenbe ut Ix Jo anqea SuMANSANS, z= KX 7 08F = 'xOFz 009 = =x09 + xozE . 0801 = *x09 + "X09E a 00z = x02 + 'XOF 91 = EXCL IXTL “suonenba ys 1 aod ‘aoudzy “00% = *XOT + 'XOF, PUP WTS (O, tutod 1v) ove “sa = ZU “7 awapord jo apm jo ON = ¥-V pnpord jo sym jo-oN= 1X exus Yonpoad jeurndo oze “sy = unw 7 = 3509 ‘yders wor ox tE= KX a Toneibs snoaweimmS wo z=X b= 'X i Saopetibe nose NS WOH 92x TEX a der wong asx ‘08K ¥ a “SayeuTpIO-OD XouaA sv em) 1+ Sunwvestoug seaun (sve) yoreaeoy suoneodo yj. 5.ImAEA, powpaur juyod saUIOD uognzos yeurndo ayy Surpury :9 dais 7 i w 46 roe Viput’s™ Operations Research (BMS) Point C is the nearest to the origin. Example 3: Maximization-Mixed Constraints A firm makes two products P; & P; and has production capacity of 18 tonnes per day. P; & P2 require same production capacity. The firm must supply at least 4 t of P & 6t of Pz per day. Each tonne of Py & P2 requires 60 hrs. of machine work each. Maximum machine hours available are 720. Profit per tonne for P; is Rs. 160 & for P2 is Rs. 240. Find optimal solution by graphical method. LPP Formulation: X= Tonnes of P:/Day X__ = Tonnes of P2/Day Max. Z = 160X; + 240X2 Subject to constraints: % 24 % =6 Xit% 518 6OXi + 60%, 720 Ma X2 20 Co-ordinates for constraint lines: aM Xe (40) ...No. value for Xx X2=0 Q) X=6 (0.6) ...No. value for Xs, %1=0 @B) XX < 18 (28,0), (0,38) (4) 601 +60X2 < 720 (12,0)(0,12) ie X1 = 0, 60X2 = 720 Xr = 120,12) Ie Xa = 0, 60% = 724 Xi = 12 (12,0) Graph: Xi: X Axis, bas ‘Seale: 1 om = 2 Tonnes aes eal Scale: Cs Masiemsm vate f° sy Maximum value for ae X2= 18 (0.6) ad Scale: | em ='2 Tonnes 60%, + 80x, 720 ° mx - (0.0) Gay 2.5) (189) : Fig. 3:15 Linear Programming - |! rege a7 Two constraints are ‘greater than or equal to’ type. Hence, feasible region will be above or.to the right of these constraint lines. Two constraints are ‘less than or equal to’ type. Hence, feasible region will be below or to the left of these constraint lines. Hence, feasible region is ABC. Optimal Solution: Corner point method: 4 Vertex Co-ordinates Z=WGOX: + 240% A | Mt e4 X= 8 Z= Rs, 2,560 Simultaneous Equations ; 8 Xe 4 = 6 Z= Rs. 2,080 From Graph. ce p< Xi= 6, X2=6 Z=Rs. 2400 |___ Simultaneous Equations For A> Xi =4 from graph ‘Ais on the line 60X; + 60%2 = 720 E 60X2 = 720-60 (4) = 480 Xa=8 For CX: = 6 from graph Cis on the line 60%: + 60% = 720 0X: = 720-60 (6) = 360 X=6 Zmax_= Rs. 2,560 [At point A] Solution: Optimal profit = Z max = Rs. 2,560 X= Production of Py = 4 Tonnes Xx_=Production ofPz=8 Tonnes. Example 4: Minimization-Mixed Constraints A firm produces two products P and Q. Daily production upper limit is 600 units for toral production. But at least 300 tofal units must be produced everyday. Machine hours consumption per unit is 6 for P and 2 for Q. At least 1200 machine hours must be used daily. Manufacturing costs per unit are Rs. 50 for P and Rs. 20 for Q. Find optimal solution for the LPP graphically. LPP formulation: X= No. of units of P per day X= No. of unis of Q per day Min 2, = SOX, + 20X2 Subject to constraints: Xi Xs = 600 ozxoz i te ‘auiy JUTENSUOD JeYI Moyaq JO Jo 2] BY 0} SE UO!SAI sem ayqyseay ‘aoueyy -edéy ,0} penba 30 wewp ss9q, JO SE TUTEHSUO? BUD BLS EXE + xe “sau quferjsuo asayr aAoge 10 Jo WYSE ay) o3 St UOIBaz ssjuyesysuod 01 39a{qns | aqqyseay ‘souaey 241 04 jena 20 weyp zoyw0x8, Jo axe spuTes}Suo> OMT expt xg = Z XE ore ‘Sta soppung earpafao oozh = "x2 + x0 anaqqoad vost: (or ‘ SuyuwesSord zeaur] Supmoyoy ayy eajos 07 porous peorydessy a | % So'o08) (gone)_/ (20) See = | ook 27x +x ISINSTE Ve. G3AIOS EE »> Dat = A670 70 BA JOON = ost = Aeci/a Jo sinm Jo-oN = ' 09% +" 09°01 sx = URE Z = 3809 fourndo vy (009'0) ‘Qody suo\Ga1 ajatseea “OST = &X (@ woHeNby uF anpea BanMInsqng (ON OS = UD 4 91S i ost= Ix : sum os= UT 21S 009 = xr - 009 = &X Joy anyea uMUHCEA, zx” oog= exch Xe 009 = 1X 205 anyea UME, @~ oe = =X +X. 31225 o- oozt = *%xz + x9 aude =X +X, pue (o'002) 002 = x oozt = !x9'0= 7X51 (O0ZL = EXE + °X9, SUE juTENSUOS OM Jo UOHDISIOUL Ie ST A FOL (oor) peer oozt ="xz'0= XII ‘oos‘01 Sa = UN Z = Z MIN Aqyenba ur Supseauod OOZE= "XZ +IX9 8) ‘deed wong (o’ooe) o0€ = X“0= XII ooo'og “sa = Z 9 9K a (ooe'0) 08 =x '0= XT oib'er-ag= 2 - on boo aK 7 ‘Ayrrenba uy Supraauo> * oe ="x +X @ ‘Saopenby snoeuti | (0009) 009= "XK 0= XH oogor a= Z ost = "x ‘OST = 1X a (0090) 009 = *X 0= "XII dex wosy 4 Ayyenbe uy SunraauoD 009="X +X ooo'e =z 009 =" ‘0= "x: SOUS] AUTEXISUOD 105 S9yEUEPIO-OD oz + OS =Z s218tIpI0-65 oz x'™ oozt = XE + XT ooc = K+ “ ABH N-FyUeBO4d OUT say suoneiodo wiSAMEA 2 BL o ruopinros yeurndo Solutio: LPP Formulation: Max.Z =3X, + 4X2 Subject to constraints: BX, 42%. S18 x <5 % 56 %% 20 Co-ordinates of Constraint Lines: Viput's™ operations Research (BMS) St CGovordinates Constrain 7 a No. bei - x 2G @ | eee 6] 0 6 9 7 fo |s @ xs5 5 [0 3 0 @ x6 o | 6 ° 76 Graph: XA Seale: 1om= 1 unt 2 17 Ht 2% S18 ps5 <6 a 8 —* Feasible Region : OABCD e ° ——————> (0,0) 5 6 7 D Fig. 3.17 Corner Point Method: Vertex Coordinates | Objective function Max. Z= 9X1 4X2 o xiao %=0 A Xe0 X26 B Xi=2. | Kee ree st X= 5 Za15 46521 X=0 =15+0=15 Optimal Solution: Optimal Profit = Max Z= 30 Xi=2 [|_x=6 Example 6: (Mu, Aprit 2019) ‘A company produces 2 products A and B. X; and X> are the quantities manufactured of Products A and B respectively. The following objective function along with constraints is given to you: Max Z = 8X; + 16% Subject to consti Xr + Xe ¥ 200 Xe < 125 Xr +2%2 < 300 X: 2 0;X2 20 Find how many units of product A and Product B should be produced by the company so that the profit is maximized. Is it case of multiple optimal solutions? Use graphical method to solve the LPP. Solution: LPP Formulation: Max. Z= 8X1 +16Xa Subject to Constraints: Xi + Xz = 200 Xa S125 Xr + 2x2 = 300 X1,X2 20 Co-ordinates of Constraint Lines: nae Sr Constraint % | % Co-ordinates No. x % @ Fe = 200 200 | o 200 200 o | 200 @ = 125 a | 135 0 3s @ Xe + 2X; = 300 zoo fo {300 | 150 o_| 150 % oes xs + xe ore Big as6etosvezt on * syder: 8 8 0 e 2 8 0 enix ¥ on ° or + 0 Ot = "XS + xz ot 9 o 9 7 or 0 Axe + xg eg x x = soyepIO-O qusensuoy Lo AB SBF] JUFENSUDD JO SajeUTpIO-0D oR KK 8S K4IK 02 = XS + xz oe < E+ Ixg ssqurensuod 0; Dalqng SMORETMUIOS JaT ntonntos o 80 v= PL a ery ary 1X) + 2X2 > 60 - PIL pasa. Xi, Xe 2 0... Non-negativity. ° ag ae Covndinates of cone oon 2X1 + 1X2 = 80 80) - xa= 150 = 2 = 13,750 BQ) 1G +2%=60 1 30) x1 = 500 D ery 2.22 10,000 ~ Optimal Solution: xo = 333.3 units x2 = 400 units Max. z= Opt al profit = & 16,666 (os) » oe = x9 0) 0's) © ; 9L= XS + Xe: (D :saury juTeSUOD Jo smyeUIpI0-03 oz KK ounpeyy og > 1x9 ot g euTyDEy 06S xO+ Kg V aunpey * OEE xT IKE ssqutensucs 0} 1>afqng *XOL + IXE= ZEW, SAIL IOON = * EYD JOON = 1X, 1 sione|nunod 2a IORDIOS ‘uoRnjos PW Puy oF SunmuEsBoIY seaUr] Jo poypdut xojdus 10 peorydes8 asp, esinpord om ayp jo yea 50 uorsnpord Stpep ayp aq PmoysIeyAL jeagoodsax /OL SY Pur -/¢ ‘sy am syqQE e pur amYS & Woy semy>emuEU an fq pound sigoig gq edd ouneu uo Aepysinoy og pue av Aep/smoy gf axe axoyy -g addy aunypeu uo 9uA ow pue y adfy sunjeur uo sinoy g soambas aiqer y q ody auyypeur uo sinoy 9 pue y ad& auryoeur uo smoy z saimba: sey y “4, Pur y souryaeur jo sad. omy uo auop st sonpord asoy) jo Suussaoo1g “S91481 pe sureyp ~ sionpoud om) sae ampYNuLU: amyREMy Y (s00c dv nw) ch arduexg, €/0F = (001 wi) Soidea yaequadea Jo ON =A £/001 = (Co1 ut) sardoo zanoo prey 5 £/000'08 2 = Z"HIWy = 3509 suonnyog joudg 09 =*xt + IXL 08 =*X1 + 'XS Since X= Sand dead 2X1 + 5X2, = 16 2 Xe12 be? Optimal Solution: Optimal Profit = Zax = Rs. 32 X; = No, of Chairs = Zero X2 =No. of Tables = 3.2 chairs are not produced. (MU, April 2009) Example 13: ‘A confectioner sells two products A & B. The contrib: 30 and B is also Rs. 30. The products are produced production process. The production process has a capacity of 30,000 man-hours. It takes 3 man hours to produce a unit of A and 1 man hour to produce a unit of B. The market for the products has been surveyed and confectioner knows that a maximum number of 8000 units of product A can be sold. And similarly a maximum number of 12,000 units ‘of B can be sold. Formulate this as a liner programming problem to maximize contribution and solve either by simplex method or LPP Formulation: Let % = No. of units of A X2 =No. of units of B Max.Z =30X1 + 30X2 Linear Programming Subject to constraints: Xi =< 8,000 X: <= 12,000 Co-ordinates of Constraint Lines: (3X1 + 1X2 = 30000 ... (10000, 0) (2). X: = 8000 . (8000, 0) (3) X2= 12000 .- (0, 12000) fe a : Fig. 3.25 Corner Point M Vertex | Co-ordinates L_2= 30K, + 30% ° X=0 Z=0 a “MEO Z= Rs. 360,000 B Xi = 6000, Z=Rs 540,000 C Xy = 8000, Z= Rs, 420,000 D Xi = 8000, Z= Rs, 340,000 For B > Since X2 = 12000 and 3X1 +22 =30000 X; = 6000 For C > Since X, = 8000 and 3X + 30000 X= 6000 Optimal Solution: ‘Optimal Profit = Zinc = Rs. 540,000 X1 = No. of units of A = 6000 X2_=No. of units of B= 12000 wee Ba es xox ‘ge. v ov = 0+ xp a a x oz XK op = xR+ xy FES KO XE ssyuyesysucs 6; a/qng EXSHIXE= Z XUN ardurexg suoifox aygysvag puy jouw am vay suaddey Apqseonn “pomour jeorydes8 uy “spureggsuoo Tre Ajsues weo yprym LORNIos ¥ Puy 03 aiqisvod you st IT aameU AzorDIPERUOD avy S{UTENSuOD ayy way suaddey uonnpos ajqiseasuy ‘ajqyssod ou sua 219:sea;Uy (arrarseayuy :ucnnjos ajaiseazuy(e) “}QNIAIWYEDOUd YVINITNISISVD TID3dS PE OL = SHEYD JOON = 6= SIL IOON= IX gt e208 = youd yeundo "HORNS jeaRndo g=x 8b = "XE + XZ ‘GL = IX + Daeg 6='X 8b = "XE + XZ ‘OL =*X & 810g Su 009. = Z o=X ‘st='X a@oeun Siow =Z say SIE > nerd Oe Paros =z ore ¥ oz | =k oO 08+ xr =z SayeuRpIO“eD SA POWeWLIU}Og 19u205 so BBS westosd seu ove Sa, i "s (o'0) ae (o've) (o's1) a ays *xe+ xe 3 se oro osx a w aoavo :uoibau ararseed wo win 2= Wo 1 99R9S by nyderg) (oro) - oL=*x (€) fsb) st='X @ (91.0) (o'r). srexe+ xc ©) sour] IUJENSUOD JO S1eUTPIO-OD o= %X"X oF & > X doysyom eps XE+IXe ssnurensuo> 03 322/qng exo8 + XOF = Z xO srpey jo stm jo"oN = 7X sarge jo sun jooN= 1X sroneynuniod ddT sHORN}OS SupmuresSoxd rwauy] jo poyyau aydunss so powpaur qworydes® Suysn Lq ‘Aueduroo ayy so) sijoad aziurpceur Te Jom simp pur sajqer jo xtur janposd wrnumpdo oxp aujuEIAap pus [EPouE Buyunuesgoad xwoury oxp areTMUTIOY >a A3an0 Jos oq We SxIEY OT PUP Saige) 1 jo winupew yeu PoURMUDISP sey TusUNTedep BuneATEUI GL ‘og Su Saynquano> s7euD b ares ayosd 02 OF “sy BINAUAUED (Tho 91q2 VET Sun UoHSMposd jo smoy ¢ axITbaa [[kat afey> & pue sinoy ¢ azmMboz TT ajqrt & Jo UONIHPoLg 3aom w smoy gyP arExedo wed yey doysyzoMm MoH e pasmboe ysn{ avy, Kau “saBUD PUL sojqe aimrqjNUeLE ‘PIT DAV (oroz dy “TW) spy aydwexa (ovo) euesroy suoneiado 4 SRA 8.8 » Vipul’s™ operations Research (BMS) 66 ‘There is no common feasible region for line AB and line CD. Hence, solution is infeasible. (6). Unbounded solution: (Unboundedness) Unbounded mean infinite solution. A solution which has infinity answer is called unbounded solution In graphical solution, the direction with respect to origin is as follows: tin. Z ‘Towards Origin Max. Z Away from Origin A Maximization Now, in a Maxi problem, if we have fol Feasible region: Fig. 3.29 ‘There is no upper limit (away from origin), hence the answer will be infinit This is called unbounded solution. (© Redundant Constraint: (Redundancy) ‘A constraint is called redundant when it does not affect the solution. ‘The feasible region does not depend on that constraint. we remove the constraint from the solu answer is not affected. Example 16: Max. Z = 5X1 + 8X2 xy Subject to constraints: BXi+2X% 324 Xi+3%. 612 X 516 XX 20 the optimal 2K, 42%, 524 x, Linear Pragramming - It The feasible region constraint does not affe gives the optimal answer. tion values which give maximum more sets of profit or minimum cost. d, we come to know that there is optimal solution. (0.0) (20,0) (200,0) x Fig. 3.31 ‘There were two optimal solutions: At comer point B& C ISO profit line: Max. Z = 8%1 + 16%: Z= 8X: + 16X2 16X2 = - 8X % To" 476 BUY TUIPASIOD aH UO aur juTes}suO> xp apIsIRE uy UPEHSUO> ap apIsuy wine ruyensuos 30 oka TWORTJOS 70 OFT ayqyseay Mp avo ayy st woes Sunurewias ayy, “cquyeNsuOd q]P 6} UOURLIOD Jou BTe yy Hos aup Jo sired asowp fle ayoUNUNTD PrnoYys am “UOHas BqRSLD5 a “aurensu vouruos oyp st uowSor ojqiséey ou aia <= ’s Fe wargord ayn ur UN 40 sodéy quaroynp oq Ae osoyy, -wrajqoid aug jo sjurexsuod ap {TP saysHies y>Iyan vonnjos tearydes8 jo wed yey sueaur uoynjos jo UoySar a]qysSeaj 94], UY spowpyaws peoryderd qa wy uosNjOs Jo wo!Fex ajqyse9s Aq yeow SHEYM (1) NOLLSIND AYORHL leaf) a~9) 2-9) 8-2) Kata) 408 =») e8uy) worar aiqyseey ays aye you smog Ca) wonouny (61 190) teorydei 2anpa(go axp Bunuasardas our, (ay {WE TutensuOD. iMepunpay, uotnjos aqaiseayu, som05] 30 1yOHe-o8 yurensvo> ob -yenba 10 um aeons. @) jurensuos 0} jenbo so ues se] (a) uoLn|os 9[qIse95 Jo UOIBog, eur aA pismo 5 tno nos rc) Lesqeg ~f) 25-04 — a) asp ~ p) Haspeg —9): ma] ~v) esury) (Gr 920) “worSax opqyseay UT arayatSuw smo00 onjva wnumndo oup “gd Jo pouour penydess 109 tf aptsut S94] YOR genbo 10 uti s9yv028, © uy ‘oun uremSUOD aLp apISMO su Jo worSar ayqiseog ay ureRsuo> ,o1 jenba 40 Werf S59f, v JO > awaygoud axa jo sjurexsu05 ayy 1 Aq, posodumy suonsptios aup Agsnes tour Lew WosRpos Jo woyBas sTaIse94 24/1 (9) ‘uoras a[qteeo;, 2\p Jo SiawiOD ayi Jo suo Je HISPKA SKemTe Ga'] & OF WORNJOS PeUNdD (q) sequin omy e 103 Ayuo psn aq ue> pompaut qwapdes “gar uy (ey 7 [eA 10 9NAL,(Z) 69 BAA i Suquwesto.g Jeoun ysvad — ) (pepunoaun, “ (ot ponba ~ 2) (stysisuos paxryy ~ p) (uoumos svafit ~ 4) HuoxBou ayqisvag ~ 8) SUV] wor PATHS (AD worSo1_ pay st syugensuos &q popu a1g3seog = 51 uognyos ayy “sure su0> ap 8 1) ajqenen e JC UOANIOS ay “aT © UE IT sony (AN) ONL rT aajos 01 20} paride ac ues pouseur sognyos papunoqun ‘BurunuesBord 2°: @ ‘ey jonbo ba sc wey} S59) uwjoasesul (2) squrexysuo9 paxgy (ap s1aIeAs ) SRTASUOD 2h Suqacy wroigord “gy ssa}, Jo xn B are SiuFRASUOD. ou VOY (P) pots eps fe ; uoynyos sedosdury, uomnios apqyseagu jo 9809 se payed Kew aovapy Dg Gsepumog 0 jprtexed ApeNe st > {siva) yoseasay suones9do jySARGBA a ‘Viput’s™ Operations Research (MS) Linear Programming - ver a in Linear Prograriming using graphical sketch. maximum profit, Iso-cost line passes thi with minimum (MU, April 2011, 2019) cost. ‘means there is no’ feasible solution to the problem Slope of the iso-profit or iso-cost line i obtained from the objective function ty occurs due to contradictory nature of of the problem. in slope of the iso: Following example déseribes how to ob ‘Max. Z = 100 Xi + 80X2 of iao-profit line: the constraints. Following sketch en How to find slo} Equation of a st ight line: y= mx where, m= slope ofthe straight line I tn our ease and xmeans means 2 Xe amex 4Z 0x, + 0%, 240 Converting original objective function in this format: ~ 100X; + 80%: BOX, = Z= 100K: = 100K) +Z 10052 Yo constraint in Linear Programming? Show x oe KE ‘April 2019) the one which does not affect I obi Slope of ISO profit line = redundancy (redundant constraint): x, 516 : 9X, 42%, 524 — : Redundant i Constraint i o m7 X, + 3X, 5 12| EXERCISE: (@) A company produces two products A and B. 1 Aah rwiniio urge on poxnous rena Ay angen pre tt 0 “pronpoid aq sey ve pus sna ae 50m, “poem 94 pinone Baro risen eee ee aout ou pure simoy anegey Oo Hee ee gexmnbas imp jo pan as sam jo nun 90 Zo) hun aod eS “step. pow see i ovat jeydei fq onjog-vornios eurndo nego “Aanoadsar gy pur Fm Ht A Poe x JO Huh fod Boo pest 2a so suum ange Gog 880, 1y “sun pos st Ged pep syrun et pure austen go stnn gy sastabot jo ue suypeu yo sium ge saunba. 300 a do {peo Jo uouorpord wanna a pub x Stonpord oath Soon oye eyes k2afog "uounyos ¢ " pe € ty sg Due y 70 ear oozt 2q Pinoys smoy anoge, puE at IW “s[eHaeUr ser yo sium Z pur soy ‘sioy suryavu: 99 spaau eoup ‘smoy moget Of pur eaeeeual ‘smoy oot aq PIneys smoy g soumbar x pure x yse; OG PUE OZ eq PIOUS pue Tq so Aiddns umusrspy zg pee ty sonpord oa saonpocd Au 8 FY pue g sy st zy pue 14 sof yam sad ys0> “4 O0€ PUE Coz axe ZA PU 14 Jo MOUEZINbes wn: 3 ‘SUIE}UOD Z4 JO Ja JO MUN aug “ZI PUP 1g spooy Om) E punay aue ZA pue 1A SUNN, (6) et 1 -BuluuwwesBoug seoun, suo y(n) -porpaws yworudes® £q anjos ‘wonnies teumndo urerag “Ajoanzedsax 9 -sy pue psy sig pue Y Jo Tun Jad yop Apeampedser sun Ore pure gZ1 st ZA PuE [, $o.3uaUFARMbaT Ajpep LANUERUEN "ZA JO S14 OF PUE TA Jo syum 21 Summuos 4 30.88 3UO ZA JO SUN Oz PUE LA Jo st ST SuTERCD {jo amen 9c) 1 Pu V 9p!00} OM UI PuEY axe ZA PUN TA STALIN OO, ‘powour 10s youd urergo “Aennoedsos oT “9H PUP ST foug “situn g 51 O 40} PUBLIOP TOyAEU WNL Sid 20) puewop 7YieW WONT, “OE sf S¥noy suRpEW 7 simou auypeu oz sarmbar D wnpoig Jo yUN y “smoy sabar 4 yonpord Jo Run T“FSE st SINOY Moe} Jo uoRdumsuOD Tmogel Ze somnbox D inposd JO weN | “soy IMOge] aan | D pue qsionposd omy soanpord Auwdwo> y ‘uoRnyOs yewndo upeigo oF poigaut reonides8 Aq anfos pure fa] 9° METMUTION ‘Ayoanadsou Cz Sa PUL OZ "SH SEA PUP X JO fod ayjoag “porn 29q isnt rat Jo satu oop 3869] 1V ~Ajaanivedsox fe sinoy. moqe; pus sinoy auIyseUE 30 Aypede xz pue smoy snogey o1 ‘smoy auypew oT sexmbex yet Jo syun g pur smoy mnogel OT ‘sMey PUNPEUT mm 9G “k pue X siompord om} seonpord Auedwo> y ido wrergo “Ataanzedsax A ‘A.30} PUEWIOD JAE uamutxeyy “SIM § SX 10) PUELID} “oe $1 smoy mnoqeT mouy anogey OT SazIMbax x Ynpose JO IN | "soy Mode] Fr soinbas x }9npozd Jo wu 1 “A PUR x SioNposd ow seanposd Aueduso>-v ‘aneigo.“Alaansadsor zt "5a pur 9S 51. PuE d JO Ferg Jo} puewiap vue tumapeey “Afoansedsar swun gp PUE edu "7 aunpeut jo sun 9 pue 1 aupedt jo sm Te aumypeut jo sifun pue 1 auiypews 30 ss otinbar Qaoaponsjo.nun 1D pue gsonpord om saanpoad Auediwo> y ‘uoHnos: qeumndo urge jour yeorydesS, fq aajos pUE darT se AIE/MULOT reanoedsaa Jorg “O91 $} SanoY anogeT (yeu JO ‘bar Za $0 IRM uC) “sIMOY anOge] OF PUP SmMoY auTyeUL Su Za pue 1d sinpord om saonpord KuedwoD Vv 30 Sunppeur og 59: op sayinboz Tg Jo {swia) ypueosay su0Ke0d0 Sansa, o o o @ © @ ze 4 ew Vipul’s" operations Research (MS) Chapter 4 Linear Programming - Ill (Simplex Method) RS 4.1 Introduction 42. Simplex Method 4.3. Special Cases in Simplex 44. Solved Problems 4.5. Minimization 46 Duality 47 More Special Cases in Simplex 48 Simplex Case Studies = Objective Questions = Concept Questions = Exercise Eee 4.1 INTRODUCTION: In Chapter 3 we have seen how to solve a LPP by graphical method. In graphical method, we first formulate the problem and then we represent the constraint lines on graph. From the constraint lines, we find the Feasible region of solution. The optimal solution is at one of the corners of the Fe: Graphical method can be used only fox a two variable probl feasible simplex algorithm. It is a step by step progression from ot solution to another until we reach optimal solution. i i i vor 5 mplex method. we keep on improving the solution in ly reach optimal solution, Linear Programming - It means, in every step and fi 4.2 SIMPLEX METHOD: Max. Z = 100% + 80X2 s+. (Product A & B) Subject to constraints: 6X14 4X2 5 7200 .-- Resource I 2X, + 4X; << 4000 =». Resource II XX 20 Find optimal solution by simplex method. Solution: Now we will see each step of simplex method in detail: In the above example, the LPP formulation is given. Max. Z = 100 X; +80 X2 Subject to constrai 6X14 4X2 7200 2X1+4X2 = 4000 Step 2: Converting the LPP formulation in standard form. Standard form ‘means introducing slack variables in the LPP formulation. “Slack Variable: A slack variable represents unutilized capacity of a resource. Slack variable is represented by ‘S’, (S1, S2 ete.) e.g. Our Ist constraint is > 6X1 + 4X < 7200 ++» Resource I It means resource I has capacity of 7200 units. If after production, some capacity remains unutilized, it represented by slack variable s1. Hence, now we can write constraint 1 as: 6X14 4X2 4S, = 7200 (6X1 + AX) will ifany. of resource ized capacity

    You might also like