Scribd
Upload
37 views1 page

Guiasimplex Metodo Simplex

The document describes 10 optimization problems involving maximizing or minimizing objective functions subject to constraints. The problems involve maximizing or minimizing expressions involving variables X1, X2, X3 and in some cases X4. The constraints for each problem specify linear inequalities or equalities relating the variables. The goal is to apply the simplex method to find the optimal values of the variables for each problem.

Uploaded by

VictorAntonioMolina
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
37 views1 page

Guiasimplex Metodo Simplex

The document describes 10 optimization problems involving maximizing or minimizing objective functions subject to constraints. The problems involve maximizing or minimizing expressions involving variables X1, X2, X3 and in some cases X4. The constraints for each problem specify linear inequalities or equalities relating the variables. The goal is to apply the simplex method to find the optimal values of the variables for each problem.

Uploaded by

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

UNIVERSIDAD NACIONAL EXPERIMENTAL

FRANCISCO DE MIRANDA
ÁREA DE TECNOLOGÍA
DEPARTAMENTO DE GERENCIA
ING. MILENA DE SOUSA M.

INVESTIGACIÓN DE OPERACIONES
MÉTODO SIMPLEX

1. Maximizar Z= 100X1 + 80X2 + 120X3 + 30X4 2. Maximizar Z= 300X1 + 200 X2


Sujeto a: X1 + X2 + X3 + 4X4 ≤ 300 Sujeto a: 2 X1 + X2 ≤ 100
X2 + X3 + 2X4 ≤ 600 X1 + X2 ≤ 60
3X1 + 2X2 + 4X3 ≤ 500 10 X1 + 30 X2 ≤ 1200
X1, X2, X3, X4 ≥ 0 X1, X2 ≥ 0

3. Minimizar Z= X1 – 2X2 – X3 4. Minimizar Z= X1 – X2 – 4X3


Sujeto a: - X2 ≤2 Sujeto a: X1 – 2X2 + X3 ≤ 6
- X1 + X3 ≤ 8 X1 - X2 - X3 ≥ -4
X1 + 8X2 + X3 ≤ 6 X1 – 3X2 – X3 ≤ 8
X1, X2, X3 ≥ 0 X1, X2, X3 ≥ 0

5. Maximizar Z= 20X1 + 30 X2 6. Maximizar Z= 6 X1 – 2X2


Sujeto a: 10X1 + 10 X2 ≤ 50 Sujeto a: 2X1 – 2X2 ≤ 2
-10X1 - 30 X2 ≥- 90 X1 ≤4
X1, X2 ≥ 0 X1, X2 ≥ 0

7. Maximizar Z=30 X1 + 50 X2 8. Maximizar Z= 60 X1 + 40 X2


Sujeta a: 10 X1 ≤ 40 Sujeto a: 10X1 + 10X2 ≤ 100

20 X2 ≤120 20X1 + 10X2 ≥ 40

30 X1 + 20 X2 = 180 X1, X2 ≥ 0

X1, X2 ≥ 0

9. Maximizar Z= 5 X1 + 2 X2 - X3 10. Maximizar Z= 2 X1 + 3 X2 + X3


Sujeta a: 3X1 – 3X2 + X3 ≥ 6 Sujeta a: X1 + 2X2 + X3 = 1
4X1 + X2 + X3 ≤ 25 X1 + 4X2 + 2X3 = 2
X1, X2 ≥ 0 ; X3= Sin restricción de signo X1, X2, X3 ≥ 0

You might also like