LINEAR PROGRAMMING UNDER UNCERTAINTY:CONCLUSIONS

By -

CONCLUSIONS

The values used for the parameters of a linear programming model generally are just estimates. Therefore, sensitivity analysis needs to be performed to investigate what happens if these estimates are wrong. The fundamental insight of Sec. 5.3 provides the key to per- forming this investigation efficiently. The general objectives are to identify the sensitive parameters that affect the optimal solution, to try to estimate these sensitive parameters more closely, and then to select a solution that remains good over the range of likely val- ues of the sensitive parameters. Sensitivity analysis also can help guide managerial decisions that affect the values of certain parameters (such as the amounts of the resources to make available for the activities under consideration). These various kinds of sensitivity analysis are an important part of most linear programming studies.

With the help of Solver, spreadsheets also provide some useful methods of performing sensitivity analysis. One method is to repeatedly enter changes in one or more parameters of the model into the spreadsheet and then click on the Solve button to see immediately if the optimal solution changes. A second is to use ASPE in your OR Courseware to systematically check on the effect of making a series of changes in one or two parameters of the model. A third is to use the sensitivity report provided by Solver to identify the allowable range for the coefficients in the objective function, the shadow prices for the functional con- straints, and the allowable range for each right-hand side over which its shadow price re- mains valid. (Other software that applies the simplex method, including various software in your OR Courseware, also provides such a sensitivity report upon request.)

Some other important techniques also are available for dealing with linear programming problems where there is substantial uncertainty about what the true values of the parameters will turn out to be. For problems that have only hard constraints (constraints that must be satisfied), robust optimization will provide a solution that is virtually guar- anteed to be feasible and nearly optimal for all plausible combinations of the actual values for the parameters. When dealing with soft constraints (constraints that actually can be violated a little bit without serious complications), each such constraint can be replaced by a chance constraint that only requires a very high probability that the original constraint will be satisfied. Stochastic programming with recourse is designed for dealing with problems where decisions are made over two (or more) stages, so later decisions can use updated information about the values of some of the parameters.

Comments

Post a Comment

Popular posts from this blog

DUALITY THEORY:THE ESSENCE OF DUALITY THEORY

By -
Image
THE ESSENCE OF DUALITY THEORY Given our standard form for the primal problem at the left (perhaps after conversion from another form), its dual problem has the form shown to the right. Thus, with the primal problem in maximizatio n form, the dual problem is in minimization form instead. Furthermore, the dual problem uses exactly the same pa r amete r s as the primal problem, but in different locations, as summarized below. 1. The coefficients in the objective function of the primal problem are the right-hand sides of the functional constraints in the dual problem. 2. The right-hand sides of the functional constraints in the primal problem are the coef- ficients in the objective function of the dual problem. 3. The coefficients of a variable in the functional constraints of the primal problem are the coefficients in a functional constraint of the dual problem. To highlight the comparison, now look at these same two problems in matrix notation (as introduced at the beginn...
Read more

NETWORK OPTIMIZATION MODELS:THE MINIMUM SPANNING TREE PROBLEM

By -
Image
THE MINIMUM SPANNING TREE PROBLEM The minimum spanning tree problem bears some similarities to the main version of the shortest-path problem presented in the preceding section. In both cases, an undi r ecte d and connected network is being considered, where the given information includes some mea- sure of the positive length (distance, cost, time, etc.) associated with each link. Both problems also involve choosing a set of links that have the shortest total length among all sets of links that satisfy a certain property. For the shortest-path problem, this property is that the chosen links must provide a path between the origin and the destination. For the minimum spanning tree problem, the required property is that the chosen links must provide a path between ea c h pair of nodes. The minimum spanning tree problem can be summarized as follows: 1. You are given the nodes of a network but not the links. Instead, you are given the po- tential links and the positive length for each ...
Read more

INTEGER PROGRAMMING:THE BRANCH-AND-CUT APPROACH TO SOLVING BIP PROBLEMS

By -
TH E BRANCH-AND-CUT APPROACH TO SOLVING BIP PROBLEMS Integer programming has been an especially exciting area of OR since the mid-1980s be- cause of the dramatic progress being made in its solution methodology. Background To place this progress into perspective, consider the historical background. One big break- through had come in the 1960s and early 1970s with the development and refinement of the branch-and-bound approach. But then the state of the art seemed to hit a plateau. Rel- atively small problems (well under 100 variables) could be solved very efficiently, but even a modest increase in problem size might cause an explosion in computation time be- yond feasible limits. Little progress was being made in overcoming this exponential growth in computation time as the problem size was increased. Many important problems arising in practice could not be solved. Then came the next breakthrough in the mid-1980s, with the introduction of the b r an c h- and-cu t approach to sol...
Read more