Scribd
Upload
33 views1 page

Problemas de Aplicación 02

The document provides instructions to solve 12 linear programming problems by either graphically for problems 1-2 or using Solver for problems 3-6 and Lindo for problems 7-12. The problems involve maximizing or minimizing a linear objective function subject to various linear inequality constraints, and reporting the optimal solution.

Uploaded by

Madai Arellano
Copyright
© Attribution Non-Commercial (BY-NC)
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
33 views1 page

Problemas de Aplicación 02

The document provides instructions to solve 12 linear programming problems by either graphically for problems 1-2 or using Solver for problems 3-6 and Lindo for problems 7-12. The problems involve maximizing or minimizing a linear objective function subject to various linear inequality constraints, and reporting the optimal solution.

Uploaded by

Madai Arellano
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 1

MTODOS: GRFICO y SOLVER

Resolver grficamente los problemas 1 y 2.


Resolver con Solver los problemas del 3 al 6.
1.

2.

3.

F.O.:
S.A.:

Max Z = 100X1 + 200X2


4X1 + 2X2 < 16
8X1 + 8X2 < 16
2X2 < 10
X1, X2 > 0
Rpta. X1 = 0; X2 = 2; Z = 400
F.O.:
Max Z = 4000X1 + 3000X2
S.A.:
X1 + X2 < 80
30 000X1 + 20 000 X2 < 1 800 000
Rpta. X1 = 20; X2 =60; Z = 260,000
F.O.:
S.A.:

Max Z 0 3X1 + 2 X2
2 X1 + X2 18
2 X1 + 3 X2 42
3 X1 + X2 24
X1 0, X2 0
Rpta. X1 = 3; X2 =1 2; Z =33

4. F.O.:
S.A.:

Max Z = X1 + 2X2
2X1 + X2 < 4
X1 - X2 < 6
X1, X2 > 0
Rpta. X1 = 0; X2 = 4; Z = 8

5. F.O.:
S.A.:

Min Z = 3X1 + X2
X1 + 2X2 > 5
X1 +
X2 > 2
X1, X2 > 0
Rpta. X1 = 0; X2 = 2.5; Z = 2.5

6. F.O.:
S.A.:

Max Z = 40X1 + 60X2 + 50x3


10X1 + 4X2 + 2X3 < 950
X1 + 2X2
< 410
X1
+ 2X3 < 610
X1, X2 , X3 > 0
Rpta. X1 = 0; X2 = 85; X3 = 305; Z = 20,350

Resolver con Lindo los problemas del 7 al 12


7. F.O.:
S.A.:

Max Z = 8X1 + 5X2


2X1 + X2 < 10
X1 + 3X2 < 18
5X1 + X2 < 4
X1, X2 > 0
Rpta. X1 = 0; X2 =4; Z = 20

8. F.O.:
S.A.:

Min Z = 2X1 + 3X2


X1 + X2 > 13
2X1 + X2 > 18
X1 + 3X2 > 21
X1 + 2X2 > 18
X1, X2 > 0
Rpta. X1 = 8; X2 = 5; Z =31

9. F.O.:
S.A.:

Max Z = 4X1 - 2X2


X1 + X2 < 7
2X1 + X2 < 4
X1, X2 > 0
Rpta. X1 = 2; X2 = 0; Z = 8

10. F.O.:
S.A.:

Max Z = X1 + 2X2
X1 - X2 < 8
X1 + 2X2 < 4
X1, X2 > 0
Rpta. X1 = 0; X2 = 2; Z = 4

11. F.O.:
S.A.:

Max Z = 2X1 + 3X2


2X1 + X2 < 13
X1 - 3X2 < 3
X1, X2 > 0
Rpta. X1 = 0; X2 = 13; Z = 39

12. F.O.:
S.A.:

Max Z = X1 - X2 + x3
2X1 - X2 < 4
X1 - X3 < 6
X2 + X3 < 8
X1, X2 , X3 > 0
Rpta. X1 = 2; X2 = 0; X3 = 8; Z = 10

You might also like