0% found this document useful (0 votes)
4 views17 pages

Lingo Practise

The document outlines various optimization problems related to production, resource allocation, and cost minimization across different scenarios, including manufacturing, food supply, and logistics. Each section presents mathematical models with objective functions, constraints, and decision variables aimed at maximizing profits or minimizing costs. The problems range from maximizing production of golf bags and chocolates to optimizing distribution networks for electronics and meal planning for nutritional needs.

Uploaded by

Devarsh Kotecha
Copyright
© All Rights Reserved
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
0% found this document useful (0 votes)
4 views17 pages

Lingo Practise

The document outlines various optimization problems related to production, resource allocation, and cost minimization across different scenarios, including manufacturing, food supply, and logistics. Each section presents mathematical models with objective functions, constraints, and decision variables aimed at maximizing profits or minimizing costs. The problems range from maximizing production of golf bags and chocolates to optimizing distribution networks for electronics and meal planning for nutritional needs.

Uploaded by

Devarsh Kotecha
Copyright
© All Rights Reserved
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

Q.1.

max=10*x;
5*x<=40;

Q.2 • Par, Inc.’s production is constrained by a limited number

of hours available in each department. The director of

manufacturing estimates that 630 hours for cutting and

dyeing, 600 hours for sewing, 708 hours for finishing, and

135 hours for inspection and packaging will be available

for the production of golf bags during the next three

months.

• The accounting department analyzed the production data

and arrived at prices for both bags that will result in a

profit contribution of $10 for every standard bag and $9 for

every deluxe bag produced.

Ans.
MAX = 10*S + 9*D;

(7/10)*S + 1*D <= 630;


(1/2)*S + (5/6)*D <= 600;
1*S + (2/3)*D <= 708;
(1/10)*S + (1/4)*D <= 135;

S >= 0;
D >= 0;

END
Q.3 A startup produces two types of chocolates, A and B, using Milk

and Choco as resources. Each SKU unit of chocolate A requires 1

SKU unit of Milk and 3 SKU units of Choco, while each SKU unit of

chocolate B requires 1 SKU unit of Milk and 2 SKU units of Choco.

The store has a total of 5 SKU units of Milk and 12 SKU units of

Choco. The profit is Rs 6000 per SKU unit for A and Rs 5000 per

SKU unit for B. The company wants to maximize profit.

What is your suggestion to the company?


How many units of A and B should it produce respectively?

Max=6000*x+5000*y;
1*x+1*y<=5;
3*x+2*y<=12;

x>=0;
y>=0;
end

Q.
Min=2*A+3*B;

A>=125;
A+B>=350;
2*A+B<=600;
A>=0;
B>=0;

end

Q.4
max=0.06*x+0.08*y+0.10*z;

x+y+z=200000;
x>=50000;
y>=50000;
z>=50000;

x>=y;
x>=0;
y>=0;
z>=0;

end

Q.5
If the both type of workers make 580 radios in the factory, does the company need more
workers as compare to the 360-radio situation? Justify your answer.
A-1
max=w;

w+a<=30;
24*w+10*a>=360;
w>a;
w<2*a;
w>=o;
a>=0;
end

A-2

max=w;

w+a<=30;
24*w+10*a=580;
w>a;
w<2*a;
w>=o;
a>=0;
end

Q.6
Mrs. Mehta is a cost-conscious homemaker responsible for planning her family’s daily meals.
While she is highly aware of nutritional needs, she is equally concerned about controlling
household expenses due to rising food prices. To balance nutrition and cost, she decides to
rely on only two fresh food items that are easily available in the local market.

Each food item provides essential vitamins required for good health, namely Vitamin A,
Vitamin B, and Vitamin C. Nutritionists have recommended minimum daily intake levels for
these vitamins to ensure the well-being of her family.

The nutritional contribution per ounce of each food item is given below:

Food Item Vitamin A (units) Vitamin B (units) Vitamin C Cost (pence/ounce)


(units)
Food 1 8 5 2 3
Food 2 3 6 9 2

Daily Nutritional Requirements is to maintain a healthy diet, the family must consume at
least:

 24 units of Vitamin A
 30 units of Vitamin B
 18 units of Vitamin C

Decision Problem, help Mrs. Mehta wants to determine:

How many ounces of each food item should be purchased daily so that all nutritional
requirements are met at the lowest possible cost

min=3*x+2*y;

8*x+3*y>=24;
5*x+6*y>=30;
2*x+9*y>=18;

x>=0;
y>=0;

end

Q.7
MAX = 0.073*A + 0.103*P + 0.064*M + 0.075*H + 0.045*G;

A+P<=50000;
M+H<=50000;
G>=0.25*(M+H);
P<=0.6*(A+P);
A+P+M+H+G=100000;

end
Q.8
Each daytime TV (DTV) advertisement is rated at 65 exposure quality units. Evening TV
(ETV) is rated at 90 exposure quality units, daily newspaper (DN) rated at 40 exposure
quality units, Sunday newspaper (SN) rated at 60 exposure quality units, and radio (R) rated
at 20 exposure quality units.
Model the problem mathematically (DV, OF, Constraints)
Solve the model using appropriate method and tool.
Answer the optimal allocations.

Max=65*D+90*E+40*DN+60*SN+20*R;

1500*D+3000*E+400*D+1000*SN+100*R<=30000;
D+E>=10;
1000*D+2000*E+1500*DN+2500*SN+300*R>=50000;
1500*D+3000*E<=18000;

D<=15;
E<=10;
DN<=25;
SN<=4;
R<=30;

end
Q.9

max=10*T+15*A;
282*T+400*A<=2000;
4*T+40*A<=140;
T<=5;

@Gin(T);
@Gin(A);

End
Q.10

max=90*P + 40*W + 10*M + 37*R;


15*P + 10*W + 10*M + 15*R<=40;
20*P + 15*W + 10*R<=50;
20*P + 20*W + 10*R<=40;
15*P + 5*W + 4*M + 10*R<=35;

@bin(P);
@bin(W);
@bin(M);
@bin(R);

End
Q.11

max=40*F+30*S;
2/5*F+1/2*S<=20;
1/5*S<=5;
3/5*F+3/10*S<=21;

F>=0;
S>=0;

End
Q.12

max=40*F + 30*S + 50*C - 200*SF - 50*SS - 400*SC;


2/5*F + 1/2*S + 6/10*C<=20;
1/5*S + 1/10*C<=5;
3/5*F + 3/10*S + 3/10*C<=21;

F<=50*SF;
S<=25*SS;
C<=40*Sc;

@bin(SF);
@bin(SS);
@bin(SC);
End
Q.13
Case-2: Strategic Logistics Optimization: A Transshipment Dilemma for
Ryan Electronics
In the intricate landscape of electronic manufacturing, Ryan Electronics stands as a beacon of
innovation with its production facilities situated in Denver and Atlanta. However, the
company grapples with a profound logistical challenge - optimizing its distribution network.
Components produced at either facility may be shipped to either of the firms regional
warehouse which are located in Kansas City and Louisville. From the original warehouse the
farm supplies retail outlets in Detroit Miami Dallas and New Orleans. The key feature of the
problem are shown in the network model depicted in figure shown below. Note that the
supply at each origin and demand at each destination are shown in left and right margins.
Nodes 1 and 2 are original nodes, while node 3 and 4 are transshipment nodes and node 5, 6,
7 and 8 are the destination nodes.

The transportation cost per unit of each distribution route is shown in table below. The
strategic imperative is clear – to craft an academically sound narrative elucidating the optimal
network configuration, mathematically model the logistical pathways, attain an optimized
solution minimizing transportation costs, and subsequently, recommend the quintessential
configuration for the distribution network. The capacity at are Denver – 600 and Atlanta –
400. The requirement at Detroit is 200, Miami-150, Dallas 350, New Orleans 300
respectively.

Important tasks need to be done by manager.


Network Mapping:
Identify the network structure, defining nodes and connections.
Map the flow of components from production to retail nodes.
Mathematical Modeling:
Formulate a mathematical model representing the Transshipment Problem.
Include variables, constraints, and the objective function for optimization.
Optimization Solution:
Minimize transportation costs while meeting supply and demand requirements.
Use Lingo software to solve the model.
Configuration Recommendation:
Suggest the optimal configuration for Ryan Electronics' distribution network.

MODEL:

! Objective function;
MIN =
2*x13 + 3*x14 + 3*x23 + x24
+ 2*x35 + 6*x36 + 3*x37 + 6*x38
+ 4*x45 + 4*x46 + 6*x47 + 5*x48;

! Supply constraints;
x13 + x14 <= 600;
x23 + x24 <= 400;

! Demand constraints;
x35 + x45 = 200;
x36 + x46 = 150;
x37 + x47 = 350;
x38 + x48 = 300;

! Transshipment (flow balance) constraints;


x13 + x23 = x35 + x36 + x37 + x38;
x14 + x24 = x45 + x46 + x47 + x48;

! Non-negativity;
x13 >= 0; x14 >= 0; x23 >= 0; x24 >= 0;
x35 >= 0; x36 >= 0; x37 >= 0; x38 >= 0;

end
1st part

MODEL:

! Decision variables;
! x(i,j) = units shipped from origin i to destination j;

MIN =
3*x11 + 2*x12 + 7*x13 + 6*x14
+ 7*x21 + 5*x22 + 2*x23 + 3*x24
+ 2*x31 + 5*x32 + 4*x33 + 5*x34;

! Supply constraints;
x11 + x12 + x13 + x14 = 5000; ! Cleveland
x21 + x22 + x23 + x24 = 6000; ! Bedford
x31 + x32 + x33 + x34 = 2500; ! York

! Demand constraints;
x11 + x21 + x31 = 6000; ! Boston
x12 + x22 + x32 = 4000; ! Chicago
x13 + x23 + x33 = 2000; ! St. Louis
x14 + x24 + x34 = 1500; ! Lexington

! Non-negativity;
x11>=0; x12>=0; x13>=0; x14>=0;
x21>=0; x22>=0; x23>=0; x24>=0;
x31>=0; x32>=0; x33>=0; x34>=0;

END
Q.14
Falmingo

MAX = 90 * T1 + 55 * T2 + 25 * R1 + 20 * R2 + 10 * N1 + 5 * N2;

10000 * (T1 + T2) + 3000 * (R1 + R2) + 1000 * (N1 + N2) <= 279000;

4000 * T1 + 1500 * T2 + 2000 * R1 + 1200 * R2 + 1000 * N1 + 800 * N2 >= 100000;

(R1 + R2) >= 2 * (T1 + T2);

T1 + T2 <= 20;

10000 * (T1 + T2) >= 140000;

3000 * (R1 + R2) <= 99000;

1000 * (N1 + N2) >= 30000;

T1 <= 10;

R1 <= 15;

N1 <= 20;

@GIN(T1); @GIN(T2);

@GIN(R1); @GIN(R2);

@GIN(N1); @GIN(N2);
END

You might also like