The General Structure Of The Problem Economics Essay

One of the earliest applications of additive scheduling technique has been the preparation and solution of the transit job as a additive scheduling job. The basic transit job was originally developed by F.L.Hithchcock in 1941 in his survey entitled, ” the distribution of a merchandise from a several resources to legion locations ” .

In 1947, T.C.Koopma independently published a survey on “ optimal use of the transit system. ”

We Will Write a Custom Essay Specifically
For You For Only $13.90/page!


order now

THE GENERAL STRUCTURE OF THE PROBLEM-

A maker wishes to transport a figure of units of a homogenous merchandise from several warehouses ( beginnings ) to a figure of retail shops ( finishs ) .each shop requires, bj by the jth shop, a certain figure units of the merchandise, while each warehouse, Army Intelligence by the ith warehouse supply up to a certain sum. The cost of transporting a unit from the beginning of jth finish is hundred and one, and is known for all combinations.

The job is to find the sums, xij, the sum shipped is from the beginning I is a & gt ; 0, and the entire received by the finish J is.we temporarily enforce the limitation that the entire sum shipped to entire sum received i.e. a?‘ ai= a?‘ bj. The entire cost of transportation is cij xij. Since negative cargo has no valid reading for the job we restrict xij & gt ; 0.

Solving A TRANSPORTATION PROBLEM-

The simplex method can be used to work out the additive scheduling can be used to work out the additive scheduling theoretical account of transit job. However, it is non the most efficient method for work outing the transit job that tends to hold a big figure of variables and restraints. Because of the particular nature of the job, more efficient method called “ transit method ” has been developed to obtain an optimum solution. This method is insistent processs which are in turn improved until an optimum transit agenda is obtained.

The transit method loosely consists of following steps-

Finding an initial solution which is executable from the point of handinesss and demands of resources.

Analyzing the solution for optimality, i.e. analyzing whether an improved transit agenda with lower cost is possible.

Repeating measure ( 2 ) until no farther betterment is executable.

Several attacks have been developed for happening an initial solution to the transit job. Vogel ‘s estimate method ( VAM ) was originally developed to bring forth an optimum solution to job in merely one loop. Although VAM does non vouch an optimum solution with relatively less attempt and calculation.

NORTH-WEST CORNER METHOD

For happening an initial solution to the transit job, this method indicates that the measures transported from the mills ( beginnings ) to the warehouses ( finishs ) must get down in the upper left-hand ( north-west ) corner. When this path is to the full used, that is, the mill capacity or warehouse demands are to the full utilised, depending on which figure is lower, the balance of either factory capacity or warehouse demand is so assigned to the new row ( s ) or column ( s ) until it is to the full used.

Using this process, the tabular array is filled from the upper left cell down to the lower right cell, to the full utilizing warehouse demands, and so mill capacities etc.

TO FIND AN OPTIMAL SOLUTION-

Once the initial solution has been found out for the transit job and cheque for the degeneration has been done, the following measure in the job is to happen out the optimum solution with the aid of initial solution obtained by VAM regulation or the North -West corner regulation or by any other method. For this intent, we shall follow modified distribution method, or normally referred to as MODI method. This method helps us to find a better transit agenda by measuring the unfilled cells or those cells which do non hold agenda cargos. The MODI-method selects a peculiar unfilled cell or empty cell that will give the most betterment by a set of of index units are so made for that unfilled cell. In a similar mode, revised index Numberss indicates the best unfilled cell. The MODI-method continues until there are no more values, i.e. bespeaking no possibility of betterment in the solution.

The process involved in the MODI-method for finding the optimum solution for a transit job is summarized below-

Find a first executable solution by the north-west corner regulation or by VAM process. Let Zo be the current value of the nonsubjective map.

Develop the combined ( Ui, Vj ) and indirect cost tabular array ( Cij ) , i.e. work out for Ui and Vj by seting Ui =0 and Cij=Ui+Vj for Xij in the basic solution and cij= Ui + Vj for all ( I, J ) .

3-Calculate = Cij-Cij for all ( I, J ) . if all, so current solution is optimum. It some, select

non basic variable to come in the basic solution matching to largest, from amongst the

negative values.

4 Determine the value of Xpq and the new basic executable solution by come ining the new

Parameter o= Xpq into place ( P, Q ) of the current solution tabular array ( x ) and add and deduct

o from the solution variable Xij to keep row and column balanced. Then for those

Positions in which o is subtracted from Xij, find the minimal Xij and this value is

equal to o = Xij i.e. we solve the set of restraints Xij-o a‰? 0 and choose the upper limit

Possible value for o.if there are ties, we obtain a debauched solution, in that more than

one ) and retain the others to organize the new basic solution in order to build the )

Matching tabular array. The new value of the nonsubjective map omega is given by z=z0- Xpq ( Cpq- cpq )

5- Repeat stairss ( two ) to ( IV ) to the new solution obtained earlier until an optimum solution is obtained i.e. until all a‰? 0.

Suppose that England, France, and Spain produce all the wheat, barley, and oats in the universe. The universe demand for wheat requires 125 million estates of land devoted to wheat production. Similarly, 60 million estates of land are required for barley and 75 million estates of land for oats. The entire sum of land available for these intents in England, France, and Spain is 70 million estates, 110 million estates, and 80 million estates, severally. The figure of hours of labour needed in England, France and Spain to bring forth an acre of wheat is 18, 13, and 16, severally. The figure of hours of labour needed in England, France, and Spain to bring forth an acre of barley is 15, 12, and 12, severally. The figure of hours of labour needed in England, France, and Spain to bring forth an acre of oats is 12, 10, and 16, severally. The labour cost per hr in bring forthing wheat is $ 9.00, $ 7.20, and $ 9.90 in England, France, and Spain, severally. The labour cost per hr in bring forthing barley is $ 8.10, $ 9.00, and $ 8.40 in England, France, and Spain severally. The labour cost per hr in bring forthing oats is $ 6.90, $ 7.50, and $ 6.30 in England, France and Spain, severally. The job is to apportion land usage in each state so as to run into the universe nutrient demand and minimise the entire labour cost.

( a ) Formulate this job as a transit job by building the appropriate parametric quantity tabular array.

Let England, France and Spain be three beginnings, where their supplies are 1000000s estates of land that are available for turning these harvests. Let Wheat, Barley, and Oats the finishs, where their demands are the 1000000s estates of land that are needed to finish the demand of universe for these harvests severally. The unit cost ( 1000000s of dollars ) is the labour cost per million estates so the figure of hours of labor needed is multiplied by the cost per hr.

The tabular array is given below- .

Unit of measurement Cost ( $ million )

Finish

Wheat

Barley

Oats

Supply

England

162

121.5

82.8

70

Beginning

France

93.6

108

75

110

Spain

158.4

100.8

100.8

80

Demand

125

60

75

( B ) Draw the web representation of this job.

The web diagram is given as- .

( degree Celsius ) Obtain an optimum solution.

.

Measures distributed-

Finish

Wheat

Barley

Oats

Sums

Supply

England

0

0

70

70

=

70

Beginning

France

110

0

0

110

=

110

Spain

15

60

5

80

=

80

Sums

125

60

75

=

=

=

Entire cost = $ 25.02 billion

Demand

125

60

75

NORTH WEST CORNER RULE-

Optimality Test:

Since cij – ui – vj = 0 if xij is a basic variable

cij = ui + vj for each ( I, J ) such that xij is basic.

Because the figure of terra incognitas ( the ui and vj ) are more than the figure of these equations by one so we can put one unknown equal to an arbitrary value, say 0. These equations can work out as given below.

1-x21: 93.6 = u2 + v1. Let u2 = 0, so v1 = 93.6

2-x22: 108 = u2 + v2. v2 = 108.

3-x11: 162 = u1 + v1. v1 = 93.6 ( from 1 ) , so u1 = 68.4

4-x32: 100.8 = u3 + v2. v2 = 108 ( from 2 ) , so u3= -7.2.

5-x33: 100.8 = u3 + v3. u3 = -7.2 ( from 4 ) , so v3= 108.

Hence cij – ui – vj represents the rate at which the aim map will change as a nonbasic variable xij is increased, now we can look into whether increasing any nonbasic variable will diminish the entire cost Z or non.

Nonbasic variable

cij – ui – vj

x12

121.5 – 68.4 – 108 = -54.9

x13

82.8 – 68.4 – 108 = -93.6

x23

75 – 0 – 108 = -33

x31

158.4 – ( -7.2 ) – 93.6 = 72

Because some of these ( cij – uij – vj ) values are negative, the initial BF solution is non optimum solution.

Iteration 1:

We choose a nonbasic variable x13 as come ining basic variable because it has the greatest negative value of ( cij – ui – vj ) .

When x13 is increased from 0 by any sum, a concatenation reaction sets off that requires alternately decreasing and increasing current basic variables by the same sum in order to go on fulfilling the supply and demand restraints. This concatenation reaction is represented in the following figure, where the + mark inside a box in cell ( 1, 3 ) indicates that the come ining basic variable is being increased and the + or – mark following to other circles show that the basic variable is increased or decreased at that place.

Each giver cell ( indicated by a subtraction mark ) decreases its allotment by precisely the same sum as the come ining basic variable and each receiver cell ( indicated by a plus mark ) is increased. The come ining basic variable will be increased until the allotment for one of the giver cells drops all the manner down to 0. Since the original allotments for the giver cells are

x11 = 70 x22 = 55 x33 = 75

x22 will the one bead to 0 as x13 is increased ( by 55 ) . so, x22 is go forthing basic variable.

Since each of the basic variables is increased or decreased by 55, the values of the basic variables in the new BF solution are

x11 = 15 x13 = 55 x21 = 110 x32 = 60 x33 = 20.

Optimality Test after Iteration 1:

Hence Source 1 now has two basic variables ( for the maximal figure ) , let be u1 = 0 this clip. The cij = ui + vj equations so will be –

1-x11: 162 = u1 + v1. Let u1 = 0, so v1 = 162,

2-x13: 82.8 = u1 + v3. v3= 82.8.

3-x21: 93.6 = u2 + v1. v1 = 162 ( from 1 ) , so u2= -68.4.

4-x33: 100.8 = u3 + v3. v3 = 82.8 ( from 2 ) , so u3= 18.

5-x32: 100.8 = u3 + v2. u3 = 18 ( from 3 ) , so v2= 82.8.

We will cipher ( cij – ui – vj ) for the nonbasic variables.

Nonbasic variable

cij – ui – vj

x12

121.5 – 0 – 82.8 = 38.7

x22

108 – ( -68.4 ) – 82.8 = 93.6

x23

75 – ( -68.4 ) – 82.8 = 60.6

x31

158.4 – 18 – 162 = -21.6

Now besides we have one negative value of ( cij – ui – vj ) , so the current BF solution is non optimum solution.

Iteration 2:

Since x31 is the one nonbasic variable with a negative value of ( cij – ui – vj ) , x31 becomes the come ining basic variable.

The ensuing concatenation reaction is depicted following.

The giver cells have allotments of x11 = 15 and x33 = 20. Because 15 & lt ; 20, the go forthing basic variable is x11.

Since the basic variables x21 and x32 are non portion of this concatenation reaction, their values do non alter. However, x31 and x13 addition by 15 while x11 and x33 lessening by 15. so, the values of the basic variables in the new BF solution are

x13 = 70 x21 = 110 x31 = 15 x32 = 60 x33 = 5

Optimality Test after Iteration 2:

Because now Source 3 has the greater figure of basic variables, we let u3 = 0 this clip. The computations are given below.

1-x31: 158.4 = u3 + v1. Set u3 = 0, so v1= 158.4,

2-x32: 100.8 = u3 + v2. v2= 100.8.

3-x33: 100.8 = u3 + v3. v3 = 100.8

4-x13: 82.8 = u1 + v3. v3 =100.8 ( from 3 ) , so u1= -18.

5-x21: 93.6 = u2 + v1. v1 =158.4 ( from1 ) , so u2= -64.8.

Nonbasic variable

cij – ui – vj

x11

162 – ( -18 ) – 158.4 = 21.6

x12

121.5 – ( -18 ) – 100.8 = 38.7

x22

108 – ( -68.4 ) – 100.8 = 72

x23

75 – ( -64.8 ) – 100.8 = 39

Since all of these values of ( cij – ui – vj ) are non negative, the current BF solution is optimum solution.

Therefore, the optimum allotment of land to harvests is

70

million estates in England for oats,

110

million estates in France for wheat,

15

million estates in Spain for wheat,

60

million estates in Spain for barley,

5

million estates in Spain for oats.

The entire cost of this expansive endeavor will be Z== $ 25.02 billion.

x

Hi!
I'm Kira

Would you like to get such a paper? How about receiving a customized one?

Check it out