Scribd
Upload
17 views7 pages

P Lineal

The document describes 4 optimization problems involving linear programming with a solver. Problem 1 involves maximizing a function with 2 variables and 5 constraints. Problem 2 involves minimizing a function with 6 variables and 5 constraints. Problem 3 provides the inputs and constraints for producing 4 products with given material requirements, production rates, volumes, and profits. Problem 4 maximizes a function with 4 variables and 8 constraints.

Uploaded by

FreddCruzado
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
17 views7 pages

P Lineal

The document describes 4 optimization problems involving linear programming with a solver. Problem 1 involves maximizing a function with 2 variables and 5 constraints. Problem 2 involves minimizing a function with 6 variables and 5 constraints. Problem 3 provides the inputs and constraints for producing 4 products with given material requirements, production rates, volumes, and profits. Problem 4 maximizes a function with 4 variables and 8 constraints.

Uploaded by

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

PROGRAMACION LINEAL CON SOLVER

Problema 1
𝐌𝐚𝐱 �=𝟕𝐱𝟏+𝟓𝐱�
s.a. Variables
〖��〗 _𝟏+ 〖��〗 _�≤��� Cantidad
〖��〗 _𝟏+�_�≤𝟏�� Ganancia
〖� .𝟓� 〗 _𝟏+ 〖� .𝟔� 〗 _�≤�𝟔
〖���〗 _𝟏+𝟏��_�≤𝟏���
�_𝟏≤��

Restricciones
�_𝟏, �_�≥
�

Variables X1 X2
Cantidad 1 59 Utilidad
Ganancia 7 5 302

4 3 181 ≤ 240
Restricciones

2 1 61 ≤ 100
0.5 0.6 35.9 ≤ 36
32 10 622 ≤ 1248
40 0 40 ≤ 40

Problema 4

Max B = 70X1+93X2+85X3+110X4
s.a
4X1+3X2+5X3+6X4 ≤ 60000
0,0125X1+0.0111X2+0.0143X3+0,02X4 ≤ 9600
100X1+200X2+100X3+200X4≤ 42000000
X1 ≤ 5000
X1 ≥ 3000
X2 ≥ 2700
X3 ≤ 6400
X3 ≥ 3900
X4 ≤ 4700
X1,X2,X3,X4 ≥ 0

X1 X2 X3 X4
Cantidad 3000 9500 3900 0 Utilidad
Ganancia 70 93 85 110 1425000

4 3 5 6 60000 ≤ 60000
0.0125 0.0111 0.0143 0.02 198.72 ≤ 9600
100 200 100 200 2590000 ≤ 42000000
1 0 0 0 3000 ≤ 5000
1 0 0 0 3000 ≥ 3000
0 1 0 0 9500 ≥ 2700
0 0 1 0 3900 ≤ 6400
0 0 1 0 3900 ≥ 3900
0 0 0 1 0 ≤ 4700
ION LINEAL CON SOLVER

X1 X2 Gasolina G
138 43 Utilidad Beneficio/u 4
103 110 18944

7 10 1396 ≤ 1400
12 8 2000 ≤ 2000
8 10 1534 ≥ 900
6 7 1129 ≥ 300
5 4 862 ≤ 1700
5 4 862 ≥ 800
P S
6 7
PROGRAMACION LINEAL CON SOLVER
Problema 3
𝐌𝐢𝐧 �=𝟏��_𝟏+ 〖𝟏��〗 _�+ 〖𝟏��〗 _�+ 〖𝟏��〗 _�+ 〖���〗 _𝟓+ 〖𝟏𝟔�〗 _𝟔 C
s.a.
�_𝟏+�_�+ 〖��〗 _�+ 〖��〗 _𝟓+�_𝟔≤��
�_𝟏+�_�+ 〖��〗 _�+ 〖��〗 _𝟓+�_𝟔≥�𝟔
�_𝟏+ 〖��〗 _�+�_�+�_�+�_𝟓≥�𝟓
�_�+��_�+ 〖��〗 _𝟓+ 〖��〗 _𝟔≥��
�_𝟏+�_�+≤𝟏�

�_𝟏≥0, i=1, .......,6

Variables X1 X2 X3 X4 X5 X6
Utilidad
Cantidad 6 8 1 2 0 6
Ganancia 10 14 12 18 20 16 316

1 1 0 3 2 1 26 ≤ 32
Restricciones

1 1 0 3 2 1 26 ≥ 26
1 2 1 1 1 0 25 ≥ 25
0 2 2 0 2 2 30 ≥ 30
1 0 0 1 0 1 14 ≥ 14

Problema 4
Necesidades
Max B = 70X1+93X2+85X3+110X4 Materia prima. (dag/u)
s.a Tasas produc. (u/minuto)
4X1+3X2+5X3+6X4 ≤ 60000 Volumen (Cm^3/u)
0,0125X1+0.0111X2+0.0143X3+0,02X4 ≤ 9600 Beneficio/ pieza (ptas/u)
100X1+200X2+100X3+200X4≤ 42000000
X1 ≤ 5000
X1 ≥ 3000
X2 ≥ 2700
X3 ≤ 6400
X3 ≥ 3900
X4 ≤ 4700
X1,X2,X3,X4 ≥ 0

variables X1 X2 X3 X4
Utilidad
Cantidad 3000 9500 3900 0
Ganancia 70 93 85 110 1E+06

4 3 5 6 60000 ≤ 60000
0.0125 0.0111 0.0143 0.02 198.72 ≤ 9600
tricciones
100 200 100 200 3E+06 ≤ ###
Restricciones 1 0 0 0 3000 ≤ 5000
1 0 0 0 3000 ≥ 3000
0 1 0 0 9500 ≥ 2700
0 0 1 0 3900 ≤ 6400
0 0 1 0 3900 ≥ 3900
0 0 0 1 0 ≤ 4700
N SOLVER

Vitaminas Coste por


Alimentos
A B C D unidad
1 1 1 0 1 10
2 1 2 1 0 14
3 0 1 3 0 12
4 3 1 0 1 18
5 2 1 2 0 20
6 1 0 2 1 16

Necesidades Panchos Congos Roscas Tunos


Materia prima. (dag/u) 4 3 5 6
Tasas produc. (u/minuto) 800 90 70 50
Volumen (Cm^3/u) 100 200 100 200
Beneficio/ pieza (ptas/u) 70 93 85 110
Demandas
Mínima Máxima
Panchos 3000 5000
Congos 2700 -
Roscas 3900 6400
Tunos - 4700

You might also like