Professional Documents
Culture Documents
Construction Management and Administration: Unit-V Optimisation
Construction Management and Administration: Unit-V Optimisation
UNIT-V Optimisation
Introduction
Optimization is the selection of a best element (with regard to some criteria) from some set of available alternatives
Formulation of LP problems
Production allocation problem: A firm manufactures two types of products A and B and sells them at a profit of Rs.2 on type A and Rs.3 on type B. Each product is processed on two machines G and H. type A requires 01 minute of processing time on G and 02 minutes on H; type B requires 01 minute on G and 01 minute on H. The machine G is available for not more than 6hours 40 minutes while machine H is available for 10hours during any working day. Formulate the problem as a LPP. Let x1 be the number of products of type A; x2 be the number of products of type B
Machine
G H
Rs.2
Rs.3
Formulation of LP problems
The manufacturer of patent medicines is proposed to prepare a production plan for medicines A and B. there are sufficient ingredients available to make 20000 bottles of medicine A and 40000 bottles of medicine B, but there are only 45000 bottles into which either of the medicines can be filled. Further it takes 3hours to prepare enough material to fill 1000 bottles of medicine A and one hour to prepare enough material to fill 1000 bottles of medicine B, and there are 66 hours available for this operation. The profit is Rs.8 per bottle for medicine A and Rs.7 per bottle for medicine B.
Formulate the problem as a Linear Programming Problem.
Let x1 1000 be the number of bottles of medicine A x2 1000 be the number of bottles of medicine B
Applications of LP
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. Personal assignment problem Transportation problem Efficiencing on operation of system of dams Optimum estimation of executive compensation Agricultural applications Military applications Production management Marketing management Manpower management Physical distribution
Step 1: consider each inequality constraint as equation and Plot all the constraints one by one on a graph paper
Step 4: Read the coordinates of extreme points and find the maximum/minimum value of z
It can be visually noticed that value of the objective function will be maximum when it passes through the intersection of x+3y=7 and 4x+y=15 (straight lines associated with the 2nd and 3rd inequality constraints). This is known as optimal point. The optimal point of the present problem is x=3.091 and y=2.636 .
Let x1 1000 be the number of bottles medicine A x2 1000 be the number of bottles of medicine B
Step 1: consider each inequality constraint as equation and Plot all the constraints one by one on a graph paper
3x1+x2 <=66; x1+x2 <=45 ; x1<=20; x2 <=40; x1>=0; x2 >=0
70
60 50 40 30 20 10
x1<=20
x2 <=40
0
0 10 20 30 40 50 60 70
70
60 50 40 30 20 10
x1<=20
x2 <=40
0
0 10 20 30 40 50 60 70
x1<=20
x2 <=40
0
0 10 20 30 40 50 60 70
Step 4: Read the coordinates of extreme points and find the maximum/minimum value of z
Total Profit, P=8000*x1+7000*x2 (objective function)
x1<=20 Maximum point
It can be visually noticed that value of the objective function will be maximum when it passes through the intersection of 3x1+x2=66 and x1+x2=45 ( 1st and 2nd constraints). This is known as optimal point. The optimal point of the present problem is
x1=10.5 X2 =34.5
70
60 50 40 30 20 10
x2 <=40
0
0 10 20 30 40 50 60 70 8000*10.5+7000*34.5=325000
Step 1: consider each inequality constraint as equation and Plot all the constraints one by one on a graph paper x1+3x2>=3 x1+x2>=2 x1, x2 >=0
2.5 2 1.5 1
0.5
0
Step 2: Identify the common region of all the constraints x1+3x2>=3 x1+x2>=2 x1, x2 >=0
2.5 2 1.5 1
0.5
0
0.5
0
3
k=1.5x1+2.5x2
Step 4: Read the coordinates of extreme points and find the maximum/minimum value of z
2.5 Objective function z=1.5x1+2.5x2
It can be visually noticed that value of the objective function will 1.5 be minimum when it 1 passes through the intersection of x1+x2=2 and x1+3x2=3 ( 1st and 0.5 2nd constraints). This is known as optimal 0 point. The optimal 0 point of the present problem is
x1=1.5 X2 =0.5
1.5*1.5+2.5*0.5=3.5
3. All variables must have non-negative values 4. The objective function should be of maximization form
Min. f(x)= - Max. [--f(x)] Min. z = c1x1+c2x2++cnxn Max.(-z), i.e. Max z - c1x1-c2x2-..-cnxn with z=-z.
Standard form of general LPP with constraints Max. z= c1x1+c2x2++cnxn +0xn+1++0xn+m Subject to a11x1+a12x2+.a1nxn+xn+1 a21x1+a22x2+....a2nxn +xn+2 : : : : am1x1+am2x2+..amnxn
Assumptions in LPP
a) Proportionality
Objective function and every constraint function must be linear A machine takes x hours of processing time for product A and for product B it takes y hours then for both A&B together it take x+y hours time 1hour for 1product then 10hours for 10products The total profit from N no.of units is the unit profit times the no.of units sold It means that the fractional levels of variables must be permissible besides integral values All the parameters in the linear programming models are assumed to be known exactly
b) Additivity
c) Multiplicativity
d) Divisibility e) Deterministic
Advantages of LP
1. Linear programming technique helps in making the optimum utilization of productive resources. It also indicates how a decision maker can employ his productive factors most effectively by choosing and allocating these resources The quality of decision may also be improved by linear programming techniques. The user of this technique becomes more objective and less subjective Linear programming technique provides practically applicable solutions since there might be other constraints operating out side the problem which must also be taken into consideration just because, so many units must be produced does not mean that all those can be sold. So the necessary modification of its mathematical solution is required for the sake of convenience to the decision maker In production processes, high lighting of bottlenecks is the most significant advantage of this technique. For example, when bottlenecks occur, some machines cannot meet the demand while others remain idle for some time
2. 3.
4.
Limitations of LP
1. 2. In some problems objective functions and constraints are not linear. Generally, in real life situations concerning business and industrial problems constraints are not linearly treated to variables There is no guarantee of getting integer valued solutions, for example, in finding out how many men and machines would be required to perform a particular job, rounding off the solution to the nearest integer will not give an optimal solution. Integer programming deals with such problems LP model does not take into consideration the effect of time and uncertainty. Thus the model should be defined in such a way that any change due to internal as well as external factors can be incorporated Sometimes large-scale problems cannot be solved with LP techniques even when the computer facility is available. Such difficulty may be removed by decomposing the main problem into several small problems and then solving them separately Parameters appearing in the model are assumed to be constant. But in real life situations they are neither constant nor deterministic LP deals with only single objective, whereas in real life situations problems come across with multi-objectives. Goal programming and multi-objective programming deals with such problems
3. 4.
5. 6.
The system of equations can be transformed in such a way that a new set of three different equations are obtained, each having only one variable with nonzero coefficient. This can be achieved by some elementary operations
Note that the transformed set of equations through elementary operations is equivalent to the original set of equations. Thus, solution of the transformed set of equations will be the solution of the original set of equations too Now, let us transform the above set of equations (A0, B0 and C0) through elementary operations
Note that variable x is eliminated from equations B0 and C0 to obtain B1 and C1 respectively. Equation A0 in the previous set is known as pivotal equation. Following similar procedure, y is eliminated from A1 and C1 as follows, considering B1 as pivotal equation.
Thus we end up with another set of equations which is equivalent to the original set having one variable in each equation. Transformed set of equations, (A3, B3 and C3), thus obtained are said to be in canonical form
Operation at each step to eliminate one variable at a time, from all equations except one, is known as pivotal operation
Simplex method
Simplex method is the most popular method used for the solution of Linear Programming Problems (LPP) Solution of a LPP, if exists, lies at one of the vertices of the feasible region. All the basic solutions can be investigated one-by-one to pick up the optimal solution. For 10 equations with 15 variables there exists 15C10= 3003 basic feasible solutions. Too large number to investigate one-by-one. This can be overcome by simplex method
Simplex Algorithm
Consider following LPP
Basic feasible solution of above canonical form is x4 = 6, x5= 0, x6= 4 , x1= x2= x3= 0 and Z= 0
Symbolized form
The left-most column is known as basis as this is consisting of basic variables The coefficients in the first row (C1,....,C6) are known as cost coefficients
This completes first step of algorithm. After completing each step (iteration) of algorithm, following three points are to be examined: 1. Is there any possibility of further improvement?
If any one of the cost coefficients is negative further improvement is possible
Entering variable :
c1is minimum (-4), thus, x1is the entering variable for the next step of calculation
Exiting variable:
r may take any value from 4, 5 and 6 It is found that b4/c41 = 6/2=3, b5/c51=0/1 , b6/c61=4/5 As , b5/c51 is minimum r=5 thus x5 is to be exited
c51 ( = 1) is considered as pivotal element and x5 is replaced by x1in the basis. Thus a new canonical form is obtained through pivotal operation
Pivotal operation
Pivotal row is transformed by dividing it with the pivotal element. In this case, pivotal element is 1. for other rows: Let the coefficient of the element in the pivotal column of a particular row be l. Let the pivotal element be m. Then the pivotal row is multiplied by l / m and then subtracted from that row to be transformed. This operation ensures that the coefficients of the element in the pivotal column of that row becomes zero, e.g., Z row: l = -4 , m = 1. So, pivotal row is multiplied by l / m = -4 / 1 = -4, obtaining 4x1+16x2-8x3+0x4-4x5+0x6=0 . This is subtracted from Z row, obtaining 0x1-5x2+6x3+0x4+4x5+0x6+z=0, The other two rows are also suitably transformed.
-(-4/1*E3-E1) -(2/1*E3-E2)
-(5/1*E3-E4)
The basic solution of above canonical form is x1= 0, x4= 6, x6= 4, x2= x3= x5= 0 and Z= 0 Note that cost coefficient c2is negative. Thus optimum solution is not yet achieved. Further improvement is possible
Entering variable: c2is minimum (-15), thus, x2 is the entering variable for the next step of calculation Exiting variable: r may take any value from 4, 1 and 6. However, c12 is negative (-4). Thus, r may be either 4 or 6. It is found that b4/c42=6/9=0.667 and b6/c62=4/18 =0.22. As b6/c62 is minimum, r is 6. Thus x6 is to be exited. c62 ( = 18) is considered as pivotal element and x6 is to be replaced by x2 in the basis Thus another canonical form is obtained
(E4/18)
The basic solution of above canonical form is x1= 8/9, x2= 2/9, x4= 4, x3= x5= x6= 0 and Z= 10/3. Note that cost coefficient c3 is negative. Thus optimum solution is not yet achieved. Further improvement is possible
Entering variable: c3is minimum (-4), thus, x3 is the entering variable for the next step of calculation Exiting variable: x4 is the exiting variable. Thus c43 ( = 4) is the pivotal element and x4is to be replaced by x3 in the basis. Thus another canonical form is obtained
-(-4/4E2-E1) (E2/4)
-(-1/6*E2-E3) -(-1/6E2-E4)
The basic solution of above canonical form is x1= 14/9, x2= 8/9, x3= 1, x4= x5= x6= 0 and Z= 22/3 Note that all the cost coefficients are nonnegative. Thus the optimum solution is achieved
Assignment -5
Applications of LP in construction management Advantages of LP Limitations of LP What is Canonical Form of LP?