GATE ME 2024 | Transportation Question 1 | Industrial Engineering

GATE ME 2024

Numerical

-0

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).

Your input ____

GATE ME 2017 Set 2

MCQ (Single Correct Answer)

-0.6

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. GATE ME 2017 Set 2 Industrial Engineering - Transportation Question 4 English

GATE ME 2017 Set 2 Industrial Engineering - Transportation Question 4 English

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

$$0$$

$$15$$

$$35$$

$$28$$

GATE ME 2008

MCQ (Single Correct Answer)

-0.6

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

$$mn$$

$$2(m+n)$$

$$m+n$$

$$m+n-1$$

GATE ME 2005

MCQ (Single Correct Answer)

-0.6

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

$$2,4,90$$

$$2,4,110$$

$$3,4,90$$

$$3,4, 110$$