A I  a11 a12

 a11 a11
R1 a11 a12 b1 1 0 
R2 a21 a22 b2 
0 1 
  a 21a11  a  a 21 a12
 a 22
 a11
21
a11

  a12 0  a12 a 22  a12b

R1 1 a12 b1 a14 0  1  a12
 a11 a 22 a 22
R2 a22 b2 a24 
0 1 
 0 a 22 b2
 a a 22 a 22
 22

I A-1
R1 1 0 b1 a14 a15
R2 0 1 b2 a24 a25

Max Z  3.5 x1  2.5 x2

Sujeta a :
x1  x2  3
4 x1  2 x2  8
x1  0 ; x2  0
A I
R1 1 1 3 1 0 1 1 3
R2 4 2 8 0 1 0 -2 -4
a11 a12 b1   1 0 
a11 a11 a11   a a11 



↔ 


11



 a 21 a12  a 21b1   a 211  0  a 21 0
11
 a 21  a 22  b2  1 
a11 a11   a11 a11 

 a12 a 22  a12b2    a12 a14  a121   a11 a12 b1   1 0 

1  a12  b1    a14 0   a11 a11 a11   a a11 
a 22 a 22  a 22 a 22    11 
 
      
      
a 22 b2 a 24 1  a a11 a b1  0 1 0 0
    a 21  a 22 12  a 22  b2  b2  1 1 
a 22 a 22   a 22 a 22   21
a11 a11 a11   a11 a11 


I A-1
1 0 1 0 1.00 0 -1.00 0.50
-4 1 0 1 2.00 2.00 -0.50
   1 0 
  a a11 
  11 
  
  
 b2   0 1 0 1
0
1 
  a11 a11 
a11 a12 a13 b1 1 0 0
a21
a31
a22
a32
a23
a33
b2
b3
0
0
1
0
0
1


1 a12 a13 b1 a14 0 0

0
0
a22
a32
a23
a33
b2
b3
a24
a34
1 0

0 1


 1

1 0 a13 b1 a14 a14 
0
 0
0 1 a23 b2 a24 a24 0  
0 0 a33 b3 a34 a34 1 
 0 0



I A-1  1 0
1 0 0 b1 a14 a14 a15 
0 1 0 b2 a24 a24 a25 
 0 1
0 0 1 b3 a34 a34 a35


 0 0

  a11 a12 a13 b1  1 0
 
 a11 a11 a11 a11  a11 a11
  a 21 a11  a 21 a12  a 21 a13  a 21 b1    a 21 *1  a 21 * 0
  a 21  a 22  a 23  b2   0 1
 a 11 a11 a11 a11  a 11 a11
  a 31 a11  a31 a12  a 31 a13  a31 b1    a31 *1  a31 * 0
  a31  a32  a 33  b3   0 0
 a 11 a11 a11 a11  a 11 a11

  a12 * 0  a12 a 22  a12 a 23  a12 b2    a12 a 24  a12 * 1

 1  a12  a13  b1    a14
 a 22 a 22 a 22 a 22  a 22 a 22
 0 a 22 a 23 b2  a 24 1
 
 a 22 a 22 a 22 a 22  a 22 a 22
  a 32 * 0  a 32 a 22  a32 a 23  a 32 b2    a 32 a 24  a 32 * 1
 0  a 32  a 33  b3    b3
 a 22 a 22 a 22 a 22   a 22 a 22

  a13 a 33  a13 b3    a12 a 34  a1

 1 0  a13  b1    a14
 a 33 a 33  a 33 a
  a 23 a 33  a 23 b3    a 23 a 34 
 0 1  a 23  b2    a 24
 a 33 a 33  a 33
 a 33 b3  a 34
 0 0 
 a 33 a 33   a 33

  a13 a33  a13 b3    a12 a34  a12 a35

 1 0  a13  b1    a14 
 a33 a33  a 33 a33
  a 23 a33  a 23b3    a 23a34  a 23a35
 0 1  a 23  b2    a 24
 a33 a33  a 33 a33
 a33 b3  a34 a35
 0 0 
 a 33 a33   a33 a33
 1 0 0 

a11 a11 a11 
a 21 *1  a 21 * 0  a 21 * 0 
0 1 0 
a11 a11 a11 
a 31 *1  a 31 * 0  a31 * 0 
0 0 1 
a11 a11 a11 

 a12 a 24  a12 * 1  a12 * 0 

 a14 0 0 
a 22 a 22 a 22 
a 24 1 0 

a 22 a 22 a 22 
 a 32 a 24  a 32 * 1  a 32 * 0 
 b3 0 1
a 22 a 22 a 22 

a12 a 34  a12 a 35  a12 * 1 

 a14  a15 0 
a 33 a 33 a 33 
a 23 a 34  a 23 a 35  a 23* 1 
 a 24  a 25  0
a 33 a 33 a 33 
a 34 a 35 1 

a 33 a 33 a 33 

 a12 a35  a12 *1 

 a14  a15 0 
a33 a33 
 a 23a35  a 23* 1 
 a 24  a 25  0
a33 a33 
a35 1 

a33 a33 
 2 3 7 1 0 0 0 0 0
1 3 10 0 1 0 0 0 0
5 6 12 0 0 1 0 0 0
-2 4 16 0 0 0 1 0 0
2 -3 18 0 0 0 0 1 0
2 3 20 0 0 0 0 0 1
2 10 0 0 0 0 0 0
4 16 0 0 0 0 0 0

0.5 2 3 7 1 0 0 0 0 0
R1 1 1.5 3.5 0.5 0 0 0 0 0
-1 1 1.5 3.5 0 0.5 0 0 0 0 0
-1 -1.5 -3.5 0 -0.5 0 0 0 0 0
R2 1 3 10 0 0 1 0 0 0 0
0 1.5 6.5 -0.5 1 0 0 0 0

R3 -5 1 1.5 3.5 0.5 0 0 0 0 0

-5 -7.5 -17.5 -2.5 0 0 0 0 0
5 6 12 0 0 1 0 0 0
0 -1.5 -5.5 -2.5 0 1 0 0 0
 X1 X2 B1
0 0 R1 R1 X 1 1.5 3.5 0.5 0 0
0 0 R2 R2 0 1.5 6.5 -0.5 1 0
0 0 R3 R3 0 -1.5 -5.5 -2.5 0 1
0 0 R4 R4 0 7 23 1 0 0
0 0 R5  R5 X 0 -6 11 -1 0 0
0 0 R6 R6 0 0 13 -1 0 0
1 0 R7 R7 0 -3 3 -1 0 0
0 1 R8 R8 0 4 16 0 0 0

0 0 X1 X2 B1

0 0 X R1 1 0 6.25 0.25 0 0

0 0 R2 0 0 9.25 -0.75 1 0

0 0 R3 0 0 -8.25 -2.25 0 1

0 0 R4 0 0 35.833 -0.1667 0 0

0 0 X R5 0 1 -1.8333 0.1667 0 0
R6 0 0 13 -1 0 0

0 0 R7 0 0 -2.5 0 -0.5 0 0

0 0 R8 0 0 23.333 0 -0.6667 0 0

0 0
0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
1 0 0 0 0
0 1 0 0 0
0 0 1 0 0
0 0 0 1 0
0 0 0 0 1

0 0.25 0 0 0
0 0.25 0 0 0
0 -0.25 0 0 0
1 1.1667 0 0 0
0 -0.1667 0 0 0
0 0 1 0 0
0 -0.5 0 1 0
0 0.6667 0 0 1
 MODELO DE PROGRAMACION LINEAL GENERAL

Max Z  c1 x1  c2 x2  c3 x3
Sujeta a :
a11x1  a12 x2  a13 x3  b1
a21x1  a22 x2  a23 x3  b2
a31x1  a32 x2  a33 x3  b3
a41x1  a42 x2  a43 x3  b4
x1  0 ; x2  0 x3  0

MODELO DE PROGRAMACION LINEAL GENERAL EN FORMA ESTANDAR

Max Z  c1 x1  c 2 x 2  c 3 x 3  0 x n  1  0 x n  2  0 x n  3  0 x n  4
Sujeta a :
a11 x1  a12 x 2  a13 x 3  x n 1  b1
a 21 x1  a 22 x 2  a 23 x 3  xn2  b2
a 31 x1  a 32 x 2  a 33 x 3  xn3  b3
a 41 x1  a 42 x 2  a 43 x 3  x n  4  b4 CRITERIO SIMPLEX

x i  0  i i  1, 2 ,3, ect
 TABLA PARA EL METODO SIMPLEX

VECTOR SOLUCIÓN NUNCA DEBE DE IR UN

VALOR NEGATIVO

VARIABLES DE DESICIÓN PARAMETROS DE LA FUNCION OBJETIVO COEFICIENTES DE LA MATRIZ DE LAS HOLGURAS

PENALIZACIÓN C1 C2 C3 0 0 0 0
∅ V.B. bi x1 x2 x3 xn+1 xn+2 xn+3 xn+4
x4 b1 a11 a12 a13 1 0 0 0 R1
x5 b2 a21 a22 a23 0 1 0 0 R2
x6 b3 a31 a32 a33 0 0 1 0 R3
x7 b4 a41 a42 a43 0 0 0 1 R4
CRITERIO SIMPLEX 𝑍_(𝐽 − ) 𝐶_𝑖 Z = 0  C1  C2  C3 0 0 0 0
=
CRITERIO SIMPLEX SE TOMARA
DE ESTOS EL NUMERO MAYOR
NEGATIVO DE LAS COLUMNAS
 CONCRETO DE F'c=100 KG/CM2. CONCRETO DE F'c=250
HECHO EN OBRA, T.M.A=19 KG/CM2. HECHO EN OBRA,
MM, RESISTENCIA NORMAL T.M.A=19 MM, RESISTENCIA
NORMAL

Descripción Completa X1 X2

ARENA DE MINA 0.55 0.53

GRAVA DE MINA T.M.A. 19 MM Ø
(3/4), M3 0.65 0.63

AGUA DE TOMA 0.25 0.23

CEMENTO (GRIS) PORTLAND TIPO
II PUZOLANICO, TONELADA 0.26 0.39
CUADRILLA No 22 (1 ALBAÑIL + 5
PEONES) 0.083 0.083
REVOLVEDORA P/CONCRETO DE
1 SACO 8 DE HP 0.083 0.083

2119.56 2702.52
PRECIO DE VENTA

COSTO DIRECTO 1605.73 2047.36

514 655
UTILIDAD

MODELO DE PROGRAMACION LINEAL GENERAL

Max Z  514 X 1  656 X 2

Sujeta a :
0.55 x1  0.53 x2 12
0.65 x1  0.63 x2 10
0.25 x1  0.23 x2  6
0.26 x1  0.3 9 x2  9
0.083 x1  0.083 x2  2
0.5 0 x1  0.50 x2  2
x1  0 x2  0
Arena  0.55 x1  0.53 x 2  12 FORMA ESTANDAR 𝐴𝑟𝑒𝑛𝑎⇒0.55𝑥_
 Grava  0.65 x1  0.63 x2 10 FORMA ESTANDAR 𝐺𝑟𝑎𝑣𝑎⇒0.65𝑥

Agua  0.25 x1  0.23 x2  6 FORMA ESTANDAR 𝐴𝑔𝑢𝑎⇒0.25𝑥_

Cemento  0.26 x1  0.3 9 x 2  9 FORMA ESTANDAR 𝐶𝑒𝑚𝑒𝑛𝑡𝑜⇒0.2

Cuadrilla  0.083 x1  0.083 x 2  2 FORMA ESTANDAR 𝐶𝑢𝑎𝑑𝑟𝑖𝑙𝑙𝑎⇒0.08

Re volvedora  0.0830 x1  0.0830 x2  2 FORMA ESTANDAR Re⁡𝑣 𝑜𝑙𝑣𝑒𝑑𝑜𝑟𝑎⇒0.

MODELO GENERAL DE PROGRAMACION LINEAL

Max Z  514 X 1  656 X 2

Sujeta a :
0.55 x1  0.53 x2 12
0.65 x1  0.63 x2 10
0.25 x1  0.23 x2  6
0.26 x1  0.3 9 x2  9
0.083 x1  0.083 x2  2
0.5 0 x1  0.50 x2  2
x1  0 x2  0
 DISPONIBILIDAD
DE RECURSOS

12

10

𝐴𝑟𝑒𝑛𝑎⇒0.55𝑥_1+0.53𝑥_2+𝑥_(𝑛+1)=12
 𝐺𝑟𝑎𝑣𝑎⇒0.65𝑥_1+0.63𝑥_2+𝑥_(𝑛+2)=10

𝐴𝑔𝑢𝑎⇒0.25𝑥_1+0.23𝑥_2+𝑥_(𝑛+3)=6

𝐶𝑒𝑚𝑒𝑛𝑡𝑜⇒0.26𝑥_1+0.39𝑥_2+𝑥_(𝑛+4)=9

𝐶𝑢𝑎𝑑𝑟𝑖𝑙𝑙𝑎⇒0.083𝑥_1+0.083𝑥_2+𝑥_(𝑛+5)=2

Re⁡𝑣 𝑜𝑙𝑣𝑒𝑑𝑜𝑟𝑎⇒0.0830𝑥_1+0.0830𝑥_2+𝑥_(𝑛+6)=2

N LINEAL MODELO GENERAL DE PROGRAMACION LINEAL DE FORMA ESTANDAR

Max Z  514 x1  656 x2  0 x3  0 x4  0 x5  0 x6  0 x7  x8

Sujeta a :
0.55 x1  0.53 x2  x3  12
FORMA ESTANDAR 0.65 x1  0.63 x2  x4  10
0.25 x1  0.23 x2  x5 6
0.26 x1  0.3 9 x2  x6 9
0.083 x1  0.083 x2  x7 2
0.5 0 x1  0.50 x2  x8  2
xi  0 i i  1,2,3...ect .

x1 0 NO SE ELABORARA de concreto de f´c = 100 kg/cm

x2 15.873 SE ELABORARA 15.87 de concreto de f´c = 250 kg/cm
x3 3.5873 Arena ESTO ES LO QUE ME SOBRA
x4 0 Grava ESTO ES LO QUE ME SOBRA
x5 2.3492 Agua ESTO ES LO QUE ME SOBRA
 x6 2.8095 Cemento ESTO ES LO QUE ME SOBRA
x7 0.6825 Cuadrilla ESTO ES LO QUE ME SOBRA
x8 0.6825 Revolvedora ESTO ES LO QUE ME SOBRA

0.55 x1 + 0.53
Arena  0.55 x1  0.53 x2 12
0.65 x1 + 0.63
Grava  0.65 x1  0.63 x2 10
0.25 x1 + 0.23
Agua  0.25 x1  0.23 x2  6
0.26 x1 + 0.39
Cemento  0.26 x1  0.3 9 x 2  9
0.083 x1 + 0.083
Cuadrilla  0.083 x1  0.083 x 2  2
0.083 x1 + 0.083
Re volvedora  0.0830 x1  0.0830 x2  2

Esto es lo que se va utilizar de material y de

100
 TABLUT
f´c = 100 f´c = 250
kg/cm2 kg/cm2
MA ESTANDAR (x1) (x2)

 0 x7  x8
514 655 0
V.B. bi x1 x2 x3
 12 ∅
Arena 22.642 x3 12 0.55 0.53 1
 10
Grava 15.873 x4 10 0.65 0.63 0
6
Agua 26.087 x5 6 0.25 0.23 0
9
Cemento 23.077 x6 9 0.26 0.39 0
2
Cuadrilla ### x7 2 0.083 0.083 0
x8  2 x8
Revolvedora 24.096 2 0.083 0.083 0

𝑍_(𝐽 0 -514 -655 0

− ) 𝐶_𝑖 =

1 a
R2  R2 o R2  22 R2
a22 a22

1 1.5873 10 0.65 0.63 0


a22 15.873 1.03175 1 0
A de concreto de f´c = 100 kg/cm2 R2 
7 de concreto de f´c = 250 kg/cm2 R1   a12R2  R1
-0.53 15.873 1.03175 1 0
TO ES LO QUE ME SOBRA  a12 
TO ES LO QUE ME SOBRA  a12R2-8.4127 -0.5468 -0.53 0

TO ES LO QUE ME SOBRA R1  12 0.55 0.53 1

 R1 
TO ES LO QUE ME SOBRA R1  3.5873 0.00317 0 1

TO ES LO QUE ME SOBRA R3   a 32 R 2  R3
-0.23 15.873 1.03175 1 0
TO ES LO QUE ME SOBRA  a32 
 a32 R2 -3.6508 -0.2373 -0.23 0
x2
≤ 12
R3  6 0.25 0.23 0
x2 ≤ 10 2.3492 0.0127 0 0
R3 
x2 ≤ 6
x2 ≤ 9 R4   a42 R2  R4
x2 ≤ 2
 a42  -0.39 15.873 1.03175 1 0
x2 ≤ 2
 a42R2  -6.1905 -0.4024 -0.39 0

R4  9 0.26 0.39 0
e se va utilizar de material y de mano de obra R4  2.8095 -0.1424 0 0
8.4127 ≤ 12
10 ≤ 10 R5   a52R2  R5
3.6508 ≤ 6
 a52  -0.083 15.873 1.03175 1 0
6.1905 ≤ 9  a52 R2  -1.32 -0.086 -0.083 0
1.3175 ≤ 2
R5 
2 0.083 0.083 0
1.3175 ≤ 2 R5  0.68 -0.003 0 0

R6   a62R2  R6
 a62  -0.083 15.873 1.03175 1 0

 a62 R2  -1.3175 -0.0856 -0.083 0

R6  2 0.083 0.083 0

R6  0.6825 -0.0026 0 0
R7   a72R2  R7
 a7 2  655 15.873 1.03175 1 0

 a72R2  10397 675.794 655 0

R7  0 -514 -655 0

R7 10396.825 161.794 0 0

514 655 0
 ∅ V.B. bi x1 x2 x3

Arena x3 3.5873 0.00317 0 1

Grava x2 15.873 1.03175 1 0
Agua x5 2.3492 0.0127 0 0
Cemento x6 2.810 -0.1424 0 0
Cuadrilla x7 0.683 -0.003 0 0
Revolvedora x8 0.6825 -0.0026 0 0
𝑍_(𝐽 10397 161.794 0 0
− ) 𝐶_𝑖 =

NOTA: En el renglon criterio ya no existen numeros negativ

son ceros y numeros positivos, se llega a la prueba de o
( SOLUCIÓN OPTIMA)
SOLUCIÓN OPTIMA VALOR MAX. Z = 10397
x1 = 0
PUNTO OPTIMO
x2 = 15.873
x3 = 3.5873
x4 = 0
x5 = 2.3492
x6 = 2.810
x7 = 0.6825
x8 = 0.6825
 TABLUT

0 0 0 0 0
x4 x5 x6 x7 x8

0 0 0 0 0 R1 1 a
 R2  R2 o R2  22 R2
1 0 0 0 0 R2 a22 a22

0 1 0 0 0 R3 R1   a12 R2  R1

0 0 1 0 0 R4 R3   a32R2  R3

0 0 0 1 0 R5 R4   a42 R2  R4

0 0 0 0 1 R6 R5   a52 R2  R5

0 0 0 0 0 R7 R6   a62 R2  R6

R7   a72 R2  R7
1 a22
R2 o R2  R2
22 a22

1 0 0 0 0
1.5873 0 0 0 0

a12R2  R1
1.5873 0 0 0 0
-0.8413 0 0 0 0
0 0 0 0 0
 -0.8413 0 0 0 0

  a 32 R 2  R3
1.5873 0 0 0 0
-0.3651 0 0 0 0
0 1 0 0 0
-0.3651 1 0 0 0

  a42R2  R4
1.5873 0 0 0 0
-0.619 0 0 0 0
0 0 1 0 0
-0.619 0 1 0 0

  a52R2  R5
1.5873 0 0 0 0
-0.13 0 0 0 0
0 0 0 1 0
-0.13 0 0 1 0

  a62R2  R6
1.5873 0 0 0 0
-0.1317 0 0 0 0
0 0 0 0 1
-0.1317 0 0 0 1
  a72R2  R7
1.5873 0 0 0 0
1039.7 0 0 0 0
0 0 0 0 0
1039.7 0 0 0 0

0 0 0 0 0
 x4 x5 x6 x7 x8

-0.8413 0 0 0 0 R1

1.5873 0 0 0 0 R2

-0.3651 1 0 0 0 R3

-0.619 0 1 0 0 R4

-0.13 0 0 1 0 R5

-0.1317 0 0 0 1 R6

1039.7 0 0 0 0 R7

no existen numeros negativos, si observan

tivos, se llega a la prueba de optimilidad
LUCIÓN OPTIMA)
 a22
R2  R2
a22
R1
R3
R4
R5
R6
R7
RESOLVER EL SIGUIENTE MODELO DE PROGRAMACION LINEAL POR EL METODO
SIMPLEX ENCONTRAR LA SOLUCION OPTIMA

Max Z  3.5 x1  2.5 x2

Max Z  3.5 x1  2.
Sujeta a :
Sujeta a :
x1  x2  3 SE PASA A UNA FORMA ESTANDAR
x1  x2 
4 x1  2 x2  8
4 x1  2 x2
x1  0 ; x2  0
x1  0 x2  0
ESTA VARIABLE ENTRA X1

3.5 2.5 0 0
∅ V.B. bi x1 x2 x3 x4

DE ESTOS DOS VALOR SE ELIGE EL DE 3 x3 3 1 1 1 0

MENOR VALOR Y ES LA VARIABLE
QUE SALE X4
2 x4 8 4 2 0 1
CRITERIO SIMPLEX 𝑍_(𝐽 0 -3.50 -2.50 0 0
− ) 𝐶_𝑖 =

CRITERIO SIMPLEX SE
Para obtener la penalizacion, se divide el b 1 entre el x1 TOMARA DE ESTOS
EL NUMERO MAYOR
NEGATIVO DE LAS
COLUMNAS

PROCESO
1 a
R2  R2 ; R2  21 R2
a 21 a 21
R1   a11 R2  R1
R3   a31 R2  R3
1 a
R2  R2 ; R2  21 R2
a 21 a 21
1
 0.25 8 4 2 0 1
a 21
1 2 1 0.5 0 0.25
R2 
a 21

R1   a11 R 2  R1
 a11  -1 2 1 0.5 0 0.25

 a11 R2  -2 -1 -0.5 0 -0.25

  a11 R2 
R1  3 1 1 1 0

R1  1 0 0.5 1 -0.25

R 3   a 31 R 2  R 3
 a31  3.50 2 1 0.5 0 0.25

 a31 R2  7 3.5 1.75 0 0.875

R3  0 -3.5 -2.5 0 0

R3  7 0 -0.75 0 0.875
 Max Z  3.5 x1  2.5 x2
Sujeta a :
x1  x2  3
4 x1  2 x2  8
Max Z  3.5 x1  2.5 x2  0 x3  0 x4
x1  0 ; x2  0
Sujeta a :
GRAFICO
x1  x2  x3 3 (3,0) (0,3)
4 x1  2 x2  x4  8 (2,0) (0,4)
x1  0 x2  0 x3  0 x4  0
ESTA VARIABLE ENTRA x2

3.5 2.5 0 0
∅ V.B. bi x1 x2 x3 x4
R1 SALE ESTA 2 x3 1 0 0.5 1 -0.25 R1
R2 VARIABLE x3 x1 R2
4 2 1 0.5 0 0.25
R3 𝑍_(𝐽 7 0 -0.75 0 1 R3
− ) 𝐶_𝑖 =

CRITERIO SIMPLEX SE
SOLUCIÓN FACTIBLE TOMARA DE ESTOS
EL NUMERO MAYOR
Z= 7 NEGATIVO DE LAS
COLUMNAS
X1 = 2
X2 = 0 PROCESO
X3 = 1 1 a
R1  R1 ; R1  12 R1
X4 = a12 a12
0
R2   a22 R1  R2
R3   a32 R1  R3

1 a
R1  R1 ; R1  12 R1
R1   a11 R2  R1 a1 2 a12
1 2 1 0 0.5 1 -0.25
R1 
a12
R1  2 0 1 2 -0.5

R2   a22 R1  R2
 a22  -0.5 2 0 1 2 -0.5
-1 0 -0.5 -1 0.25
 a22 R1 
R2 
  a22 R1 
R2  2 1 0.5 0 0.25

R2  1 1 0 -1 0.5

R3   a32 R1  R3
 a32  0.75 2 0 1 2 -0.5

 a32 R1  1.5 0 0.75 1.5 -0.375

R3  7 0 -0.75 0 0.875

R3  8.5 0 0 1.5 0.5

 X2

(0,4)

(0,3)

(1,0) (0,2)

(0, (2,0) (3,0)

0) X1

3.5 2.5 0 0
∅ V.B. bi x1 x2 x3 x4
x2 2 0 1 2 -0.5 R1
x1 1 1 0 -1 0.5 R2
𝑍_(𝐽 8.5 0 0 1.5 0.5 R3
− ) 𝐶_𝑖 =

CRITERIO SIMPLEX SE OBSERVA QUE YA NO

EXISTE # NEGATIVOS SE LLEGO A LA
SOLUCION OPTIMA

SOLUCIÓN OPTIMA
Z= 8.5

PUNTO OPTIMO
x1 = 1
x2 = 2

(1 , 2)