What people are saying - Write a review
We haven't found any reviews in the usual places.
INTRODUCTION MATHEMATICAL FORMULATION
b With an Indivisible Commodity
CAPACITATED STOCHASTIC TRANSPORTATION PROBLEMS
1 other sections not shown
active cells algorithm arc capacities arc i,j assign one unit capacitated stochastic transportation cell in block cell on arc cell with marginal cells are considered CM CM CM convex combination convex programming denote destination discrete probability distribution discrete probability function discrete random variables distribution tableau dual problem finite number fixed constraints go to Step holding minus salvage inactivate cell uv inactive cells incidence matrix initial solution integers Lagrangian function largest marginal cost Lemma Leontief production model limits on arc lowest marginal cost marginal distributions marginal penalty cost matrix minus salvage costs nonnegative number of active number of steps objective function optimal solution optimization procedure Penalty Cost Tables Problem 2.1 product h programming under uncertainty random variables second lowest shipping schedule Single Commodity Capacitated solution is optimal solve stochastic transportation problem supply plan total number two-stage linear programming unit shortage costs xihj