1 / 16

Operation Research

Operation Research. Chapter 2. Part II. Chapter 2 Outline: Part II. Introduction The Linear Programming Model Examples of Linear Programming Problems Developing Linear Programming Models Graphical Solution to LP Problems.

felice
Télécharger la présentation

Operation Research

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Operation Research Chapter 2 Part II

  2. Chapter 2 Outline: Part II • Introduction • The Linear Programming Model • Examples of Linear Programming Problems • Developing Linear Programming Models • Graphical Solution to LP Problems • Slack, Surplus and unrestricted variables • Graphical LP Sensitivity Analysis Operation Research: An Introduction By Dr: AlaaSagheer

  3. Graphical LP Solution Model (1) • Special Variables: • 1- Slack Variable (s1): represents the amount by which the available amount of the resources exceeds its usage by the activities. • To find the slack for a ≤ constraint algebraically, we add a slack variable to the constraint and convert it into an equality. • Ex: In Reddy Mikks model • The constraint 6x1+ 4x2  24 associated with the usage of raw material M1 is equivalent to 6x1+ 4x2 + s1 = 24 provided that s1 ≥ 0 • The slack variable s1 =24 - 6x1 - 4x2 represents the unused amount of raw material M1 Operation Research: An Introduction By Dr: AlaaSagheer

  4. Graphical LP Solution Model (2) • 2- Surplus Variable (S1) : represents the excess of the left hand side over the minimum requirement. • To find the surplus for a ≥ constraint, we subtract a surplus variable from the left-hand side to make it an equality. • Ex: In Diet Model • The constraint representing minimum feed requirement, x1+ x2 ≥ 800 is • equivalent to x1+ x2 - S1 = 800 provided that S1 ≥ 0 • A positive value of S1 signifies that a surplus amount of feed ( over the minium requirement of 800Ib) will be produced. • 3- Unrestricted Variable : In both Reddy Mikks and Diet model, the nature of variables requires them to assume nonnegative values. But there are other situations where variable can assume any real value. Operation Research: An Introduction By Dr: AlaaSagheer

  5. Graphical LP Solution Model (4) Example: McBurger fast – food restaurant sells quarter-pounder and cheeseburger. A quarter-pounder uses a quarter of pound of meat, and cheeseburger uses only 0.2 Ib. The restaurant starts the day with 200 Ib of meat but may order more at an additional cost of 25 cents per pound to cover the delivery cost. Any surplus meat at the end of the day is donated at HotSoup Charity. McBurger’s profits are 20 cents from a quarter pounder and 15 cents for a cheeseburger. All in all, McBurger doesn’t expect to sell more than 900 sandwich in any one day.How many of each sandwich should McBurger make? Operation Research: An Introduction By Dr: AlaaSagheer

  6. Graphical LP Solution Model (5) Solution: Assumex1 The daily number of quarter-pounders made x2 The daily number of cheeseburger made The constraints: 0.25x1+ 0.2x2  200 In first case (Slack) 0.25x1+ 0.2x2 ≥ 200 In second case (Surplus) We consider x3 as unrestricted that allows the variable to play the roles of both a slack and a surplus as desired 0.25x1+ 0.2x2 + x3 = 200 Operation Research: An Introduction By Dr: AlaaSagheer

  7. Graphical LP Solution Model (6) • The objective function: Maximize the total profit, less any additional cost that may be incurred as a result of ordering special delivery of additional pounds of meat • The additional cost is incurred only if x3 < 0 (role of surplus) • Dealing with an unrestricted variable is cumbersome. So we use standard substitution that converts the unrestricted variable into two nonnegative variables • X3 = x3+ - x3- x3+, x3- ≥ 0 If x3+ >0 and x3- =0 x3+ plays a role of slack If x3- >0 and x3+ =0 x3- plays a role of surplus The constraint can be expressed as: 0.25x1+ 0.2x2 + x3+ - x3- = 200 The objective function is expressed as: Maximize z =0.2 x1 + 0.15 x2 - 0.25 x3- Operation Research: An Introduction By Dr: AlaaSagheer

  8. Graphical Sensitivity Analysis (1) Sensitivty Analysis: Studying the effect of making changes in the model parameters on a given optimum LP solution. 1) Changes in the objective function coefficient The objective function (Two variable- maximize or minimize )can be expressed as: z = c1x1 + c2x2 • The change in the coefficients c1 and c2 will change the slope of z which lead to changing the optimum solution to a different corner point of the solution space. So we need to determine the range of optimality for the ratio or • that will keep the optimum solution unchanged. • Corner point: A point that lies at the intersection of two (or possibly more) constraint lines on the boundary of the feasible region. • No interior points in the feasible region need be considered because at least one corner point is better than any interior point Operation Research: An Introduction By Dr: AlaaSagheer

  9. Graphical Sensitivity Analysis (2) Example: In Reddy Mikks problem. Operation Research: An Introduction By Dr: AlaaSagheer

  10. Graphical Sensitivity Analysis (3) • The objective function was • Z = 5x1 + 4x2 • If we change the objective function to • Z = c1 x1 + c2 x2 • The solution at C point will remain optimum . As the slope of z lies between the slopes of two line intersecting C--- namely • 6x1+ 4x2  24 raw material M1 • x1+ 2x2  6 raw material M2 • We can express this relationship algebraically: The line cannot to be horizontal or The line cannot to be vertical Operation Research: An Introduction By Dr: AlaaSagheer

  11. Graphical Sensitivity Analysis (4) If c2 remain equal to 4, then Similarly, If we specify c1 equal to 5, then Operation Research: An Introduction By Dr: AlaaSagheer

  12. Graphical Sensitivity Analysis (5) • 2) Unit Worth of a Resource ( Changes in in the right hand – side of the constraints) • Quantifies the rate of change in the optimum value in the objective function as a result of making changes in the availability of the resource. Operation Research: An Introduction By Dr: AlaaSagheer

  13. Graphical Sensitivity Analysis (6) Example: In Reddy Mikks model: The first constraints represent the limitations on the usage of raw material, M1 and M2, respectively. Determine the worth per unit for each resource. • Solution: • The worth per unit for raw material M1 Operation Research: An Introduction By Dr: AlaaSagheer

  14. Graphical Sensitivity Analysis (7) • End points D=(2.2) and G=(6.0) delineate the feasibility range for M1 • The amount of M1 associated with point D is computed as 6 x1 + 4 x2 =20 tons. • Similarly, The amount of M1 associated with point G is computed as 6 x1 + 4 x2 =36 tons . • Thus the range of feasibility for M1 is • Let y1 represent the worth per unit of raw material M1 • Given D= (2.2) and G= (6.0) then, • z at D = 5*2 +4*2 = 18 (thousand dollars) • z at G = 5*6 +4*0 = 30 (thousand dollars) • As a result, the 1-ton change in M1 in range 20 M1 36 will change optimum value of z by 750$ Operation Research: An Introduction By Dr: AlaaSagheer

  15. Graphical Sensitivity Analysis (8) • The worth per unit for raw material M2 Operation Research: An Introduction By Dr: AlaaSagheer

  16. Graphical Sensitivity Analysis (9) • End points B=(4,0) and H=(8/3, 2) delineate the feasibility range for M1 • The amount of M2 associated with point B is computed as x1 + 2 x2 =4 tons. • Similarly, The amount of M2 associated with point H is computed as x1 + 2 x2 =20/3 tons . • Thus the range of feasibility for M1 is • Let y2 represent the worth per unit of raw material M2 Given B= (4,0) and H= (8/3, 2) then, z at B = 5*4 +4*0 = 20(thousand dollars) z at H = 5*8/3 +4*2 = 64/3 (thousand dollars) • As a result, the 1-ton change in M1 in range 20 M1 36 will change optimum value of z by 500$ Operation Research: An Introduction By Dr: AlaaSagheer

More Related