Professional Documents
Culture Documents
Operations research
Author's note:
1|Page
Linear Programming
The Colombian trading company currently has 2 types of trucks to transport goods to
southern Colombia during the week, Truck D (truck model is 2 trucks whose gross
vehicle weight is 48 tons) and truck E (truck model is 3 trucks whose gross vehicle
weight is 52 tons) is required to transport during the week 900 tons of goods of truck
D 1500 tons of truck E, and there are 6 trucks of 2 trucks each one whose gross
vehicle weight is 48 tons.(truck model is 3 trucks with a gross vehicle weight of 52
tons) is required to transport during the week 900 tons of merchandise of truck D
1500 tons of truck E, and there are 6 trucks of 2 trucks each one whose average cost
for the company is $ 3.000.000 per trip and the 3 trucks of 6 trucks with a capacity of
52 tons and a cost per freight of $3.500.000.
How many trips should each truck model make to achieve higher freight profits for
the company?
Information
CE 52 tons
48 tons
2|Page
Linear Programming
Approach
Model (Primal)
SUJETA:
X1, X2 > 0
3|Page
Linear Programming
4|Page
Linear Programming
Note: It is assumed that each truck can be used only once. Therefore, the expression
"truck used" is equivalent to trip made.
2 .state the linear programming problem and solve the following exercise:
A food company has two plants. Plant A produces 100 packs of cookies, 200
chocolate bars and 400 mints daily. Plant B produces 200 units of each of the three
classes. The company needs 700 packs of cookies, 1300 chocolate bars and 1500
mints for a particular customer requirement. Plant A spends
$500,000 and B $750,000 to produce. How many days should they work at each plant
to keep the production cost of the order to a minimum?
Approach
5|Page
Linear Programming
X2= number of days to reach production plant B
Model (Primal)
SUJETA:
X1, X2 > 0
6|Page
Linear Programming
7|Page
Linear Programming
8|Page
Linear Programming
R/ The solution that arises after the application of the exercise is as follows, for our
plant A we would work 6 days and plant B would not produce since its costs are high
and we must minimize, in this way the cost variable takes the lowest value which
would be Z= 3375.
9|Page
Linear Programming
Bibliography
Alvarado Boirivant, J. (07 de 04 de 2008). LA PROGRAMACIÓN LINEAL APLICACIÓN DE
LA PEQUEÑAS Y MEDIANAS EMPRESAS. Obtenido de LA PROGRAMACIÓN
LINEAL APLICACIÓN DE LA PEQUEÑAS Y MEDIANAS EMPRESAS:
https://www.redalyc.org/pdf/729/72912559007.pdf
GUILLERMO JIMÉNEZ LOZANO, V. M. (02 de 04 de 2007). CIEN PROBLEMAS DE
PROGRAMACIÓN LINEAL . Obtenido de CIEN PROBLEMAS DE
PROGRAMACIÓN LINEAL :
file:///D:/Mis%20Documentos/Documentos/2019%20area%20andina
%207%20semestre/segundo%20Bloque/investigacion%20de%20operaciones/
3%20eje/CIEN%20PROBLEMAS%20DE%20PROGRAMACIÓN%20LINEAL-
4.pdf
lineal., U. P.-P. (07 de 04 de 2004). Universidad Peruana Unión -Programación lineal.
Obtenido de Universidad Peruana Unión -Programación lineal.:
https://www.monografias.com/trabajos89/historia-programacion-lineal/historia-
programacion-lineal.shtml
10 | P a g e
Linear Programming
11 | P a g e
Linear Programming
12 | P a g e