Scribd
Upload
5 views

Graphical method

The document outlines the graphical method for solving linear programming problems with two variables, detailing steps such as formulating the problem, plotting constraints, identifying the feasible region, and applying solution techniques like the Corner Point Method and Iso-profit/Iso-cost Method. It defines key concepts such as feasible solutions, basic feasible solutions, and optimal feasible solutions, while also addressing special cases like infeasible and unbounded solutions. The document includes examples and theorems related to linear programming to illustrate the concepts discussed.

Uploaded by

Khusu Tak
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
5 views

Graphical method

The document outlines the graphical method for solving linear programming problems with two variables, detailing steps such as formulating the problem, plotting constraints, identifying the feasible region, and applying solution techniques like the Corner Point Method and Iso-profit/Iso-cost Method. It defines key concepts such as feasible solutions, basic feasible solutions, and optimal feasible solutions, while also addressing special cases like infeasible and unbounded solutions. The document includes examples and theorems related to linear programming to illustrate the concepts discussed.

Uploaded by

Khusu Tak
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/ 6
FORMULATION AND GRAPHIC SOLUTION METHOD 2:10. GRAPHICAL METHOD OF ne SOLVING LINEAR PROGRAMMING = ee _ —_ Procedure is one method of solving two variable linear programming problems and involves the following steps 1, Formulate the problem in terms of a series of mathematical constraints and an objective function. 2. Plot each of the constraints as follows : Each inequality in the constraint equation be written as equality. Give any arbitrary value to one variable and get the value of other variable by solving the equation. Similarly. give another arbitrary value to the variable and find the corresponding value of the other variable, Now plot these two sets of values. Connect these points by a straight line. This exercise fs to be carried out for each of the constraint equations. Thus, there will be as many straight lines as there are equations : each straight line representing one constraint 3. Identify the feasible region (or solution space), ‘e., the area which satisfies ali th: constraints simultaneously. For ‘greater than’ costraints. the feasible region will be the area which lies above the constraint lines. For ‘less than’ constraints, this area 1s generally the region below these lines. For ‘greater than or equal to’ or ‘less than or equal to’ constraints, the feasible region includes the points on the constraint lines also 4. Select one of the following two graphic solution techniques and proceed to solve as explained below : Corner Point Method (a) Identify each of the corner (or extreme points) of the feasible region either by visual inspection or the method of simultaneous equations. (b) Compute the profit/cost at each corner point by substituting the co-ordinates of that point into the objective function, (¢) Identify the optimal solution at that corner point which shows highest profit (in a maximization problem) or lowest cost (in a minimization problem). Some Important Definitions : (a) Solution. Values of decision variables x (J = 1.2, .-- problem is called the solution to that L-P. problem. Iso-profit or Iso-Cost Method | (a) Choose a specific profit or cost figure and draw ‘an iso-profit (iso-cost) line so that it falls within | shaded region. | (b) Move this iso-profit (iso-cost) line parallel to itself and farther (closer) from (to) the origin until further movement would take the iso-proft (Iso-cost) line completely outside the feasible region. (Q Identify the optimal solution as the coordinates of that point on the feasible region touched by the highest possible _iso-profit line (or lowest possible {so-cost line). (q) Read the coordinates (x1. x2) of the optimal point either directly from the graph (or compute their values by using the simultaneous equations method. L(e Compute the optimal profit (or the cost). n) which satisfy the constraints of a general L.P. (b) Feasible Solution. Any solution that also satisfies the non-negative restrictions of the general L-P- problem is called a feasible solution. (Basic Solution . For a set of m simultaneous equations inn unknowns (n > m). a solution obtained by setting ins of the vartables equal to zero and solving the remaining m equations in m unknowns js called a cease) Jere variables (n-m) are called non-basic variables and remaining m variables are called basic variables and constitute a basic solution. Id) Basic Feasible Solution. A feasible solution to a general L.P. problem which is also basic solution ts called a basic feasible solution. ‘Optimal Feasible Solution. Any basic feasible solution which optimize maximize or minimize) the ctyeSine'nunction of a general L-P. problem is called an optimal feasible solution to that L-P, problem, w the basic variables become equal to zero. Degenerate Solution. A basic solution to the system of equations is called degenerate if one or more of 34) Graphs of Linear ‘ax + by+c20orax+ byt two regions of WI ‘The ine (1) divides the plane into wo FEIN 0. ution set of xs PU tisfied, we take ar eee fet Le, he region n which a ineguation OS ee the inequation Pe e “ ordinates in the - Ps the plane not ying on (1) and substitute ts. coat nich contains the point. But If the regio tis of the two regions, the solution se canine ane efed, then the solution set is the region which does not con point ‘The following steps may be followed in graphing linear inequalities of the form: ax + by+C<, > S&2 STEPS 1. Draw the straight line ax+ by + ¢=0 : 2. Take some point in the same region and test whether it satisfies the inequality. If it s then mark the region; otherwise do step 3. 3. Take some point in the other region and test that it satisfies the inequality and mark 4. Do steps 1,2 and 3 again if more than one inequality is given taking a new inequality. Remark. iC origin (0, 0} does not lie on (1), then we take a point (0, 0) and substitute in the given ine point (0, 0} satisfies the inequation, then the region on the origin side of the line és the solution set. Otherwise fon the non-origin side of the line is the solution set. Example 2-20. Draw graph of the linear inequation 4x + 3y = 12. Solution. We first draw the graph of the equation 4x + 3y = 12. Its intercept form is given by XiHea ‘: The line 4x + Sy = 12 passes through (3, 0) and (0, the plane into two regions, I and Il, a Se ad ‘Take and point, say (0, 0) in the region I, Since 4(0) + 3(0) inequatien 1), 20) < 12: the co-ordinates of the point (0, 0) satisfy the ike Every polnt on the line 4x + 3y = 12 satisfies the inequation 4x+3y S12, Hence, region 1 ; = together wit aph ofthe inequation 4x+ Sye12. Ns Nne 4¥ + 8Y= 12s the cok x dmng he gop of the linear ine which P does not lie, point in im region It, say (0, ge NEAR PR LINEAR PROGRANMING-1 FORMULATION AND GRAPHIC SOLUTION METHOD ao ye Fig. 22. Remark. ystems of Liner Ineqaiie Ty fr he sobiten 3 Wire a lunear inequalities in two variables, graph all of them on the same co-ordinate system. The intersection oftheir solution sets (Le. the region common to all) isthe solution of the system. Pane ts ce Example 2-22. Exhibit graphically the solution set of the linear constraints x+y 21 y <5 x <6 7x49y £63; x20, y20 ee ee en a ¥ Solution. Since x 2 0, y2 0, we have to restrict ourselves 7 | tothe frst quadrant only. Graphs of x+ y= 1. y= 5. x=6, d 7x + 9y = 63 are as shown in the adjoining figure. Arrows indicate the regions corresponding to their inequations. The 5 7 required region has been shaded. 4 The polygon ABCDEF with the vertices A (0. 1), Bil. 0). (6. 0), D (6. 7/3). 2118/7. 5), FIO, 5) is shaded to represent the solution set of linear constraints. d Wasyet Fig. 29 ome Important Theorems. While obtaining the optimum feasble solution to the linear programming problem, the ‘statement of the following important theorems is used. / |” (@ The feasible solution space constitutes a convex set (ia Within the feasible solution space, feasible ‘solution correspond to the extreme (or corner) points of the | feasible solution space. (ui ‘There are a finite number of basic feasible solutions within the feasible solution space. {id The optimal feasible solution. fit exists, will occur ‘at one, or more, of the extreme points that are basic feasible solttions. is defined as the set of points, te., the constraints of a Linear Programming Problem he conse) solution to the L-P. problem. The feasible regjon may be a polygon (te. tines) or empty or an unbounded region. ‘Extreme Point Theorem. An optimum solution to a linear programming probl points of the area of feasible region. values of decision variables which simultaneously satisfy 'P-P). Thus any point in the feasible region is a feasible region bounded by jem, if it exists, occurs | LINEAR PROGRAMMING—1_: FORMULATION AND GRAPHIC SOLUTION METHOD Using (his (*) In (a), we get the restated Linear Programming problem as follows + Maximize Z= 150x, 100%, + 280,000 | Subject to the constraints 20< x, $60 70x, < 140 120

You might also like