What people are saying - Write a review
We haven't found any reviews in the usual places.
THE DISTRIBUTIONTRANSPORTATION PROBLEM
INTRODUCTION TO NETWORK MODELS
2 other sections not shown
Other editions - View all
active cell active links active vectors arbitrary artificial variables assigned basic feasible list basic feasible network basis for Program Basis Vectors Objective cell i,j column numbers corresponding tableau cost coefficient denote destination requirements directed network distribution list dual linear program enter the basis equation feasible full list feasible network list Figure 14 Figure 17 flow in cell following linear program forward links inactive cell inactive link incidence vectors initial basic feasible linear combination linearly independent link i,j list for Program list is feasible network flow problem node potentials nonbasic vector optimal basic feasible pivot element Pl P2 P3 Program E22 Program E6 program in standard Program PG pseudoflow pseudopath range interval Represented Basis Vectors reverse links row and column simplex algorithm simplex tableau slack variables standard form Step structural vectors Suppose surplus variable Theorem total cost transportation problem Vectors Objective Function Vectors Represented Basis