Week 6 - Distributional model Flashcards

1
Q

A special type of an LPP in physical distribution of goods and services coming from several supply locations that are to be delivered to demand centers.

A

Distribution Model

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Two main types of distribution problems:

A
  • Transportation problem
  • Assignment problem
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Involves shipments from several sources to several destinations.

A

Transportation problem

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Objectives of distribution model:

A
  1. Determine the most efficient routes from the supply centers to the
    demand centers
    that would meet the required quantity of goods and services of all destination centers relative to the availability of limited
    supply.

2.** Finding the cheapest shipping schedule **that will satisfy the demand
without the violation of the supply constraints.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

In (date),( person), presented the simplest form of transportation model in his study

A

In 1941, Frank Lauren Hitchcock, presented the simplest form of transportation model in his study

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Frank Lauren Hitchcock, presented the ?

A

“The Distribution of a Product from Several Sources to Numerous Localities.”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

it was further developed by (person) in his work - – - - - - – in —–

A

**Tjalling Charles Koopmans **
“Optimum Utilization of the Transportation System” in 1947.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

**Who **developed the stepping-stone method?

A

Abraham Charnes and William Wager Cooper in 1953

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Abraham Charnes and William Wager Cooper, developed the

A

stepping-stone method.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

The** modified distribution method** was developed in?

A

1955

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Characteristics and Assumption of Transportation Problem

certain sources have limited available quantity or one commodity.

A

Supply or Sources

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Characteristics and Assumption of Transportation Problem

comes from several destinations, such as warehouses, distribution centers, shops, etc.

A

Demand

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Characteristics and Assumption of Transportation Problem

**available at each source **and the demands or
each destination are constant.

A

Quantities

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Characteristics and Assumption of Transportation Problem

it is based on per unit cost of the commodity from the source to each destination. It is usually based on the distance between the two points.

A

Shipping cost

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

. Demand and supply quantities are presented in?

A

whole numbers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

decision must be made if shipping from P1, P2, P3, or a combination should be made to D1

A

Demand constraints

17
Q

Transportation problems are presented in ?

A

Tabular form

18
Q

Source of supply

A

Column

19
Q

demand or destination point

A

row

20
Q

value contains the objective function coefficient of the decision variable

A

Boxed - in

21
Q

3 methods to obtain the initial solution :

A
  1. Northwest Corner Method (NWC)
    2. Greedy Method or Minimum Cost Method (MCM)
    3. Vogel’s Approximation Method (VAM)
22
Q

Obtaining the Initial Solution

is the most simple and logical method. The procedure** begins by allocating units to the upper lefthand** corner and ends in the lower right corner of the transportation table.

A

NWC

23
Q

Obtaining the Initial Solution

  • is a systematized procedure that is easy to use and yields an initial solution that is close to the optimal solution in small problems.
    Obtaining the Initial Solution
A

MCM

24
Q

In this method, the allocation is made to the cell with** the most possible lowest cost or the highest profit **in a maximization case.

A

MCM

25
Q

Obtaining the Initial Solution

is an algorithm that obtains the initial feasible solution by **determining the “penalty cost” **of not using the lowest cost route.
This method results in an optimal or near optimal as an initial solution.

A

VAM