Paper Tayyari

Lecture 31: Transportation Problems

MCQs, short and long questions from lecture 31.Lecture 31 ki MCQs, short aur long sawal.

4 MCQs · 4 short questions · 4 MCQs from past papers4 MCQs · 4 short sawal · 4 MCQs past papers se

Start mock testMock test shuru karein
DoneHal kiye 0/4
– correctsahi
1.
★ Final term 2012

Any set of non negative allocations (Xij > 0) which satisfies the row and column sum is called a ______ solution.

  1. Afeasible
  2. Bnon basic feasible
  3. Cbasic infeasible
  4. Doptimal

Non-negative allocations meeting all supply and demand constraints form a feasible solution.

2.
★ Final term 2012

In which of the following models, Simplex algorithm is not preferred to use due to laborious computations?

  1. ATransportations models
  2. BDegenerate Linear models
  3. CNon-degenerate Linear models
  4. DDual or unbounded linear models

Transportation problems have many variables and constraints, so special methods (NWC, VAM, MODI) replace the laborious simplex.

3.
★ Final term 2012

Transportations models consist of ------- like the production centers and --------- which may be the sales centers.

  1. A(sinks, sources)
  2. B(sources, sinks)
  3. C(origins, sources)
  4. D(sinks, destinations)

Production centres are sources (origins) and sales centres are sinks (destinations).

4.
★ Final term paper (screens, paper 2)

Transportation problem is a special class of linear programming problem in which transport a commodity from the source to a destination in such a way that the total transportation cost is -------.

  1. AZero
  2. BMaximum
  3. CMinimum
  4. DAverage

The transportation problem minimizes total shipping cost while meeting supply and demand.