Q1. a. Explain how and why Operation Research methods have been valuable in aiding executive decisions. b.

Discuss the usefulness of Operation Research in decision making process and the role of computers in this field.
Answer: Churchman, Aackoff and Aruoff defined Operations Research as: the application of scientific methods, techniques and tools to operation of a system with optimum solutions to the problems, where optimum refers to the best possible alternative. The objective of Operations Research is to provide a scientific basis to the decision-makers for solving problems involving interaction of various components of the organization. You can achieve this by employing a team of scientists from different disciplines, to work together for finding the best possible solution in the interest of the organization as a whole. The solution thus obtained is known as an optimal decision. You can also define Operations Research as The use of scientific methods to provide criteria for decisions regarding man, machine, and systems involving repetitive operations. OR Operation Techniques is a bunch of mathematical techniques.

b. Operation Research is an aid for the executive in making his decisions based on scientific methods analysis. Discuss the above statement in brief.
Answer: Operation Research is an aid for the executive in making his decisions based on scientific methods analysis. Discussion:Any problem, simple or complicated, can use OR techniques to find the best possible solution. This section will explain the scope of OR by seeing its application in various fields of everyday life. i) In Defense Operations: In modern warfare, the defense operations are carried out by three major independent components namely Air Force, Army and Navy. The activities in each of these components can be further divided in four sub-components namely:

administration, intelligence, operations and training and supply. The applications of modern warfare techniques in each of the components of military organizations require expertise knowledge in respective fields. Furthermore, each component works to drive maximum gains from its operations and there is always a possibility that the strategy beneficial to one component may be unfeasible for another component. Thus in defense operations, there is a requirement to co-ordinate the activities of various components, which gives maximum benefit to the organization as a whole, having maximum use of the individual components. A team of scientists from various disciplines come together to study the strategies of different components. After appropriate analysis of the various courses of actions, the team selects the best course of action, known as the optimum strategy. ii) In Industry: The system of modern industries is so complex that the optimum point of operation in its various components cannot be intuitively judged by an individual. The business environment is always changing and any decision useful at one time may not be so good some time later. There is always a need to check the validity of decisions continuously against the situations. The industrial revolution with increased division of labour and introduction of management responsibilities has made each component an independent unit having their own goals. For example: production department minimises the cost of production but maximise output. Marketing department maximises the output, but minimises cost of unit sales. Finance department tries to optimise the capital investment and personnel department appoints good people at minimum cost. Thus each department plans its own objectives and all these objectives of various department or components come to conflict with one another and may not agree to the overall objectives of the organization. The application of OR techniques helps in overcoming this difficulty by integrating the diversified activities of various components to serve the interest of the organization as a whole efficiently. OR methods in industry can be applied in the fields of production, inventory controls and marketing, purchasing, transportation and competitive strategies. iii) Planning: In modern times, it has become necessary for every government to have careful planning, for economic development of the country. OR techniques can be fruitfully applied to maximise the per capita income, with minimum sacrifice and time. A government can thus use OR for framing future economic and social policies. iv) Agriculture: With increase in population, there is a need to increase agriculture output. But this cannot be done arbitrarily. There are several restrictions. Hence the need to determine a course of action serving the best under the given restrictions. You can solve this problem by applying OR techniques. v) In Hospitals: OR methods can solve waiting problems in out-patient department of big hospitals and administrative problems of the hospital organizations.

vi) In Transport: You can apply different OR methods to regulate the arrival of trains and processing times minimise the passengers waiting time and reduce congestion, formulate suitable transportation policy, thereby reducing the costs and time of trans-shipment. vii) Research and Development: You can apply OR methodologies in the field of R&D for several purposes, such as to control and plan product introductions.

Q2. Explain how the linear programming technique can be helpful in decision-making in the areas of Marketing and Finance.
Answer: Linear programming problems are a special class of mathematical programming problems for which the objective functions and all constraints are linear. A classic example of the application of linear programming is the maximization of profits given various production or cost constraints. Linear programming can be applied to a variety of business problems, such as marketing mix determination, financial decision making, production scheduling, workforce assignment, and resource blending. Such problems are generally solved using the simplex method. MEDIA SELECTION PROBLEM. The local Chamber of Commerce periodically sponsors public service seminars and programs. Promotional plans are under way for this years program. Advertising alternatives include television, radio, and newspaper. Audience estimates, costs, and maximum media usage limitations are shown in Exhibit 1. If the promotional budget is limited to $18,200, how many commercial messages should be run on each medium to maximize total audience contact? Linear programming can find the answer.

Q3. a. How do you recognize optimality in the simplex method? b. Write the role of pivot element in simplex table?
Answer:

Simplex method is used for solving Linear programming problem especially when more than two variables are involved SIMPLEX METHOD 1. Set up the problem.

That is, write the objective function and the constraints. 2. Convert the inequalities into equations.

This is done by adding one slack variable for each inequality. 3. Construct the initial simplex tableau. Write the objective function as the bottom row. 4. The most negative entry in the bottom row identifies a column.

5. Calculate the quotients. The smallest quotient identifies a row. The element in the intersection of the column identified in step 4 and the row identified in this step is identified as the pivot element. The quotients are computed by dividing the far right column by the identified column in step 4. A quotient that is a zero, or a negative number, or that has a zero in the denominator, is ignored. 6. Perform pivoting to make all other entries in this column zero. This is done the same way as we did with the Gauss-Jordan method. 7. When there are no more negative entries in the bottom row, we are finished; otherwise, we start again from step 4. 8. Read off your answers.

Get the variables using the columns with 1 and 0s. All other variables are zero. The maximum value you are looking for appears in the bottom right hand corner. Example Niki holds two part-time jobs, Job I and Job II. She never wants to work more than a total of 12 hours a week. She has determined that for every hour she works at Job I, she needs 2 hours of preparation time, and for every hour she works at Job II, she needs one hour of preparation time, and she cannot spend more than 16 hours for preparation. If she makes $40 an hour at Job I, and $30 an hour at Job II, how many hours should she work per week at each job to maximize her income?

Solution: In solving this problem, we will follow the algorithm listed above. 1. Set up the problem. That is, write the objective function and the constraints. Since the simplex method is used for problems that consist of many variables, it is not practical to use the variables x, y, z etc. We use the symbols x1, x2, x3, and so on. Let x1 = The number of hours per week Niki will work at Job I. and x2 = The number of hours per week Niki will work at Job II. It is customary to choose the variable that is to be maximized as Z. The problem is formulated the same way as we did in the last chapter. Maximize Subject to: 21 + x2 16 x1 0; x2 0 2. Convert the inequalities into equations. This is done by adding one slack variable for each inequality. For example to convert the inequality x1 + x2 12 into an equation, we add a non-negative variable y1, and we get x1 + x2 + y1 = 12 Here the variable y1 picks up the slack, and it represents the amount by which x1 + x2 falls short of 12. In this problem, if Niki works fewer that 12 hours, say 10, then y1 is 2. Later when we read off the final solution from the simplex table, the values of the slack variables will identify the unused amounts. We can even rewrite the objective function Z = 401 + 302 as 401 302 + Z = 0. After adding the slack variables, our problem reads Objective function: 401 302 + Z = 0 Z = 401 + 302 x1 + x2 12

Subject to constraints: x1 + x2 + y1 = 12 21 + x2 + y2 = 16 x1 0; x2 0

3. Construct the initial simplex tableau. Write the objective function as the bottom row. Now that the inequalities are converted into equations, we can represent the problem into an augmented matrix called the initial simplex tableau as follows. x1 x2 1 1 2 1 40 30 y1 1 0 0 y2 0 1 0 Z 0 0 1 C 12 16 0

Here the vertical line separates the left hand side of the equations from the right side. The horizontal line separates the constraints from the objective function. The right side of the equation is represented by the column C. The reader needs to observe that the last four columns of this matrix look like the final matrix for the solution of a system of equations. If we arbitrarily choose x1 = 0 and x2 = 0, we get Which reads y1 = 12 y2 = 16 Z =0 The solution obtained by arbitrarily assigning values to some variables and then solving for the remaining variables is called the basic solution associated with the tableau. So the above solution is the basic solution associated with the initial simplex tableau. We can label the basic solution variable in the right of the last column as shown in the table below. x1 x2 1 1 2 1 40 30 y1 1 0 0 y2 0 1 0 Z 0 0 1 12 16 0 y1 y2 Z

4. The most negative entry in the bottom row identifies a column. The most negative entry in the bottom row is 40; therefore the column 1 is identified. x1 1 2 40 x2 1 1 30 y1 y2 1 0 0 1 0 0 Z 0 0 1 12 y1 16 y2 0 Z

Q4. What is the significance of duality theory of linear programming? Describe the general rules for writing the dual of a linear programming problem.
Answer: Linear programming (LP) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships. Linear programming is a specific case of mathematical programming. More formally, linear programming is a technique for the optimization of a linear objective function, subject to linear equality and linear inequality constraints. Given a polytope and a real-valued affine function defined on this polytope, a linear programming method will find a point on the polytope where this function has the smallest (or largest) value if such point exists, by searching through the polytope vertices. Linear programs are problems that can be expressed in canonical form: where x represents the vector of variables (to be determined), c and b are vectors of (known) coefficients and A is a (known) matrix of coefficients. The expression to be maximized or minimized is called the objective function (cTx in this case). The equations Ax b are the constraints which specify a convex polytope over which the objective function is to be optimized. (In this context, two vectors are comparable when every entry in one is less-than or equal-to the corresponding entry in the other. Otherwise, they are incomparable.) Linear programming can be applied to various fields of study. It is used most extensively in business and economics, but can also be utilized for some engineering problems. Industries that use linear programming models include transportation, energy, telecommunications, and manufacturing. It has proved useful in modeling diverse types of problems in planning, routing, scheduling, assignment, and design. Duality: Every linear programming problem, referred to as a primal problem, can be converted into a dual problem, which provides an upper bound to the optimal value of the primal problem. In matrix form, we can express the primal problem as: Maximize cTx subject to Ax b, x 0; with the corresponding symmetric dual problem, Minimize bTy subject to ATy c, y 0. An alternative primal formulation is: Maximize cTx subject to Ax b; with the corresponding asymmetric dual problem, Minimize bTy subject to ATy = c, y 0.

There are two ideas fundamental to duality theory. One is the fact that (for the symmetric dual) the dual of a dual linear program is the original primal linear program. Additionally, every feasible solution for a linear program gives a bound on the optimal value of the objective function of its dual. The weak duality theorem states that the objective function value of the dual at any feasible solution is always greater than or equal to the objective function value of the primal at any feasible solution. The strong duality theorem states that if the primal has an optimal solution, x*, then the dual also has an optimal solution, y*, such that cTx*=bTy*. A linear program can also be unbounded or infeasible. Duality theory tells us that if the primal is unbounded then the dual is infeasible by the weak duality theorem. Likewise, if the dual is unbounded, then the primal must be infeasible. However, it is possible for both the dual and the primal to be infeasible.

5. Use Two-Phase simplex method to solve:

Solution: Rewriting in the standard form, Manimize Subject to X1 3X2 +4X3 +MA1 = 5 X1 -2X2 + S1 = 3 2X2 + X3 - S2 = 4, X1, X2, X3, S1, S2, A1 > 0. Phase 1: Consider the new objective, Maximize Z* = A1 Z = X1 + X2 + X3 + MA1 + 0S1 + 0S2

Subject to

2 1 + x2 S1 + A1 = 2
X1 X2 0 -3* -2 2 -3 -3 most ve Work Column X3 0 4 0 1 4 4 S1 0 0 1 0 0 0 S2 0 0 0 -1 0 0 A1 1 1 0 0 1 0 5 3 4 Ratio -5/3 -1 -4/3

Cj A1 - 1 S1 0 S2 0 Zj Zj-Cj

0 1 1 0 1 1

*Pivot element X1 enters the basic set replacing A1. The first iteration gives the following table:
X1 Cj X1 0 S2 0 S3 0 Zj Zj-Cj 0 -1/3 -1/2 0 0 0 X2 0 1 -7/2 2 0 0 X3 0 -4/3 -2 1 0 0 S1 0 0 1 0 0 0 S2 0 0 0 -1 0 0 A1 1 -1/3 -1/2 0 0 -1 -5/3 4 0

Phase I is complete, since there are one negative elements in the last row. Phase II: Consider the original objective function, Maximize z = x1 + x2+x3 + 0S1 + 0S2 Subject to -3x1/3 + x2 4x3/3 =-5/3 -x1/2 7x2/2 2x3 + S1 =1/2

2x2 + x3 S2 = 4 x1, x2, S1, S2 = 0 with the initial solution X1 = 1, S1 = 0, S2 = 0, the corresponding simplex table is
X1 Cj X1 1 S1 0 S2 0 Zj Zj-Cj 1 -1/3 -1/2 0 -1/3 -4/3 X2 1 1 1/2 4 1/2/2=1 X3 S1 S2 A1 Ratio

Work column *Pivot element

S1 S2 S3

X1
S2 0 S3 0 Zj-Cj

7/4 0

1 1 1 0

0 0 1/2 0

0 0 0 0

Since all elements of the last row are negative, the current solution is optimal.
The maximum value of the objective function Z = 6 which is attained for x1 = 2, x2 = 0.

6. Use Branch and Bound method to solve the following L.P.P:

Ans. At the starting iteration we can consider z (0) = 0 to be the lower bound, for x, since all xj = 0 is

feasible. The master list contains only the L.P.P. (1) (2) and (3). which is designated as problem 1. Choose it in step 0, and in step 1 determine the optimum solution. Z0=63 X1= 9 / 2, X2= 7 / 2 (Solution to problem 1) Since the solution is not integer valued, proceed from step 2 to step 3, and select x1. Then since

[X ]= [9 /2] = 4, place on the master list the following two additional problems.
1*

Problem 2: (1) (2) and 5 x1 7 0 x2 7 Problem 3: (1) (2) and 0 x1 4 0 x2 7 Returning to step 0: with z (1) = z (0) = 0, We choose problem 2, Step 1 establishes that problem 2 has the feasible solution z0 = 35, x1 = 5 x2 = 0 [solution to problem (2)] (5) Since this satisfies the integer constraints, therefore at step 2 we record it by enclosing in a rectangle and let z (2) = 35. Returning to step 0 with z (2) = 35, we find that problem 3 is available. Step 1 determines the following optimum feasible solution to it
Z0 = 58, x1 = 4, X2 = 10 / 3 (Problem 3)

Since the solution is not integer valued, proceed from step 2 to step 3 and select x2. Then

[X ]= [10/3] = 3. We add the following additional problems on the master list:

1*

Problem 4: (1) (2) and 0 < x1 < 4; 4 < x2 <7 Problem 5: (1) (2) and 0 x1 4 0 x2 3

Returning to step 0 with z (3) = z (2) = 35, choose problem 4 from step 1 we know that problem 4

has no feasible solution and so we again return to step 0 with z (4) = z (3) = 35.Only problem 5 is available in the master list. In step 1 we determine the following optimum solution to this problem. z0 = 55 x1 = 4 x2 = 3 (solution to problems) -------- (6) Since this satisfies the integer constraints, therefore at step 2. We record it by enclosing inside a rectangle and let z (5) = 55. Returning to step 0, we find that the master list is empty; and thus the algorithm terminates. Now, on terminating we find that only two feasible integer solution namely (5) and (6) have been recorded. The best of these gives the optimum solution to the given L.P.P. Hence the optimum integer solution to the given L.P.P. is
Z0 = 55, x1 = 4, x2 = 3

Tree diagram of above example

Z*=63

1 1

[X1= 4 / ]
2

/
2

, X2 = 3

x1 < 4

x1 > 5

Node (3)

Node (2)

Z*=58

Z*=35

[X1 = 4 , X2 = 3 ]

/
3

(x1 = 5, x2 = 0)

x2 < 3

x2 > 4

Node (5) Node (4)

Z* = 55 (x1 = 4, x2 = 3)

Optimal solution

No solution

Node
(1) (2) (3) (4) (5)

Solution
x1 x2 z*

Additional Constraints
__

Type of solution Non-integer (Original problem) Integer z* (1) Non-integer No solution Integer z* (2) (Optimal)

9/2

7/2

63

5 0 35 4 10 /3 58 4 3 55

x1 > 5 x1 < 4 x1 < 4 , x2 > 4 x1 < 4 , x2 < 3

MB0048 Operation Research (Book ID: B1137) Set- 1

Q1. a. Explain how and why Operation Research methods have been valuable in aiding executive decisions. b. Discuss the usefulness of Operation Research in decision making process and the role of computers in this field. Answer: Churchman, Aackoff and Aruoff defined Operations Research as: the application of scientific methods, techniques and tools to operation of a system with optimum solutions to the problems, where optimum refers to the best possible alternative. The objective of Operations Research is to provide a scientific basis to the decision-makers for solving problems involving interaction of various components of the organization. You

can achieve this by employing a team of scientists from different disciplines, to work together for finding the best possible solution in the interest of the organization as a whole. The solution thus obtained is known as an optimal decision. You can also define Operations Research as The use of scientific methods to provide criteria for decisions regarding man, machine, and systems involving repetitive operations. OR Operation Techniques is a bunch of mathematical techniques. b. Operation Research is an aid for the executive in making his decisions based on scientific methods analysis. Discuss the above statement in brief. Answer: Operation Research is an aid for the executive in making his decisions based on scientific methods analysis. Discussion:Any problem, simple or complicated, can use OR techniques to find the best possible solution. This section will explain the scope of OR by seeing its application in various fields of everyday life. 1 i) In Defense Operations: In modern warfare, the defense operations are carried out by three major independent components namely Air Force, Army and Navy. The activities in each of these components can be further divided in four sub-components namely: administration, intelligence, operations and training and supply. The applications of modern warfare techniques in each of the components of military organizations require expertise knowledge in respective fields. Furthermore, each component works to drive maximum gains from its operations and there is always a possibility that the strategy beneficial to one component may be unfeasible for another component. Thus in defense operations, there is a requirement to co-ordinate the activities of various components, which gives maximum benefit to the organization as a whole, having maximum use of the individual components. A team of scientists from various disciplines come together to study the strategies of different components. After appropriate analysis of the various courses of actions, the team selects the best course of action, known as the optimum strategy. ii) In Industry: The system of modern industries is so complex that the optimum point of operation in its various components cannot be intuitively judged by an individual. The business environment is always changing and any decision useful at one time may not be so good some time later. There is always a need to check the validity of decisions continuously against the situations. The industrial revolution with increased division of labour and introduction of management responsibilities has made each component an independent unit having their own goals. For example: production department minimises

the cost of production but maximise output. Marketing department maximises the output, but minimises cost of unit sales. Finance department tries to optimise the capital investment and personnel department appoints good people at minimum cost. Thus each department plans its own objectives and all these objectives of various department or components come to conflict with one another and may not agree to the overall objectives of the organization. The application of OR techniques helps in overcoming this difficulty by integrating the diversified activities of various components to serve the interest of the organization as a whole efficiently. OR methods in industry can be applied in the fields of production, inventory controls and marketing, purchasing, transportation and competitive strategies. iii) Planning: In modern times, it has become necessary for every government to have careful planning, for economic development of the country. OR techniques can be fruitfully applied to maximise the per capita income, with minimum sacrifice and time. A government can thus use OR for framing future economic and social policies. iv) Agriculture: With increase in population, there is a need to increase agriculture output. But this cannot be done arbitrarily. There are several restrictions. Hence the need to determine a course of action serving the best under the given restrictions. You can solve this problem by applying OR techniques. v) In Hospitals: OR methods can solve waiting problems in out-patient department of big hospitals and administrative problems of the hospital organizations. 2 vi) In Transport: You can apply different OR methods to regulate the arrival of trains and processing times minimise the passengers waiting time and reduce congestion, formulate suitable transportation policy, thereby reducing the costs and time of trans-shipment. vii) Research and Development: You can apply OR methodologies in the field of R&D for several purposes, such as to control and plan product introductions.

Q2. Explain how the linear programming technique can be helpful in decision-making in the areas of Marketing and Finance. Answer: Linear programming problems are a special class of mathematical programming problems for which the objective functions and all constraints are linear. A classic example of the application of linear programming is the maximization of profits given various production or cost constraints.

Linear programming can be applied to a variety of business problems, such as marketing mix determination, financial decision making, production scheduling, workforce assignment, and resource blending. Such problems are generally solved using the simplex method. MEDIA SELECTION PROBLEM. The local Chamber of Commerce periodically sponsors public service seminars and programs. Promotional plans are under way for this years program. Advertising alternatives include television, radio, and newspaper. Audience estimates, costs, and maximum media usage limitations are shown in Exhibit 1. If the promotional budget is limited to $18,200, how many commercial messages should be run on each medium to maximize total audience contact? Linear programming can find the answer.

Q3. a. How do you recognise optimality in the simplex method? b. Write the role of pivot element in simplex table? Answer: Simplex method is used for solving Linear programming problem especially when more than two variables are involved SIMPLEX METHOD 3 1. Set up the problem.

That is, write the objective function and the constraints. 2. Convert the inequalities into equations.

This is done by adding one slack variable for each inequality. 3. Construct the initial simplex tableau. Write the objective function as the bottom row. 4. The most negative entry in the bottom row identifies a column.

5. Calculate the quotients. The smallest quotient identifies a row. The element in the intersection of the column identified in step 4 and the row identified in this step is identified as the pivot element. The quotients are computed by dividing the far right column by the identified column in step 4. A quotient that is a zero, or a negative number, or that has a zero in the denominator, is ignored. 6. Perform pivoting to make all other entries in this column zero. This is done the same way as we did with the Gauss-Jordan method. 7. When there are no more negative entries in the bottom row, we are finished; otherwise, we start again from step 4. 8. Read off your answers.

Get the variables using the columns with 1 and 0s. All other variables are zero. The maximum value you are looking for appears in the bottom right hand corner. Example Niki holds two part-time jobs, Job I and Job II. She never wants to work more than a total of 12 hours a week. She has determined that for every hour she works at Job I, she needs 2 hours of preparation time, and for every hour she works at Job II, she needs one hour of preparation time, and she cannot spend more than 16 hours for preparation. If she makes $40 an hour at Job I, and $30 an hour at Job II, how many hours should she work per week at each job to maximize her income? Solution: In solving this problem, we will follow the algorithm listed above. 4 1. Set up the problem. That is, write the objective function and the constraints. Since the simplex method is used for problems that consist of many variables, it is not practical to use the variables x, y, z etc. We use the symbols x1, x2, x3, and so on. Let x1 = The number of hours per week Niki will work at Job I. and x2 = The number of hours per week Niki will work at Job II. It is customary to choose the variable that is to be maximized as Z. The problem is formulated the same way as we did in the last chapter. Maximize Z = 401 + 302

Subject to: 21 + x2 16 x1 0; x2 0

x1 + x2 12

2. Convert the inequalities into equations. This is done by adding one slack variable for each inequality. For example to convert the inequality x1 + x2 12 into an equation, we add a non-negative variable y1, and we get x1 + x2 + y1 = 12 Here the variable y1 picks up the slack, and it represents the amount by which x1 + x2 falls short of 12. In this problem, if Niki works fewer that 12 hours, say 10, then y1 is 2. Later when we read off the final solution from the simplex table, the values of the slack variables will identify the unused amounts. We can even rewrite the objective function Z = 401 + 302 as 401 302 + Z = 0. After adding the slack variables, our problem reads Objective function: 401 302 + Z = 0

Subject to constraints: x1 + x2 + y1 = 12 21 + x2 + y2 = 16 x1 0; x2 0 5 3. Construct the initial simplex tableau. Write the objective function as the bottom row. Now that the inequalities are converted into equations, we can represent the problem into an augmented matrix called the initial simplex tableau as follows. x1 x2 1 1 2 1 40 30 y1 1 0 0 y2 0 1 0 Z 0 0 1 C 12 16 0

Here the vertical line separates the left hand side of the equations from the right side. The horizontal line separates the constraints from the objective function. The right side of the equation is represented by the column C. The reader needs to observe that the last four columns of this matrix look like the final matrix for the solution of a system of equations. If we arbitrarily choose x1 = 0 and x2 = 0, we get Which reads y1 = 12 y2 = 16 Z =0 The solution obtained by arbitrarily assigning values to some variables and then solving for the remaining variables is called the basic solution associated with the tableau. So the above solution is the basic solution associated with the initial simplex tableau. We can label the basic solution variable in the right of the last column as shown in the table below. x1 x2 1 1 2 1 40 30 y1 1 0 0 y2 0 1 0 Z 0 0 1 12 16 0 y1 y2 Z

4. The most negative entry in the bottom row identifies a column. The most negative entry in the bottom row is 40; therefore the column 1 is identified. x1 1 2 40 x2 1 1 30 y1 y2 1 0 0 1 0 0 6 Z 0 0 1 12 y1 16 y2 0 Z

Q4. What is the significance of duality theory of linear programming? Describe the general rules for writing the dual of a linear programming problem. Answer:

Linear programming (LP) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships. Linear programming is a specific case of mathematical programming. More formally, linear programming is a technique for the optimization of a linear objective function, subject to linear equality and linear inequality constraints. Given a polytope and a real-valued affine function defined on this polytope, a linear programming method will find a point on the polytope where this function has the smallest (or largest) value if such point exists, by searching through the polytope vertices. Linear programs are problems that can be expressed in canonical form: where x represents the vector of variables (to be determined), c and b are vectors of (known) coefficients and A is a (known) matrix of coefficients. The expression to be maximized or minimized is called the objective function (cTx in this case). The equations Ax b are the constraints which specify a convex polytope over which the objective function is to be optimized. (In this context, two vectors are comparable when every entry in one is less-than or equal-to the corresponding entry in the other. Otherwise, they are incomparable.) Linear programming can be applied to various fields of study. It is used most extensively in business and economics, but can also be utilized for some engineering problems. Industries that use linear programming models include transportation, energy, telecommunications, and manufacturing. It has proved useful in modeling diverse types of problems in planning, routing, scheduling, assignment, and design. Duality: Every linear programming problem, referred to as a primal problem, can be converted into a dual problem, which provides an upper bound to the optimal value of the primal problem. In matrix form, we can express the primal problem as: Maximize cTx subject to Ax b, x 0; with the corresponding symmetric dual problem, Minimize bTy subject to ATy c, y 0. An alternative primal formulation is: Maximize cTx subject to Ax b; with the corresponding asymmetric dual problem, Minimize bTy subject to ATy = c, y 0. 7 There are two ideas fundamental to duality theory. One is the fact that (for the symmetric dual) the dual of a dual linear program is the original primal linear program. Additionally, every feasible solution for a linear program gives a bound on the optimal value of the objective function of its dual. The weak duality theorem states that the objective function value of the dual at any feasible solution is always greater than or equal to the objective function value of the primal at any feasible solution. The strong duality theorem states that

if the primal has an optimal solution, x*, then the dual also has an optimal solution, y*, such that cTx*=bTy*. A linear program can also be unbounded or infeasible. Duality theory tells us that if the primal is unbounded then the dual is infeasible by the weak duality theorem. Likewise, if the dual is unbounded, then the primal must be infeasible. However, it is possible for both the dual and the primal to be infeasible.

5. Use Two-Phase simplex method to solve:

Solution: Rewriting in the standard form, Manimize Subject to X1 3X2 +4X3 +MA1 = 5 X1 -2X2 + S1 = 3 2X2 + X3 - S2 = 4, X1, X2, X3, S1, S2, A1 > 0. Phase 1: Consider the new objective, Maximize Subject to Z* = A1 2 1 + x2 S1 + A1 = 2 8
X1 Cj 0 X2 0 X3 0 S1 0 S2 0 A1 1 Ratio

Z = X1 + X2 + X3 + MA1 + 0S1 + 0S2

A1 - 1 S1 0 S2 0 Zj Zj-Cj

1 1 0 1 1

-3* -2 2 -3 -3 most ve Work Column

4 0 1 4 4

0 1 0 0 0

0 0 -1 0 0

1 0 0 1 0

5 3 4

-5/3 -1 -4/3

*Pivot element X1 enters the basic set replacing A1. The first iteration gives the following table:
X1 Cj X1 0 S2 0 S3 0 Zj Zj-Cj 0 -1/3 -1/2 0 0 0 X2 0 1 -7/2 2 0 0 X3 0 -4/3 -2 1 0 0 S1 0 0 1 0 0 0 S2 0 0 0 -1 0 0 A1 1 -1/3 -1/2 0 0 -1 -5/3 4 0

Phase I is complete, since there are one negative elements in the last row. Phase II: Consider the original objective function, Maximize z = x1 + x2+x3 + 0S1 + 0S2 9 Subject to -3x1/3 + x2 4x3/3 =-5/3 -x1/2 7x2/2 2x3 + S1 =1/2 2x2 + x3 S2 = 4 x1, x2, S1, S2 = 0

with the initial solution X1 = 1, S1 = 0, S2 = 0, the corresponding simplex table is

X1 Cj X1 1 S1 0 S2 0 Zj Zj-Cj 1 -1/3 -1/2 0 -1/3 -4/3 X2 1 1 1/2 4 1/2/2=1 X3 S1 S2 A1 Ratio

Work column *Pivot element

S1 S2 S3

X1
S2 0 S3 0 Zj-Cj

7/4 0

1 1 1 0

0 0 1/2 0

0 0 0 0

Since all elements of the last row are negative, the current solution is optimal.
The maximum value of the objective function Z = 6 which is attained for x1 = 2, x2 = 0.

6. Use Branch and Bound method to solve the following L.P.P: 10

Solution: At the starting iteration we can consider z (0) = 0 to be the lower bound, for x, since all xj = 0 is feasible. The master list contains only the L.P.P. (1) (2) and (3). which is designated as problem 1. Choose it in step 0, and in step 1 determine the optimum solution. Z0=63 X1= 9 / 2, X2= 7 / 2 (Solution to problem 1) Since the solution is not integer valued, proceed from step 2 to step 3, and select x1. Then since

[X ]= [9 /2] = 4, place on the master list the following two additional problems.
1*

Problem 2: (1) (2) and 5 x1 7 0 x2 7 Problem 3: (1) (2) and 0 x1 4 0 x2 7 Returning to step 0: with z (1) = z (0) = 0, We choose problem 2, Step 1 establishes that problem 2 has the feasible solution z0 = 35, x1 = 5 x2 = 0 [solution to problem (2)] (5) Since this satisfies the integer constraints, therefore at step 2 we record it by enclosing in a rectangle and let z (2) = 35. Returning to step 0 with z (2) = 35, we find that problem 3 is available. Step 1 determines the following optimum feasible solution to it
Z0 = 58, x1 = 4, X2 = 10 / 3 (Problem 3)

Since the solution is not integer valued, proceed from step 2 to step 3 and select x2. Then

[X ]= [10/3] = 3. We add the following additional problems on the master list:

1*

Problem 4: (1) (2) and 0 < x1 < 4; 4 < x2 <7 Problem 5: (1) (2) and 0 x1 4 0 x2 3

11 Returning to step 0 with z (3) = z (2) = 35, choose problem 4 from step 1 we know that problem 4 has no feasible solution and so we again return to step 0 with z (4) = z (3) = 35.Only problem 5 is available in the master list. In step 1 we determine the following optimum solution to this problem. z0 = 55 x1 = 4 x2 = 3 (solution to problems) -------- (6) Since this satisfies the integer constraints, therefore at step 2. We record it by enclosing inside a rectangle and let z (5) = 55. Returning to step 0, we find that the master list is empty; and thus the algorithm terminates. Now, on terminating we find that only two feasible integer solution namely (5) and (6) have been recorded. The best of these gives the optimum solution to the given L.P.P. Hence the optimum integer solution to the given L.P.P. is
Z0 = 55, x1 = 4, x2 = 3

12 Tree diagram of above example

Z*=63

1 1

[X1= 4 / ]
2

/
2

, X2 = 3

x1 < 4 Node (3) Node (2)

x1 > 5

Z*=58

Z*=35

[X1 = 4 , X2 = 3 ]

/
3

(x1 = 5, x2 = 0)

x2 < 3

x2 > 4

Node (5) Node (4)

Z* = 55 (x1 = 4, x2 = 3)

Optimal solution

No solution

13 Node
(1) (2) (3) (4) (5)

Solution
x1 x2 z*

Additional Constraints
__

Type of solution Non-integer (Original problem) Integer z* (1) Non-integer No solution Integer z* (2) (Optimal)

9/2

7/2

63

5 0 35 4 10 /3 58 4 3 55

x1 > 5 x1 < 4 x1 < 4 , x2 > 4 x1 < 4 , x2 < 3