Stochastic linear programming method for right-hand sides random vector

From MaRDI portal





Presented is a method of solving a stochastic linear programming problem, worked out for the case with stochastic right-hand sides, which occurs most often in practice. Definitions of a measure of feasibility of the solution are introduced (global and local feasibility measure). They are based on the probability of the satisfaction of the constraints for a given basis solution, where such a basis solution must be feasible but in general non-optimal. A method of calculating the probability of the satisfaction of the constraints and rules for replacing a basis solution by another one with a greater probability of satisfaction of the feasibility conditions are introduced. This is a post-optimization method. It may be expected that the limit-distribution of the sequence of solution vectors (basis solutions) is a normal distribution. A two- dimensional example is computed, a graphic interpretation is given.











This page was built for publication: Stochastic linear programming method for right-hand sides random vector

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978571)