Scribd
Upload
35 views

Restricciones: PROBLEMA: Cinturones Función Objetivo

The document presents a linear programming problem to maximize production of two types of belts (X1 and X2) given constraints on leather quantity, buckles, quality buckles, and production capacity. The problem is solved through a tableau method, arriving at an optimal solution of X1 = 200, X2 = 600, with an objective value of Z = 26,000. This maximizes production while satisfying all constraints with no slack.

Uploaded by

Vladimir Calle Mayser
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
35 views

Restricciones: PROBLEMA: Cinturones Función Objetivo

The document presents a linear programming problem to maximize production of two types of belts (X1 and X2) given constraints on leather quantity, buckles, quality buckles, and production capacity. The problem is solved through a tableau method, arriving at an optimal solution of X1 = 200, X2 = 600, with an objective value of Z = 26,000. This maximizes production while satisfying all constraints with no slack.

Uploaded by

Vladimir Calle Mayser
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

PROBLEMA: Cinturones

Funcin Objetivo
Z(MAX) = 4X
1
+ 3 X
2

Restricciones
X
1
+ X
2
<= 800 Cantidad de cuero
X
1
<= 400 Hebillas
X
2
<= 700 Hebillas de menor calidad
2X
1
+ X
2
<= 1000 Capacidad
X
1
y X
2
>= 0
Variables de holgura
Z(MAX) = 4X
1
+ 3X
2
+ 0S
1
+ 0S
2
+ 0S
3
+ 0S
4

X
1
+ X
2
+ S
1
= 800
X
1
+ S
2
= 400
X
2
+ S
3
= 700
2X
1
+ X
2
+ S
4
= 1000

TABLA I(SOLUCION INICIAL)

Cj 4 3 0 0 0 0
Xj X
1
X
2
S
1
S
2
S
3
S
4
b
n

0 S1 1 1 1 0 0 0 800
O S2 1* O O 1 0 0 400
0 S3 0 1 0 0 1 O 700
0 S4 2 1 0 0 0 1
1000
Z 0 0 0 0 0 0 0
Zj-Cj -4 -3 0 0 0 0

0 - 40 = -40 0 - 30 = -30 0 - 0 = 0 0 - 0 = 0 etc.
TABLA II
Para obtener los coeficientes de la nueva fila dividimos los anteriores de S2 para el
pivote.

400 + 1 = 400 (pivote = 1)
1 + 1 = 1
O + 1 = O
O + 1 = O
1 + 1 = 1
O + 1 = O
O + 1 = O
800
= 800 (1) Semipivote
1
400 = 400 (0*) Pivote
1
700
=
NO (0) Semtpivote
O
1000
=
1000 (2) Semipivote
2
Las dems filas se las obtiene de la siguiente forma:

Coeficientes de S
1
ANTERIOR-NUEVA FILA x SEMIPIVOTE CORRESPONDIENTE

800 - 400x1 = 400
1-1x1=0
1-0x1=1
1-0x1=1
0-1 X 1 =-1
0- 0x1 =0
0- 0x1 =0


Cj 4 3 0 0 0 0
Xj X
1
X
2
S
1
S
2
S
3
S
4
b
n

0 S
1
0 1 1 -1 0 0 400
4 X
1
1 O O 1 0 0 400
0 S
3
0 1 0 0 1 0 700
0 S
4
0 1
*
0 -2 0 1
200
Z 4 S 0 0 4 0 0 16000
Zj-Cj 0 -3 0 4 0 0

TABLA III

Cj 4 3 0 0 0 0
Xj X
1
X
2
S
1
S
2
S
3
S
4
b
n

0 S
1
0 0 1 1
*
0 -1 200
4 X
1
1 0 O 1 0 0 400
0 S
3
0 0 0 2 1 -1 500
3 x
2
0 1 0 -2 0 1
200
Z 4 S 3 0 -2 0 3 22000
Zj-Cj 0 0 0 -2 0 3

TABLA IV
Cj 4 3 0 0 0 0
Xj X
1
X
2
S
1
S
2
S
3
S
4
b
n

0 S
2
0 0 1 1

0 -1 200
4 X
1
1 0 -1 0 0 1 200
0 S
3
0 0 -2 0 1 1 100
3 x
2
0 1 2 0 0 -1
600
Z 4
S
3 2 0 0 1 26000
Zj-Cj 0 0 2 0 0 1

Solucin ptima
Z(MAX) = 26.000
X
1
= 200 Cinturones de clase A
X
2
= 600 Cinturones de clase B
S1 = 0 Se utiliz todo el cuero
S2 = 200 Hebillas no utilizadas
S3 = 100 Hebillas de menor calidad no utilizadas
S4 = 0 Se utiliz toda la capacidad
Comprobacin
X
1
+ X
2
+ S
1
= 800
200 + 600 + 0 = 800

X
1
+ S
2
= 400
200 + 200 = 400

X
2
+ S
3
= 350
300 + 50 = 350

2X
1
+ X
2
+ S
4
= 1000
2(200) + 600 + 0 = 1000
400 + 600 + 0 = 1000

You might also like