00:01
In this problem, it is given that a computer supplier has two warehouses, one in los angeles denoted as la and other in san francisco denoted as sf.
00:17
And in los angeles, there are 70 units available.
00:22
And in san francisco there are 80 units and the supplier receives orders from two customers, one from frenzo, denoted as f, and the number of orders is for 50 units, and other from san luis obisvon, denoted as slo, and the order is for 60 units, and also the cost per unit for shipment is from la to france so the cost is 1, from la to slo, the cost is 2, from san francisco to french so the cost is 3 and from san francisco to slo the cost is 4.
01:19
We are asked to formulate a linear programming program denoted as lpp in order to decide the number of units from each warehouse that has to be shipped in order to minimize the total shipping cost.
01:41
Now x1 units be shipped from la to france.
01:49
So x2 units be shipped from la to france.
01:50
So x2 units be shipped from la to france.
01:54
To slo, x3 units be shipped from san francisco to france, so and x4 units be shipped from san francisco to slo.
02:04
Then we have the cost function denoted as c is equal to cost per unit for transportation from l .a.
02:14
To france, so times the number of units x1 plus the cost per unit for transportation from l .a.
02:21
To slo times the number of units x1.
02:24
So 2x2...