Académique Documents
Professionnel Documents
Culture Documents
Sheeba Apparels ltd has 3 warehouses across the country i.e. Ahmedabad, Surat,
and Jamnagar.The cost incurred in transporting the products from warehouses to
the retail centre located at Mumabai, Delhi, Kolkata and Chennai varies. Find the
optimum quantity to be transferred from warehouses to each retail outlets. The cost
incurred from Ahmedabad to Mumbai, Delhi, Kolkata and Chennai are 1000, 2000,
1000 and 4000 respectively. The cost incurred to transport materials from Surat to
Mumbai, Delhi, Kolkata and Chennai are Rs 3000, Rs 3000, Rs 2000 and Rs 500.
Similarly from Jamnagar the cost incurred is Rs 4000 , Rs 3000, Rs 5000 and Rs
9000 respectively. Ahmedabad can maximum supply 30 units in a day. Surat can
supply 50 units per day and Jamnagar can supply 20 units per day.Similarly the
daily demand from Mumbai, Delhi, Kolkata and ZChennai are 20, 40 30 10.Solve the
following transportation problem
transportation manufacturing.tra
Minimize Z=
X11+2X12+X13+4X14+3X21+3X22+2X23+X24+4X31+2X32+5X33+9X34
Constraints
X11+X12+X13+X14<=30
X21+X22+X23+X24<=50
X31+X32+X33+X34<=20
X11+X21+X31>=20
X12+X22+X32>=40
X13+X23+X33>=30
X14+X24+X34>=10
X11,X12,X13,X14,X21,X22,X23,X24,X31,X32,X33,X34>=0
Answers
MDLR Airlines can buy its jet fuel from any one of three vendors. 100000 At
Chandigarh, 180,000 gal at Delhi, and 350,000 gal at Kolkata. Each vendor can
supply fuel to each airport at a price (in cents per gallon) given by the following
schedule.
Each vendor however is limited in the total number of gallons it can provide during
any one month. These capacities are 320000 gal for vendor 1, 270000 gal for
vendor 2, 190000 gal for vendor 3. Determine a purchasing policy that will supply
the airline’s requirement at each airport at minimum total cost.
So by balancing it
transportation services.tra
Minimize Z= 92
X11+89X12+90X13+91X21+91X22+95X23+87X31+90X32+92X33
Constraints
X11+X12+X13+X14<=320000
X21+X22+X23+X24<=270000
X31+X32+X33+X34<=190000
X11+X21+X31>=100000
X12+X22+X32>=180000
X13+X23+X33>=350000
X14+X24+X34+X44>=150000
X11,X12,X13,X14,X21,X22,X23,X24,X31,X32,X33,X34,X41,X42,X43,X44>=0
Linear Programming Problems:
Question 1:
Solution:
Material Manganese(%) Silicon(%) Carbon(%P
)oundsavailable Cost/pound
Alloy1 70% 15% 3% 999999999 0.12
Alloy2 55% 30% 1% 300 0.13
Alloy3 12% 26% 0% 999999999 0.15
Iron1 1% 10% 3% 999999999 0.09
Iron2 5% 2.5% 0% 999999999 0.07
Carbide1 0% 24% 18% 50 0.1
Carbide2 0% 25% 20% 200 0.12
Carbide3 0% 23% 25% 100 0.09
Material MinimumPercenM
taa
gx
eimumPercentage
Alloy1 0.0 Manganese 2.30% Manganese 2.1% 2.3%
Alloy2 0.0 Silicon 9.72% Silicon 4.3% 10.0%
Alloy3 0.0 Carbon 5.05% Carbon 5.1% 5.4%
Iron1 915.4
Iron2 736.9
Carbide1 50.0
Carbide2 197.7 Cost 171.692308
Carbide3 100.0
2000 2000
Question 2:
Constraints:
Solution:
Constraints:
x1 + x2 + x3 + x4 <= 300
- Constraint 1:
- Constraint 2:
- Constraint 3:
0.14x1 + 0.20x2 + 0.20x3 + 0.10x4 <= 0.15(x1 + x2 +
x3 )
• Objective