Scribd
Upload
2 views7 pages

Graphical Method

Nice books

Uploaded by

NAVEEN
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
2 views7 pages

Graphical Method

Nice books

Uploaded by

NAVEEN
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/ 7
CHAPTER 1 Graphical Method Optimization is a process of either maximizing or minimizing a specific quantity called objective which depends upon a finite number of variables. These variables can be altogether independent or related to each other. Depending upon the availability of facilities in the department or plant, constraints will be formed. Graphical Method at solving these problems is limited to two dimensions only and the method can be understood by the following examples Que: ion 1:1 Assume that the following speci problem: - Max 2 = 45x + 40y Subjected to 2x+y<90 x+2y<80 x+ys50 xy20 Solve it by using Graphical Method and slope method. a generalized linear programming Solution: a) The equation of lines can be changed into this form xy <50>—+=-51 xtys5022 +3 b) Now plot these lines on the graph: Fig 1.4 c) Mark the feasible region as shown in above graph 4) Locate the aa points of feasible region as O, A, B, C, D e) Find 'x’ and ‘y' coordinates of those points as shown below Scanned with CamScanner ical M Industrial enginooring Graphical Method Zo Abe + A0y ‘O'(0,0) Zqy 192 = 45(0) +40(0) =O ‘A'~>(0,40) Za ont = 45(0) + 40(40) = 1600 ‘B'~ (20,30) Zyy ps = 45(20) + 40(30) = 2100 2200] -» Optimum point (400) res = 45H) + 40(10) 7200) D'— (45,0) Zou -p' = 45(45) + 40(10) = 2025 ; f) To find point of maxima directly we need to understand the following theory: through the origin, the > Initially the objective function line is drawn passing i nt the 0 " the feasible region or moment the objective function line first touches feasible point that is the point of minima The farthest point at which objective function lin region is the point of maxima, .e is touching the feasible 2 Min Point ‘Objective Function Line Fig 1.2 (g)_% Utilization of machines at the optimum point: Now optimum point is (40,10) so, Utilization of machine 1 is 2x +y =2(40)+10=90 < 90 -:. % Utilization of machine 1 is 2 x100 = 100% Utilization of machine 2is_x+2y=(40)+2(10)=60<80 -.% Utilization of machine 2is £100 = 75% Utilization of machine 3 is x+y =40+10=50.<50 <.% Utilization of machine 3 is 2. 100 =100% Slope Method: 45 Slope of the objective function (m) =~ 2 Slope of first constraint (m, 1 Slope of second constraint (mg)=—> Scanned with CamScanner Industrial engineering Graphical Method Slope of third constraint (m3)=—1 As mies between m3 and m, the Optimum point will be the intersection of line (1) and (2), Note: If m3 Profit(Rs.20) No. of tea trays = y — Profit(s.30) Fixed cost = 45,000 = :. Objective function (max Z) = 20x + 30y ~ 45,000 xy 10x + 20y < 30,000 => —_—+ s1 For stamping machine=»10x + 20y <30,000= >> +=205 any, fe chi 15x + Sy < 30,000 > —— + 1 For forming machine => 15x +5y = ota 6000 204 E Fig 1.3 0(0,0) = Zat 9 = 45,000 A(2000,0) =>Zatq=-6,000 5 B(1800,600) => Z,,5 = 9,000 C(0,1500) = Zyc=0 =>. Rs.9000 is the net profit per day 3 Scanned with CamScanner Industrial engineering Graphical Method ar programming Question1.3 Assume that the following specify a gonoralized line: problem: - Max (x)= 2x4 + x2 Subject to x1 +x) <6 x53 Ixy 4x24 X4x220 Graph this problem, identifying the three constraint equation lines and the feasible zone common to all of them. Plot dotted lines for values of 3, 6, 9 and 12 for the objective function f(x). What appears to be the highest feasible value of f(x) and for what values of x; and x2 does it occurs? Solution: i xX Xitxps6 0 1 ey en 6 6 xys3 3X4 3 XX Axytxy24 =A, >4 ene 274 ata(o4),2=4 — optimal Point 26 at EQ0),2=@ Ly 04 US odNg7 ds do Fig1.4 Corresponding to Z = 12, there is over utilization ofall facilities Comtesponding to Z = 8, since tis an optimum value there is 100% utilization of At Z=6, there is under utilization of all facilities. Corresponding to Z = 3, it is not a feasible solution. By slope method : Z= 2x; + Xp Xy+X_ $6 x83 Oxy xp <4 Scanned with CamScanner Industrial engineering Graphical Method Here m and mg are equal but it is important to note that, in maximization of Z value, we will consider the equations which always have less than or equal to “<” sign, and not consider the equation ha 9 "=" sign. In minimization, the converse is true. Question 1.4 Assume that the following specify a generalized linear programming \Solution problem:- Min Z= 2x + 3y Subjectedto 5x+y2100 3x+2y2120 x+3y290 x,y20 Solve it by using Graphical Method Yoy i X y aS Yo, 20° 100°." 40” 60 \y W005 at A (0,100), 300 sok ca 20) tho 8 (nur, 4285) aT 7 7 ave (0150) z= 810] optima rai (2S eager ° aD@00), Z=780 opr vit s+ m= — 0-66 + 0 mp2 oS | cas os =—o ‘o m3 33 ms mime ee : (E phowta be intense ction y Fig 1.5 Question 1.5 Assume that the following specify a generalized linear problem:- Max z= 300x; +400x, Programming 4 Subjected to 3xy+6x, <150 xq + 3x2 $180 5x; + 4x2 2100 2xy + 4x9 2 80 Solve it by using shortcut slope method Solution As it is maximization problem, do not consider equations having ‘>’ sign. 3 m=->=-0.75 =-1.33 ‘me (my,m2) «: Optimum point is the intersection of line (1) and (2) i.e. (30, 10) =>maxZ = 13000 : 5 Scanned with CamScanner Industrial engineering Graphical Method lized linear programming Question 1.6 Assume that the following spocify a gene! problom:. MaxZ = 6x, 44x Subjected to 2x1 43x, $30 3x4 42K $26 xy xg 23 X4X 20 : Solve it by using Graphical Method & slope methods Solution: By graphical method: at), Z=18 atB(0,3), 212 at (0,10), Z=40 ato 2 2 48 5 "5 Fig 1.6 > In these situations atthe farthest point, objective function line superimposes over tone of the constraint lines, so all the points falling on ‘DE’ line will be optimum > This is the case of alternate solution because the slope of objective function line is same as that of one of the constraints and objective function line is superimposing over the constraint line at the outermost point, By slope metho: + m= m, it has alternative solutions. Scanned with CamScanner Industrial engineering Graphical Method Question 1.7 Assume that the following spocify a gonoralized linear programming problem:- Max Z = 3x, + 2x) Subject to xy-x2 51 Xp +223 X4X_ 20 Solve it by using Graphical Method Solution: = Mey 1A aM.%224 373 Feasbie Been Fig 1.7" In problem feasible region extends to infinite, so for max Z, it will be unbounded solution. Question 1.8 Assume that the following specify a generalized linear programming problem:- MaxZ= x; +2 Subjectedto — xy+xp<1 ~ 3x4 4X2 23 X4X220 Solve it by using Graphical Method Solution: X22 <4 14 MH 34 473 Fig 1.8 Regions (1) & (2) are not having any intersection region so there is no feasible region, so no solution. Scanned with CamScanner

You might also like