Scribd
Upload
126 views44 pages

LPP Gate

Uploaded by

Mousumi Mondal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
126 views44 pages

LPP Gate

Uploaded by

Mousumi Mondal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 44
(LINEAR PROGRAMMING reins] LINEAR PROGRAMMING KEY POINTS| General form of Lincar Programming Py Min/Max 2 = subject 10 roblem (LPP) ai AD ox, te ay + Xz tot ay, x OX) + OX, Het ay, OQ) yk + Ay Xz Hot Oy, 12 with x20; Standard form of LPP is Max z = cyt, + ox, + ... + ¢,%, such that Ax Sb with x,>0 or Mi FOX, Fo Qk, Such that Ax> b with x,>0 Solution: The values of variables x, satisfying (2) is called solution of LPP 3. Feasible Solution: A solution satisfying non-negative condition x,2 0 is called feasible solution 4 Optimal Solution: A feasible solution which optimizes the objective function (1) 5 Basic Variable: Given m-simultaneous linear equations in n unknowns (m R 2B. Jd, Determine the starting basic variables. Select the emtering variable. Entering variable in a maximization problem is the non-baye ient in the net evaluation row. variable having the most negative coeffi Select the pares variable which is the basic variable associated with the smallest non. negative ratio. Determine the new basic solution Dual Problem: Consider LPP Primal Problem: Max = Subject to Ax $ b where A, By FEN, tnt Cay and b,x,and x20 Then dual problem of above LPP is Min = = byw, + By + at By Subject to: Awe! and w2 0 where c= [¢, 3 =. Cy] Some important results: aw Q a a i) oO Transportation Problem: Given O,, 0, cost of transportation of {ransported from origin O, to destination D, The dual of the dual is primal If the Kth constraint in a primal is a perfect equality then the corresponding dual variable is unrestricted in sign ¥ the variable x, of @ primal is unrestricted in sign then the corresponding Kth constrain of the dual is a perfect equality, Bounded optimal solution of primal > Bounded optimal solution of dual, Further, the opti! values of the objective function in both the problems are same. Unbounded solution of primal (dual) € no feasible solution of dual (primal) No feasible solution of primal (dual) => either an unbounded or no fe (primal, easible solution of is! rp * O, (origins) and Dy, Dy .. D, (destinations). Let ¢, each unit from origin O, to destination b Let x, be the number of wh : 42... mandj 1B 16. 18, LINEAR PROGRAMMING KEY POINTS Objective Minz=)" Yc, x, subject 0S, =a, and’ ait i by, x20 the total availability ; when the availability Xa, is equal to total requirement Db, then the transportation problem is halanced transportation problem, Vogel's Approximation method for transportation problem:~ (1) To obtain an initial feasible solution we first find the difference between the lowest and next lowest transportation costs for each row and column and then choose that row or column for which the difference is largest. (2) Find out that cell is in the selected row/column for which transportation cost is minimum. (3) Now, enter the smaller of the amount available and the amount required in the destination corresponding to this cell. (4) Omit either row or column depending on which requirement is satisfied. (5) Repeat the whole process until we get the solution. ‘et n jobs be assigned to n operators. Let e, be the cost incurred in assigning itt Assignment Problem jobs to jth operator and let { if ith jobisassignedto jth operator 0 otherwise Then the assignment problem is SD gx, where dy Min and 3% The optimum assignment schedule remains unaltered if @ consiant i$ added or subtracted from all the élements of a row or column of the assignment cost Mairi Hungarian Assignment Method:- (1) The cast matrix is square, columns) with zero cast element sfnot make it square by adding suitable mumber of dummy rows (or 2) Locate the smallest cost elements in each row of the cast MAT and subtract this smallest element of that row: Sitar » in reduced matrix repeat the process for element from each columns. a a 3 6 a ew o Examine he rows successively until a row witt exactly one zor Is found. Enrectangle this zen vend cross out all the other zeras in the colunnn. Proceed until all the rows have been examined fps The cost matrix of a transportation problem is given by |4| 3] 2| 0 of 2/2 1 The following are the values of variables in a feasible solution. Xiy 7 6,3) = 2s y= 6 By) = 4 = 6 Then which of the following is correct? © (2 marks) (A) The solution is degenerate and basic (B) The solution is non-degenerate and basic (C) The solution is degenerate and non-basic (D) The solution is non-degenerate and non- basic The maximum value of 2 = 3x%, subject t0 2X,-%; 1.x,S3andx, x, 20i8 (2 marks) AO a4 (6 (D)9 Consider the problem of maximizing 2 ~ 2x, + 38, 48, txysublect te 2, ey + IK ty XE ON Xo HWE Then (marks) Ay ty += 2-8) P= (A) (1,0,1,4) is a basic feasible (2) (1,0,1,4) is not a basic feast (©) neither (1,0,1,4) nor (2,0.0:4) i 0.0.4) are basi solution but (2,0,0,4) is not ible solution but (2,0,0.1) is is a basic feasible solution sible solutions GATE (2008-2021) LINEAR PROGRAMMING GATE - 2009 ~ Which one of the following is true? | (A) Every linear programming problem has a feasible solution. ! (B) Ifa linear programming problem has an optimal solution then it is unique. (C) The union of two convex sets is necessarily convex. (D) Extreme points of the disk x° +y* $1 are the points on the circle x° + y? = ZO The dual of near programming problem: Minimize c* x subject to Ax 2b and x 2 0is (1 mark) (A) Maximize b" wsubject 0 ATw2e and w>0. (B) Maximize b" wsubject to A™w $c and w20. (©) Maximize b" w subject to ATw $c and w is unrestricted. (D) Maximize b" wsubject to AT w 2 ¢ and w is unrestricted. B— Forafixed 1 R, consider the linear programming problem: Maximize z = 3X44 y Subject to X+ y <100 xt3yst and x20,y20 The maximum value of z is 400 for t = (2 mark (4) 50 (8) 100 (©) 200 - (D) 300 ae The minimum value of z= 2x, —x, +x, —5x, +22x, subject to a) -2x, 4,56 (2 marks) @)19 (© 10 (9 ‘ Using the Hungarian method, the optimal value : Of the assignment problem whose cost matrix is give” 3 23 M4 10 25 7 7 7 35 | 16 5 7 [iors [as fissaeeeal Fee is 2 marks) Ao (B) 52 (2% Ce y GATE (2008-2021) LINEAR PROGRAMMING GATE ~ 2010 For the linear programming problem Minimize 2 =x —y Subject 0 2x+3y $6, 0545305 ys3 The number “of extreme points of its feasible region and the number of basic feasible solutions respectively, are (0 mark) (A) Band 3 (B) 4and 4 (O)3 and 5 (D) 4 and 5 Which one of the following statement is correct? (mark) (4) Ifan LPP is infeasible, then its dual is also infeasible @) If an LPP is infeasible, then its dual always has unbounded solution (©) If'an LPP has unbounded solution, then its dual also has unbounded solution (D) If'an LPP has unbounded solution, then its dual is infeasible as 6 The following table gives the cost matrix ofa transportation problem |3_ 2 2 ni * The basic feasible solution given by Xj) =3.%s = ho = 6% = 2% =5 18 marks) (A) degenerate and optimal (B) optimal but not degenerate (C) degenerate but not optimal (D) neither degenerate nor optimal Ifz*is the optimal value of the linear programming problem Maximize 2= 5x, +9x, +42, Subject to x, +x, +4, =5 4x, 43x, +2x, e A Hikes 20 then 2 marks) A 0<2*<10 (B) 10s 2*< 20 (9s 2 <30 (D) 30s 2 < 40 GATE - 2011 The linear programming problem: Maximize 2=x,+x, Subject to x,+2x,20 xphy SIS 56 Xpx)20 (1 mark) (B) has more than one optimum solutions ~ A) has exactly one optimum solution exactly one optimum sol (D) has no solution (©) has unbounded solution 405 > q GATE (2008-2021) LINEAR PROGRAMMING I Consider the primal linear programming problem: { they, Maximize 2= 6% + subject 10 Jaya, Hats Hat ayt, $B, tt ayy SD [Minimize byw, by Fon By subject to Wi, Hy Wy Fon Oy Wy ZC) AM, + gM FoF OygWy 2 C9 The Dual of P is D: G48, Oy WF gy w,20, j Which of the following statements is FALSE? (1 mark) (4) IfP has an optimal solution, then D also has an optimal solution (B) The dual of the dual problem is a primal problem (©)IfP has an unbounded solution, then D has no feasible solution (D)IfP has no feasible solution, then D has a feasible solution We have to assign four jobs I, I, Il, 1V to four workers A, B, C and D. The time taken by different workers (in hours) in completing different jobs is given below: Ion om ow ris 2 8 Workers “Bo 7° 9 2 6 eeG go 9 YY be GO Ye 8 The optimal assignment is as follows: Job Ill to worker A; Job IV to worker B; Job HI to worker C and Job 1 t0 worker D and hence the time taken by different workers in completing different jobs is now changed as: “oom ow 1 o 3 2 5 BoT 9 2 3 4 3 2 Workers ee GATE (2008-2021) LINEAR PROGRAMMING D S$ 7 7 5 Then the minimum time (in hours) taken by the wor marks) by the workers to complete all the jobs i (ayo (B) 12 (1s or en The following table shows the informati f mation on the availabilits lability of supply to each warehous. ee a asd ea ama tone ea eal market Market M, M, wv, 6 ” @ M Sepp Warehouse W, 5S 9 2 7 IS W, 5 7 8 6 8 7 2 7 9 Requirement The present transportation schedule is as follows: W, to My: 12 units; W, to My: 1 unit; W, to Mg 9 units; W, to My 15 units: Wo My: 7 units and W, 0 Mg Lunit, Then the minimum total transportation cost (in rupees) is (2 marks) (a) 150 (B) 149 (us 147 GATE - 2012 For the linear programming problem Maximize 2=x,+2x,+3x5-4 Subject 10 2x +3 >) o bx txt 3ty 30 ap ky tN 2 0574 2 is (mark) (A) an optimal solution (B) a degenerate basic feasible solution (C) anon degenerate basis feasible solution (D) a non basic feasible solution (1 mark) JE Which one of the following statements is true? (A) A convex set cannot have infinite many extreme point (B) A linear programming problem can have infinite many extreme points (C)A linear programming problem can have exactly two different ‘optimal solutions. (DJA linear programming problem ean have a no" asic optimal solution. = The following table gives the unit transportation COS! the supply at each origin and the demand of each destination for a transportation problem Destination p, Ds, Bs Ps 0, 3 4 8 1 60 Origin 0, {_7 3 ft | 8 18 supply ota Ls Lt ace , 40 70 50 80 Demand GATE (2008-2021) LINEAR PROGRAMMING transported fram origin i to destination j. I the 1 method i Let x, denote the number of units to be ven By X))=60, X10, 750. 55°20, 40 and applied to improve the basic feasible solution ~60, then the variables entering and leaving the basis, respeetively, are 2 marks (D) xyand £4, (AIX, and Xy (B) x,,and x, (C) x, and X [Common Data for Questions 22 and 23: The optimal table for the primal linear programming problem: Maximize z= 6x, +121; + 12x, - 64 Subject to ¥+%,+4) =4, x, +44, $4, =8, Xtaryr%s 20, fs Basie variable y Dele] [| RAS Constams v4 [0 |T |-14 2 i4_(1 [0 | 6 0 |0 |6 Ify, and y, are the dual variables corresponding to the first and second primal constraints, then their values in the optimal solution of the dual problem are, respectively, 2 marks) (A) Oand 6 (B) 12and 0 (©) 6 and 3 (D) 4 and 4 If the right hand side of the second constraint is changed from 8 to 20, then in the optimal solution of the primal problem, the basic variables will be (2 marks) (A)x,and x, (B)x,andx, (Ox, and x, (D) x, and x, GATE - 2013 Consider the linear programming problem: 3 Maximize x+= a? Subject to 2x+3y £16, x+4y <18,x20,y 20. IS denotes the set ofall solutions of the above problem, then (mark) (A) Sisempty (B) Sis asingleton (©) Sisa line segment (D) S has positive area Consider the following linear programming problem: Maximize x+3y+6z-w Subject wo Sx+y+62+7ws 20, 6x+2y+224+9w< 40 0,220, w20. he optimal value is x20, y2 0,220, w20. Then the optimal value is (marks) “08S w GATE (2008-2021) LINEAR PROGRAMMING Let X be a convex region in the plane bounded by straight lines. Let X have 7 vertices. Suppose faxy) = ax + by He has maximum value M, minimum value N on X and N 0. IIL If for some B, the point (1, 2) is feasible to the dual of the LPP, then ZS 16, for any feasible solution (x, x,) of the LPP. “=Ges" ~*~ AAV. If for some B, x, and x, are the basic variables in the optimal table of the LPP with , then the optimal value of dual of the LPP is 10. Then which of the above statements are TRUE? (2 marks) (A) Land Il only (B) 1, Mand WV only (Cj and IV only (D) Hand 1V only wv Consider the following cost matrix of assigning four jobs to four persons: Jobs tlh [4 | Persons | P, 5 & 6 10 P, lz [5 [4 [8 P,|6_|7_|6 |9 P,_ [6 19 18 [10 Then the minimum cost ofthe assignment problem subject te consraint (hat job J, is assigned to person P, is (2 marks) By the Simplex method, the optimal table of the linear programming problem: Maximize ux, +3 GATE (2008-2021) LINEAR, PROGRAMMING subjectto Bx, +x, +x, = 8, tata ee Xe N20, where ot, B, Y are real constants, is 0 yo o> — [ Basie variable | [x | Solution | &O. 2_r [6 3 % x, a {1 [2 Oo B24 2 Then the value of + B + yis (2 marks) GATE - 2020 D1) and (D2) denote the dual problems of the linear programming problems (Pl) and (Py, respectively, where (PY) minimize x, — 2x, subject to~x, + x, = 10, x, x,2 0, 2x, subject tox, + x,= 10, x,—x,= 10, x, x,2 0, “marty (A) both (Dl) and (D2) are infeasible (B) (P2) is infeasible and (D2) is feasible (© (D1) is infeasible and (D2) is feasible but unbounded (©) (P1) is feasible but unbounded and (D1) SOU If (X}.23) is an optimal solution minimize x, + 2x, subject to 44,-x,28 o | (2) +%,210 1) +57 Xp x520 * and (4;,43,3)is an optimal solution of its dual (correct upto one decimal place) JX Wy Say Bay = 10, Xp Xyy xy) i8 the set Of basic variables of « balanced transportation probe seeking to minimize cost of transportation from origins to de He B, then x,, is equal to is feasible of the linear programming problem, problem, then Sy 4 is equal to nations, where the cost matrix is, and ® 2 marks) y qrece008-2021) s LINEAR PROGRAMMING ca —_ | Avaitabitiny ‘Demand | Ti rere Be B, w+ 0. The system y-2e, = 8 rp pp M20 has NO basic feasible solution if (2 marks) (ya<0,B>8 B)a>0,00,B<0 (D)a<0,B<8 Let ae RB. If (3, 0, 0, B) is an optimal solution of the linear programming problem minimize x, +X, +X,— ax, subject 10 2ey-1,+%) = 6 Wnirlzedion, Preblum Co at, tx,tx,=3 : ‘ Mgninlzekion_-a Path ag feb, (2 marks) Kp Xp ty X20 then the maximum value of B - 0. is GATE - 2021 Consider the Linear Programming. ‘Problem P: Minimize 2x, ~ 5x subject to =12, 2x, + 3x, +5, ox ty tS ox, + 2x, +5,=3, x, 20,42 0,5,20,8;2 0.andss20 % 2 (1 mark) 2 ; $3; 45,5 If| lisa basic feasible solution of P, then x, © 81° 2° % 5 Consider the Linear Programming Problem P: Maximize 2x, + 3x; subject to 2x, +x, $6 LINEAR PROGRAMMING GATE (2008-2021) tS x2 andy, 20. Then the optimal value of the dual of P is equal (0 1 marky nA i inear Programming Problem P: AK Let z=] 213 beam optimal solution of the following Linear Pro 0 Masimize "48, +3,-3x subject to 2x, + 4x, + ax, $10, x)-x) +b $3, 2k, + 3x, + 5x S11, x, 20, x,2 0 and x, 0, where a, b are real numbers. : P If § =| q | is an optimal solution of the dual of P, then p+ q +r = (round off 10 two decimal places). (2 marks) Consider the Linear Programming Problem P: Maximize ext, + 65%, subject to a,x) + aX, S by yk, + OX S by yk, + OX, S by %)2 Oand x, 0, where ay band care real numbers (i = 1, 2, 3; j = 1, 2). P ; Fi tet [ Pee a feasible solution of P such that pe, + gc, = 6 and let all feasible solutions (‘} P % Satisfy -5 Sex, + 6x, € 12 Then, which one of the following statements is NOT true? (2 marks) (A) The dual of P has atleast one feasible solution vs ®)M | ¥2 jis afeasible solution ofthe dual of P, then by, + by, + byy, > 6 Ys (C) The feasible region of P is a bounded set 0 (D) P has an optimal solution LINEAR PROGRAMMING (SoLuTions) 1, Solution: (A) 626 & Peer iff c, 22 (which is given) Hence, ¢, 2c, So, cost of assignment decreases and optimal assignment plan remains unchanged. 2 Solution: (D) If primal linear programming problem has an optimal solution, then its dual also has an optimal solution 4 Solution: (A) If the basic feasible solution of a transportation problem with m origins and n destinations has fewer than m + n—1 positive. xy then the problem is said to be degenerate transportation problem. Basic feasible solution: Feasible solution to m origin and n destination is said to be basic if number of or fewer than n+ m= 1. positive allocations are n + m 4 Solution: (B) Feasible region Given LPP is max 2 = 3X; -% Subject to 2x, x, $1 x83 X20 Now, find the value of 2 at corner points 8 GATE (2008-2021) LINEAR PROGRAMMING A1(0,0),2= 0 ANG S24 Semaxz = 4 Solution: (B) tii o 1-11 0 @ 232-1 (1.0,1,4) is not a bfs because columns (1), (IMI) and (IV) are not L.1. & (2,0,0,4) is bfs as I" and 4 column are Ll. Solution: (D) Clearly, the statements in A, B and C are false and geometrically, we have extreme points of dist x? + y? $1 are the points on unit circle x* + y? =1 Solution: (B) Here, the primal problem is Minimize c" x Subject to Ax > bandx 2 0 Corresponding dual problem is maximize b"w Subject to A" w < cand w = 0. Solution: (D) x=3y=300 100, NR » y=100 Max = 3x+4y Subject to x+ yS100 ke GATE (2008-2021) xy20 If = 300, then above linear programming probl i eee ie ne aig) "8 Problem attains its maximum at (0, 100) and clearly the a Solution: (C) Min (2x, =X; +X, ~ Sx, + 22x) 3x2 tae xytx,— 423 xyt3x,+2%,=10 x, 20V i= 123,45 Using Simplex method: 2 a u 5 22 Gi] es | % | a | a, a | a | a 2 | a 6 7 a Ome 7 | a, 3 0 T 0 [eT (a : a, 10 0 0 T | 3 2 Ze 0 0 0 3t | Asz,-c,are not $0 j. So, choose z,~¢, > 2,- 6 i8 most positive, ie, 3 2 I 7 sear?) (ee anf ap Aap ay a ee [era |e cee 2 0 0 7 3 | a, 3 0 Tr 0 T 4 alta 7 0 3 T 0 4 Z7G o | 3 0 o 2 Now z,-¢,$ 0 j. So, optimality is reached with x;=12, x; 423, x5 =O 252 (12) +1-5(3) = 2441-15 = 25-15 = a 5=10 Solution: (A) 4y Hungarian method we have, ow 3 Tae Ib 0 0 2 lo 25 1 2 cia © hs 16 15 1 a eG fe 23 7 Tssignment therefore a solution is obtained. Each row and each column has ane and onl one + Optimal value =541416+7=29 te GATE (2008-2021) LINEAR PROGRAMMING Me Solution: (A) 9 }L00 lar Given, linear programming problem is Minimi Subject 2x + 3y $6, 0Sx<3,0SyS3 The number of extreme points is 3. Now, we have to find number of basic feasible solutions. Introducing slack variables, we get 2+ By +5,=6.x45,=3,y 45, a 2 0 Consider the coefficient matrix | 0 0 1 x_[y [s: [s [% | Dp ofsolution o [2 [0 [3 [7 _ | aasicfeasibtesohaion 3 [0 0 3 | Basie feasible solution <0/3 |o 0 | Not feasible 3 [<0 [0 [0 | Norfeasibie 0 Does not satisfy constraints 0 0 | Does not satisfy constraints [9 [3 [<0 [3 |0 \Worpeasibie a jo [6 {3 Basic feasible solution These are the only possibilities Hence, number of basic feasible solutions are 3. (Fact: Al H the basic feasible solutions of LPP are extreme points of the feasible region) ‘olutions of Or B 4, LINEAR PROGRAMMING Clearly number of extreme points are 3. As we know there is one ~ one correspondence between number of extreme points and basic feasible solutions. So, number of bf = 3 Solution: (D) fan LPP has unbounded solution, then its dual is infeasible. Solution: (D) This basic feasible solution is non degenerate.” Number of non-z0ro x, are3+3-1=5 <[sTer Wytu-2=-2, vy buy ey 6-3 -2=1 Since for non-basic cell u, + v5 ~ 8 not less than o” equal 10 0 (If u,+ je, $ Ofor Wij then optimal solution is obtained). $0, this solution is not optimal. Solution: (D) Max (Sx, + 9x, + 4x,) 9 dy t x, tx=5 A) 4x, + 3x, + 2x, = 12 wf) XpXy X20 Multiply (1) by 2 We get 2x,+2x,+ 2x, = 10 3B $y+3x4+2x,= 12 wl) Now (4) - (3) implies 2x, 2he,x,= 2-24, GATE (2008-2021) 1S. 16. LINEAR PROGRAMMING and from (1) aye Seay ie, x)= S-x,- 242s, x,=3tx, $0, our problem reduced 10 Max (Sx; + 9(2~ 2x) + 43+ x,)) 3 x, 20 Max (5x, + 18 18x, +12 + 4x,) 9x, 20 Max (-9x, + 30) 3 x, 20 30— 9x, is maximum when x, will be minimum and x, will be minimum if x, = 0 because x, 20 = Max (-9x, + 30) = 30. Hence =* = 30. Solution: (B) (50) (20.0) Given LPP is maxz =x, +x, Subject to x, + 2x, $20 x, 44,515 56 ° Xp t,20 Checking at corner points, At (0,0), 2= 0+ At (10, 5), z= 10% 5= 15 At (0, 6),2=0+ At (15,0), 2° At (8,6), 2=8+6=14 Therefore the maximum value of is obtained at every point int lying on the 5 Hence, the given LPP has more than one optimum solution, efter * 838 15 Solution: (D) primal has no feasible solution, then dual has either unbounded solution or no solution ‘Solution: (B) (~ @aTE (2008-2021) LINEAR PROGRAMMING (ie iG ne assignme ubtract a constant from every el cos matrix then assignment remains unchanged.) ee eee assignment problem if we add or +. The optimal assignment remains unchanged Hence, the minimum time taken by the workers to complete all the jobs = 2434245 = 12 h 1s Solution: (B) 2] [a ][s 4, 2 3 [5 4 45 5 9 | 2] 7 7 1 5 Lé 8 6 y=2 y= For non-basic cells, compute t, We get Ay, =—4, Ay, =~6An2 =~9,a4 =-6,09 =H Ay =H ©. Ay enter into basic cell and A, will leave the cell. wz] {2 ] [8 6 3 5 4 15 5 9 2 Z 0 7 2 5 Than| 2% fo For non-basic cell, compute u, * ¥)- weget Ay) =-3, by =-5 Bn 2-9 Ou An 2 An Su, + y~ 6, $0 optimal solution is obtained 5x2: 4x842X 1545x7461 149. Minimum transformation cost is 312+ 19, - Solution: tion: (D) slution is feasible. constraints and x,2 0 1 So, this s 2)=4,x,=3,x, = 0,x,= 2sauisfes all the a To check basic ar non-basie calculate the determinant of the matrix | 1-3 | Which comes out to be 82-4 LINEAR PROGRAMMING GATE (2008-2021) => (D) is trve. 2. Solution: (D) ase we have linear programming problem as Max x, + 2x, Subject tox, +, $S.x, + ey S4, xy X20 This problem has non-basic optimal solutions. 21. Solution: (4) To add table 60 wel 3 [4] sa] 7 to | [so ||] 20 7/3 [7] 6 40 60 3] o9}3] 4 3 yW=7 4=6 An=3, dy =0, 4, =0, A,, Most positive A is A,, *. ay, enter into basic cell 8 | | 609 3 4 8 7 1048 | 50 | | 20.6 40-8 6048 3 ]ola|, Now variable leaving the bass isx,, as min (60,20, 40}=20 “ty, will leave, 22, Solution: (B) Dual of problem is Min 4u, +8u, subject to constraints Hj 4 Wy? 6, uy + 4,2 12, u,2 12, 02-6 u,, uy unrestricted only option (B) satisfied. GATE (2008-2021) LINEAR PROGRAMMING } 33 Solution: (D) Basic Variable (xy) “ % xy x RHS constants Xs 1 7 fi fi A z 4 0 1 20 e 4 0 0 ce xyenters and x leaves as min {3.2} =4 14 Basic variable * ” x Ey RHS constant ) % 1 1 1 0 4 Xe “3 0 4 i 4 2-6 24 0 24 c20V j=1234 Hence, z; of the primal problem, the basic variables will be x, and x, «In the optimal solution M4. Solution: (©) 80 (180) a Max Z = x+= 2 Subject to 2x+3y $16 at4ysi8 x20,y20 Consider, 2x4+3y=16 ..{1) 2x+8y = 36.2) Solving (1) and (2) we get, 5y = 2 208.0) = 8, ao 2)-2 20,4) = 24628, 280) =ZQ2M)=8 ay a" oa yad 28, EAR PROGRAMMING GATE (2008-2021) on Nolution is a line segment. Solution: (60) Given linear programming problem is Maxx + 3y + 62 —w Subject t0 constrai NY b Or + Tw S20, 6x + 2y +22 + 9w S40 X20. y20,220,w20 Standard form of LPP ig Max 2 =x+ 3y+ 62—y Subject to constraints 5x +y + 62+ Ty +8, = 20, Ox + 2y + 22+ 9w +S, = 40 x20y2 5,20, i z 6 zi 8 e Basi Variable oa . z x ® Sle 6 7 1 0 2 > [esowelees 9 0 I 20 a | 3 7 0 0 5 lar 7 I ftet |e le |e fw pects Sale wp, | 20 I 20 oH oe ale es 0 acer 0 3 0 1 a a el | oa 2 x. 10 fis 0 : 3 ; -2 |) 3 = ee Ss | | i 8 0 16 2 e Now z-c,>0 . “ 20,2=0,w=9 Max + 37+ 6:—W) = 3 x20 = 69 Or Dual of the above problem is Min (20.,+ 40w,) > Sw, + 6w,> 1 w, + 2w,2 3 GATE (2008-2021) LINEAR PROGRAMMING w,20, 1sis2 Whey = 120 x] (34) = 12+ 48=60 3°5 Wan = 60. Hence w = 60. As we know optimal value of dual and primal is Solution: (D) ‘Mis maxima and N is minima’ f(xy)=axtby+e andN. / 427> a LINEAR PROGRAMMING GATE (2008-2021) Minw =x + 2y Subject o 2x + y>3 xty22 x20,y20 Checking at corner points Av(0, AULD), W=142(1)=3; At (2,0), w=2+2(0) = 2 + Minw =2 Hence, answer is 2 31. Solution: (1.2) ~ gaTE (2008-2021) LINEAR PROG: a Here, the primal problem is Maximize w = IIx—z Subject to 10x + y yt2S2: a uyr20 Corresponding dual problem is Minimize w 1+ 2x, 0x, + 28,211, x)- 2x20 +x, 2-1 xp 3,20 Checking the minimum value at corner points At (2, 1), w! = 242(1) =4 1 1 At}oa|, = 1 “(4a) w (3) +20 2 a(Be w (22 (4)-8 12°12)" 12, 12) 12 As minimal value for the dual is 1.2 Therefore, maximum value for the primal problem is also 1.2 Solution: (B) (6,2)'8 the only optimal solution of given LPP “+ Options (A) and (D) are incorrect. a 429 > PROGRAMMING GATE (2006-2021) LINEAR 1 which comes out to be non. 1 To check basic or non-basie calculate determinants of the matrix: : : | zero The solution (6, 2 0,0, 0) is th Hence. option (B) is correct. ly basic feasible solution. 33. Solution: (©) We know that both primal and dual cannot be unbounded together. I primal is infeasible = dual is either infeasible or unbounded. Thus, option (C) is not true, So, option (C) is answer. 34. Solution: (2.33) We have, Maximize w=kx, + 5x, Subject tox, +x,<1 2x, + 3x51 *.2,20 And given that x» 7 0, 0). |—.0 | 0,4 « »(5.0}(04 AO, 0) w= KO) + 50) = 0 1 1)_5 41/02) w= 4)_5 a0 3)” fonds ) 3 ve. k a(Lo 0) = $k+50) 7 The largest value of k for which (j 0) és optimal solution ig & 2 win k= a333 35. Solution: (D) If both primal and dual of L-P.P. are feasible then optimal values of Primal and dual are equal [Se %, gave (2008-2021) ‘using strong duality theorem) 50, option (D) is false. LINEAR PROGRAMMING We have, Max 2= 006, +2, Subject to 2x, +x, £6, -x+,S1, x+y S4 %20,x,20 Checking at corner points (0, 2= a0) +0=0 At(0,1), At Q2), z= 2042 A630), 3a a > 2 38. 39. PROGRAMMIN GATE (2008-2021) ee = The number of basic variables = m+n-1 = 443 1=$ number of non-basic variables = 9 - $= 4. = option (B) is incorrect. As cost, availabilities and demands are finite, therefore transportation problem has finite solution, ie bounded solution * option (A) is incorrect. Since transportation problem is balanced, “the dual variables of the wransportation problem are unrestricted in sign. = option (C) is incorrect. option (D) is correct (-: it has exactly 5 basic feasible solutions) —_— —_ Solution: (Ans: 7) 3x +4, 42n—x,20 4) +x, 4x,—2y, Xete xy x20 The given problem is in 4 variables wit Here x, = 0= x, is non-basie and x, h 2 constraints, so 2 variables will be non-basic. © either x, = 15x is basic orx,= c can be non-basic ¥fx2= bis non-basic, then b = 0 4 3-¢=aand1—2¢=3 SE Thich is no possible ase > 0°: basi feasible Sotut 41> cis non-basic= ¢= 9 =. “+ equation reduces 10 3 + Hatbte=24+54g=7 ~aand 1+ b= 355-9, =5 Solution: (B) pp always have a finite optimal value for an 7 Wy 2 0 and » row if is shen dual is also feasible and have sabie optional ae ar ald teh artscleora “s (Discorrect and (Il) is incorrec iement, sjfor some B, x, and x, are basic variables in optimal ta 1 in optimal table for x, =, then x, must be 3 and it must optimize Z= 2x, + 4, ‘= Maximum value of Z = 1+ 9 = 10 and if a primal is optimal feasible, then so is dual and their optimal values are same. «statement (IV) is also correct. Hence, option (B) is correct. Solution: (Ans: 27) (Te fe | 4s iF, [5 [8 [6 [Pr [6 [7 [6 iP [6 [9 [8 On taking minimum from each row and subtracting, from that row, we get Ca Te [P_jo [3 [7 [2 jo [7 [@ [jo [3 [2 On taking minimum from each column and subtracting from 1 column, we get ieee agin fi 27 ap 2 [2 ir from each entry to which lines are not 2 ‘ating and adding to the entry where 21 niracting Naw taking minimum from [ ; | je, 1, subtracting ines intersect ao 43> | GATE (2008-2021) LINEAR PROGRAMMING -, minimum cost = 6+ 8+ 7+6=27 41. Solution: (Ans: 14 t0 16 or 17 to 18.5) 3.0 OO mae 7 0 0 i oo 3.0 0 = |» [x [6 elo, o lt_|T [re ‘from table x, enter and x, leave Rot oR 8 2p 2-8 ATE (2008-2021) LINEAR PROGRAMMING } Comparing with given table we get, =3B a 2p 3-8 Q @ a sing (3) in (4) we get 8 - 2B = 6 S3ta-I>a=4 2atBty=15 42 Solution: (A) (PL): minimize z= x, — 2X, subject to ~¥ +2, =10, x,x, 20, 5-10 Then, 2= x, -10—2x, =—x, -10={x, +10) Now, minimum value of will be obtained at largest value of %- ie, x = (Pl) has unbounded solution. ; ‘primal problem has unbounded solution, then its dual is i * option (D) is incorrect. Now, (P2): minimize 2= nfeasible. x, subject 10 44x, =10 0) %~x,=10 2) 4%) 20 From (I), x,~x,=-10 Form 2) x,—x, =10 This is not possible. "s, (P2) is infeasible Tyltt dual (D2) is infeasible. ™ option (A) is correct. 4a LINEAR PROGRAMMING GATE (2008-2021) Solutions(Ans~S.5 10 8.9) Given, primal problem is mine=4, +21 subject 0 4x, -x, 28 2x, +4, 210 =x 4x, $7 ot 20 Primal can also be written as ming =x, +2x, subject 10 4x, —x, 28 20 We will use graphical method to solve primal problem. From graph it is clear that corner points of feasible revi le region are of objective function at these corner points is given by" G4) and (3, 12) and the value at (5, 0), z = 5; at (3, 4), 2= 11; at (5, 12),2= 29 ©. the optimal solution of primal is x: Now dual of given problem is maxz=8y, +10y, ~7) subject to GATE (2008-2021) LINEAR PROGRAMMING a) dy, +2 tS ' Let 5,05, be slack variables, then (1) reduces to 4y, 4292 by tH EL -y ty ts, =2 We will use simplex method to solve dual problem CB, G 8 10 7 oO O Solution | Ratio Basic y Ye vy ss Sy variable 0 a q 2 Z th a 7 % | o 5 -i 1 -l 0 1 2 z 0 0 0 0 0 0 6% 8 10 2 0 0 | Optimality condition for maximization problay is cj pS Op Hence, we haven't achieved optimal condition yet. The maximum value of 6; 1. So, ,i8 entering variable and min{1/2,2}-12 Hence, 5,is leaving variable. cB, G 3 10 7 0 @_| solution | Ratio Basic vs v vw 3) 5; 70 vente 7 7 | ao |e 9 A 3 0 i | -2_| 1 | 32 | ; a 1 5 7) o-z, 12 U 2 5 0 Now all ¢,-2,50 = 2;,2;,2, is optimal solution of dual problem, =H 30,2, =1/2,4; =0 7: ' Last Va ngage a ard “Seosasbeaso “Ma =55 2 ee 437 > GATE (2008-2021) LINEAR PROGRAMMING 45. Sohution: (Ans.§ to 5) jie ass a Now xy 4+xy=10 ty t= a+ Ry tay tay =34 On substituting given values We ger, Xn tay = 10 l) Xm» 4-5 Q) Xp 34-25 3) From (2) and (3) Sry= 3445 3x, =, 425-15 3x,,-x= 10 From (1) and. a By my = 10 nt ky = 10 lh) Solution: (D) For G, BE Bc #0, he given system i 4,7 2x, +a, =8 a 18-2021) ATE (200 LINEAR PROGRAMMING 2) ‘subtract equation (1) from (2), we have x, +x, —ax, = B—8 For option (A). yas Choose, = -1, B= 9 Equation (3) reduces 0 Xy +X, +4, =1 0,x,=0 od) We can take X, = 1.x, 2 given system has basic feasible solution if. < 0, B> 8 For option (B), a>0,.0 given system has basic feasible solution if 0. > 0,00,B<0 Choose a = 1, B +x, -3, Wecan take x, =1,x4=2,%, =12 > given system has basic feasible solution if 0. > 0, B <0 For option (D), YO 0. and B - 8 <0. Sx, +x, +x, = B-8 LHSis non-negative because X,,%yyX, are non-negative and RAS is negative Hence there does not exist any basic feasible solution for & < 0, B the value of is minimum at (3, 0, 0, 6). Hence, 3-6a56-3a=> ~3a53 a > minimum value of ois 1° Hence, maximum value of B — 0. = 6 ~ (-1) = 7 Solution: (Ans. 5) Min. 2) — 5x, subjectto 2x, + 3x, +5, = 12 4, +x, 48, x, + 2k, +x,=3 %)2 0,520, 8,20, $,20ands,>0 For basic feasible solution, we put 53 = 2 variables equal to zero Afwe take s, = s, = 0, then 2x, + 3x, + Solution: (Ans. 8) We know by Fundamental Theorem of duality the optimal value of primal and dual is sane. 80 find the optimal value of primal P given by Max. 252k, +3, Subjectio — 2x, +x, <6 a tys/ xy tx,$3 Xp x, 20 gate (2008 LINEAR PROGRAMMING resolve the given problem graphically rhe corner points of the given region are (0, 0), (3,0), (I, 2) and (0, 1) Ewreme Points z= dx, + 3x, x ao a Bo 6 a2) a al) 3 +. optimal value of primal is 8. Hence, optimal value of dual is also 8. Solution: (Ans. 3.17) Max. 2= 4x, +x— 3x subjectto 2x, + 4x, Fax, +8, = 10 x,-X, + bx, +8, =3 2x, + 3x; + Sx, #5, = 10 s,20V1SiS3 We solve it by using Simplex Algorithm T G oi 0 0 O|xX, B|C. Xe X % % ste ay a & | 0 10 : 4 a 1 0 0 | 10 5 2 [0 3 @a »b o 1 0 ss |o " BNSF oo 1 z T4138 eae 42, s: [0 4 0 © ab fe lag | 4 ab Oo 1 oP 3 7 5 7 slo 5 0. 5 52b o 2 tI5 Z 0 1-5 4b+3 o_ 4 0 2 al x, |1 2, (a-2) 0 =. |. ala uw i 2 pat (a+4b) 0 3 Coe 1 3 Z 2 GATE (2008-2021) i ‘he optimal solution, so above table will be optimal simplex table. From above table we can obtain dual variables as Ves, fors. yes, 3 6 PS a* r= 3.17 (upro two decimal pla ices) Solution: (©) an

You might also like