Problem Solving in Operational Research
Translated by
ScribdTranslationsProblem Solving in Operational Research
Translated by
ScribdTranslationsTECHNOLOGICAL UNIVERSITY OF PERU
THEME:
Week 18 - Topic 1: Task - Problem Solving in Modeling
COURSE:
OPERATIONAL INVESTIGATION
STUDENT:
LUIS CAMPOS CARBONEL – U20308795
TEACHER
ARTURO BURGA NORIEGA
LIMA - PERU
2023
Operational Research
Final Project - Problem Solving in Modeling
----------------------------------------------------------------------------------------------------------------------------------
Pregunta 1: BINARIAS (10 PUNTOS)
Enigma Manufacturing has three plants: Lurín (PL1), Ventanilla (PL2), and Santa Clara.
(PL3) that produce the same type of product. Any of these plants can
to supply any of the three distribution centers: Surco (CD1), Cercado (CD2) and
Santa Anita (CD3). Likewise, from any distribution center, it can be served.
to any of four clients (C1, C2, C3, and C4) who have placed their order for
the next season, for which the following information is available for each
client:
C1 C2 C3 C4
Selling price 1900 1920 1960 1950
Minimum amount to 12 14 10 12
deliver
Maximum amount to 20 24 20 24
deliver
It is not mandatory to attend to all customers. But if you decide to attend to a customer, you
must be delivered between the minimum and maximum. The delivery of a fraction is not allowed.
units.
The production capacity of the Lurín, Ventanilla, and Santa Clara plants is 28, 30
and 25 units respectively. Distribution centers can receive up to 17, 20
and 22 units respectively. The transportation cost from the plants to the
Distribution centers are fixed, in case transportation is carried out.
Fixed transportation cost ($)
Surco CD2: Enclosure CD3: Santa
Anita
Lurín 500 580 600
Window 520 520 600
PL3: Santa Clara 520 560 560
The transportation cost from any distribution center to any customer is
very similar, which is why it will not be taken into account in the programming model.
However, there is a limit to transport capacity.
Capacidad de transporte (unidades)
C1 C2 C3 C4
CD1: Surco 8 5 8 5
CD2: Enclosure 9 6 8 9
CD3: Santa Anita 5 10 8 7
Operations Research
The model that represents the situation of the factory is as follows:
Note: previously determine m, n, and p and the value of M, as well as the type of objective.
Formulate the model in a compact syntax that allows finding the solution for it.
What present the following information:
a)(2 points) Indicate the indices and the decision variables properly
identified [include the units], in compact algebraic syntax.
SOLUTION:
Índices:
i= PL1 (Plant 1), PL2 (Plant 2), PL3 (Plant 3);
j = CD1 (Distribution Center 1), CD2 (Distribution Center 2), CD3 (Distribution Center 3);
k= C1 (Store Customer 1), C2 (Store Customer 2), C3 (Store Customer 3), C4 (Store Customer
4)
Variables:
Xij = Cantidad a enviar de la Planta “i” al Centro de Distribución “j”
Yjk= Amount to be sent from Distribution Center 'j' to the customer's store 'k'
b) (6 points) Present the complete model in compact lingo syntax [codes
editables]. Note: it will not be considered valid if submitted in photo or in
link binding; just write or copy and paste from your lingo [sets/data: 2
points; objective function: 2 points; constraints and definition of variables: 2 points.
SOLUTION
MODEL:
!i:PL1,PL2,PL3 (plants);
!j:CD1,CD2,CD3 (distributors);
!k:C1,C2,C3,C4 (stores);
SETS:
plant/PL1..PL3/: capacity_plan, production_cost;
distributor/1..3/:capacity_dis;
tienda/1..4/:demandamin, demandamax, preciov;
PD(plant, distributor): x, costransp_1;
DT(distributor, store): and;
ENDSETS
DATA:
capacidad_pla= 28 30 25;
capacidad_dis= 17 20 22;
costprod= 18 17 15;
demandamin=12 14 16 12;
Operational Research
demandamax=20 24 20 24;
preciov= 1900 1920 1960 1950;
costransp_1= 500 580 600
520 520 600
520 560 560
ENDDATA
MAX = @SUM(DT(j,k):price(k)*y(j,k))
-@SUM(PD(i,j):costransp_1(i,j)*x(i,j)+costprod(i)*x(i,j));
@for(plant(i):@sum(distributor(j):x(i,j))<=plant_capacity(i));
@for(distributor(j):@sum(plant(i):x(i,j))<=capacity_dis(j));
@for(store(k):@sum(distributor(j):y(j,k))>=minDemand(k));
@for(store(k):@sum(distributor(j):y(j,k))<=maxdemand(k));
y(1,1) <= 8;
y(1,2) <= 5;
y(1,3) <= 8;
y(1,4) <= 5;
y(2,1) <= 9;
y(2,2) <= 6;
y(2,3) <= 8;
y(2,4)<= 9;
y(3,1) <= 5;
y(3,2) <= 10;
y(3,3) <= 8;
y(3,4)<= 7;
@for(distributor(j):@sum(plant(i):x(i,j))=@sum(store(k):y(j,k)));
END
c) (2 points) Present your best and comprehensive administrative report and interpret it.
the margins and some interpretation of relevant constraint of the model (NO
present the LINGO report; for your answer to be valid); the professor will run
the model presented in the previous point and its response must match).
SOLUTION:
Operational Research
Cap. Production.- Plants 1, 2, and 3 have not used their full production capacity remaining
available to manufacture 11, 10, and 3 units of product (slacks)
Distribution Center. - The distribution centers have a '0' buffer, that is; they have used all their
capacity.
Minimum Amount to Deliver. - The minimum required was delivered to clients C1 and C2.
Maximum Quantity to Deliver. -Customer C3 has no more pending items, the maximum has been delivered.
required.
Available Transfer Capacity. -The routes CD1-C2, CD1-C3, CD2-C4, CD3-C1, CD3-C3; used
all its transportation capacity.
Balances. -Balances 1, 2 and 3 were completed in their entirety.
Operational Research
PREGUNTA 2: METAS (10 PUNTOS)
A company produces products A and B, which leave a profit of 20 and 15.
dollars per unit respectively. Producing one unit of products A and B requires
of 1 and 2 hours-machine respectively, there are 2 machines available. Work is done 2
8-hour shifts. The cost of the necessary advertising per unit sold of the
Products A and B are 2 and 3 soles respectively, a budget of 500 soles has been allocated.
for advertising. A contract is in place to supply a client with 400 units of the
product A and 500 units of product B.
Goal 1: Obtain a profit of 3000 soles.
Goal 2: Make the machines work at 100%.
Goal 3: Do not exceed the advertising budget.
Meta 4: Strictly fulfill the orders
Hours Prod.
Products Machine Advertising Cost.
Minimum Utility
A 1 2 400 20
B 2 3 500 15
Availability 16 500
SOLUTION:
Data:
Variables:
X1 = Cantidad a producir del producto 1
X2 = Cantidad a producir del producto 2
Objective function:
Min Z = d1p + d1n + d2p + d2n + d3p + d4p + d4n + d5p + d5n
Restrictions:
Operations Research
In PL: 20X1 + 15X2 = 3000
META 1: 20X1 + 15X2 + d1p - d1n = 3000
In PL: X1 + 2X2 = 16
META 2: X1 + 2X2 + d2p - d2n = 16
In PL: 2X1 + 3X2 <= 500
META 3: 2X1 + 3X2 + d3p - d3n = 500
In PL: X1=400
X2=500
META 4 X1 + d4p - d4n = 400
X2 + d5p - d5n = 500
X1, X2, dp1,dp2,dp3,dp4,dp5,dn1,dn2,dn3,dn4,dn5 >= 0
IN LINGO:
SOLUTION REPORT
Operational Research
Where from:
X1 = 50 → Producir 50 unidades del Producto A
X2 = 133.3333 → Produce 133.3333 units of Product B
Operational Research