Transportation · Industrial Engineering · GATE ME

Marks 1

If there are $$m$$ sources and $$n$$ destinations in a transportation matrix, the total number of basic variables in a basic feasible solution is

GATE ME 2014 Set 2

Marks 2

In a supplier-retailer supply chain, the demand of each retailer, the capacity of each supplier, and the unit cost in rupees of material supply from each supplier to each retailer are tabulated below. The supply chain manager wishes to minimize the total cost of transportation across the supply chain:

	Retailer I	Retailer II	Retailer III	Retailer IV	Capacity
Supplier A	11	16	19	13	300
Supplier B	5	10	7	8	300
Supplier C	12	14	17	11	300
Supplier D	8	15	11	9	300
Demand	300	300	300	300

The optimal cost of satisfying the total demand from all retailers is _____ rupees (answer in integer).

GATE ME 2024

A product made in two factories $$P$$ and $$Q,$$ is transported to two destinations, $$R$$ and $$S.$$ The per unit costs of transportation (in Rupees) from factories to destinations are as per the following matrix.

Factory $$P$$ produces $$7$$ units and factory $$Q$$ produces $$9$$ units of the product. Each destination requires $$8$$ units. If the north-west corner method provides the total transportation cost as $$X$$ (in Rupees) and the optimized (the minimum) total transportation cost $$Y$$ (in Rupees), then $$(X$$-$$Y),$$ in Rupees, is

GATE ME 2017 Set 2

For the standard transportation linear programme with $$m$$ sources and $$n$$ destinations and total supply equaling total demand, an optimal solution (lowest cost) with the smallest number of non-zero $${X_{ij}}$$ values (amounts from source $$i$$ to destination $$j$$) is desired. The best upper bound for this number is

GATE ME 2008

A company has two factories $${S_1},$$ $${S_2}$$ and two warehouses $${D_1},$$ $${D_2}$$ . the supplies from $${S_1}$$ and $${S_2}$$ are $$50$$ and $$40$$ units respectively. Warehouse $${D_1},$$ requires a minimum of $$20$$ units and a maximum of $$40$$ units. Warehouse $${D_2},$$ requires a minimum of $$20$$ units and, over and above, it can take as much as can be supplied. A balanced transport-ation problem is to be formulated for the above situation. The number of supply points, the number of demand points, and the total supply (or total demand) in the balanced transportation problem respectively are

GATE ME 2005

The supply at three sources is $$50, 40$$ and $$60$$ units respectively whilst the demand at the four destinations is $$20, 30, 10$$ and $$50$$ units. In solving this transportation problem

GATE ME 2002

Marks 5

Given below is a basic feasible solution to a transportation problem with three supply points $$(A,B,C)$$ and three demand points $$(P, Q, R)$$ that minimizes cost of transportation in the standard tabular format.

$$(a)$$$$\,\,\,\,\,\,\,\,$$ Compute the cost corresponding to the present solution
$$(b)$$$$\,\,\,\,\,\,\,\,$$ It is optimal?
$$(c)$$$$\,\,\,\,\,\,\,\,$$ Does an alternate optimum exist ?

GATE ME 2000

A company rents three warehouses $$A, B$$ and $$C$$ from which they supply bearings to two customers $$P$$ and $$Q.$$ The profit per piece, the annual demands of the customers and the supplies available from the warehouses are shown below:

As the company is not able to meet the demands, it is proposed to replace warehouse $$C$$ with a warehouse rented at $$D$$ whose supply capacity would be $$5000.$$ The expected profit would be Rs.$$6$$ and Rs.$$5$$ per piece distributed to $$P$$ and $$Q$$ respectively. The rental charges for warehouse $$D$$ is Rs.$$5,000$$ per year. Find the increase in the profit of the company after replacing warehouse $$C$$ by $$D.$$

GATE ME 1997