You are on page 1of 6

EXAMPLE (Part 2): Graphical method

Resolve using the Graphical Method the follo ing pro!lem: Z = f(x,y) = 3x + 2y su!$ect to: 2x + y 18 2x + 3y 42 3x + y 24 "%&'(%& Ma"imi#e

1. Initially we draw the coordinate system correlating to an axis the variable x, and the other axis to variable y, as can see in the figure. 2. We mark, in these axis, a numerical scale appropriate to the values it can take the variables according to the constraints of the problem. To do this work, for each constraint we must to void all variables except the related to a certain axis, so we establishing the right value for such axis. This process must be done for every axis. . !ollowing, we represent all constraints. We take the first one and we draw the line that is obtained by considering the constraint as an e"uality. In the figure, this is represented with the #$% edge, and the region that defines this constraint is shown in &'(()W color. We repeat the process with the other restrictions, limiting %(*' and +', regions for the second and third constraint respectively. -. !easible region is determined for the intersection of every region defined by the constraints and the non$negativity condition of each variable, that is, both axis. This feasible region is represented by the )$!$.$/$0 polygon, in 1I)('T color.

2. 3ince there is a feasible region, we proceed to determine its extreme points, or vertices of the polygon that represents. These vertices are the candidate points for optimal solutions. In this example are the )$!$.$/$0 points shown in the figure. 4. !inally, we evaluate the ob5ective function 6 x72y8 in each point 6the results in the table below8. #s the / point provides the greatest value of the 9 function, and the ob5ective is to maximi:e, this point is the optimal solution; 9 < with x < and y < 12 E"treme point ) )oordinates ("'() 6=,=8 *!$ective value(+) =

0 / . !

6=,1-8 6 ,128 64,48 6>,=8

2> = 2-

)*MPAR,-G: GRAP.,)AL ME/.*0 123 2,MPLEX ME/.*0 3uccessive tableaus constructed in the 3implex method provide us the value of the ob5ective function at different vertexs, and at same time, ad5usting the coefficients of initial variables. In the first iteration 6Tableau I8 have remained all the e"ual coefficients, has been calculated the ob5ective function value at the vertex 6=,=8 that is the value which belong to the basic variables, been = the result. /a!leau , 3 4st iteration 2 5ase ? ??2 + )! = = = P& 1> -2 2= P4 2 2 6 $ 1 $2 P2 1 = P6 1 = = = = P7 = 1 = = = P8 = = 1 =

In the 3implex method, the incoming variable establish which will be the destination vertex. #s in this example ?1 6corresponding to @x@8 enters to the base, the shifting will be done through of the )! edge until reach the ! vertex, where the 9 value is calculated. This step occurs in the second iteration of the 3implex method, shown in the Tableau II. The value has been calculated for the ! vertex, obtaining a function value of 9 < 2-. /a!leau ,, 3 2nd iteration 2 5ase ? ??1 + )! = = P& 2 24 > 2P4 = = 1 = P2 496 BA 1A $1 = P6 1 = = = = P7 = 1 = = = P8 $2A $2A 1A 1

# new move is done along !. edge, until reach . vertex 6you can see these data on Tableau III8. In this third iteration, we calculated the function value at the . vertex, obtaining 9 < =. /a!leau ,,, 3 6rd iteration 2 5ase ?2 ?)! 2 = P& 4 12 P4 = = P2 1 = $B = P6 = P7 = 1 = P8 $2 7

?1 +

4 =

1 =

= =

$1

= =

1 $1

We continue with the process along the ./ edge until reach to the / vertex. The obtained data are shown in the Tableau I1. #t this point the process ends, allowing to verify that the solution does not improve by moving along the /0 edge to the / vertex 6does not exceed the present value of the function8. /a!leau ,1 3 7th iteration 2 5ase ?2 ?2 ?1 + )! 2 = 6 66 P& 42 P4 = = 1 = P2 1 = = = = P6 $1A2 $BA$ A2A= P7 = = = = = P8 = 1 = =

The maximum value for the ob5ective function is /8.

, and corresponds to x <

and y < 12 6vertex

The /raphical method needs to calculate the ob5etive function value at all vertex of the feasible region, unlike the 3implex method that finish when finds the optimal value.

You might also like