## Fixed-charge Transportation Problem: A Group Theoretic Approach |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

LITERATURE SURVEY | 7 |

A GROUP THEORETIC ALGORITHM | 23 |

COMPUTATIONAL EXPERIENCE | 72 |

4 other sections not shown

### Other editions - View all

### Common terms and phrases

0_ mod 0-1 integer programming adjacent extreme points basic basis of Aq c_'x candidate problems Chapter completes the proof computational experience CONTINUE corresponding Cramer's Rule Define DEFINITION destination det(A det(B determine developed DPEN(y edge FCFP FCMIN FCMIN(J FCTPR FCTPT feasible solution fixed cost fixed-charge transportation problem Go to step graph group problem associated Hence heuristic ID ID integer programming problem intermediate node ith column JEFF Johnson 24 KOOL Lemma LIFO linear programming linear transformation lower bound multiparametric integer programming node-arc incidence matrix non-singular non-zero entry nonbasic variables objective function obtained optimal basis optimal solution optimal tableau PEN(CPR penalties procedure proof of proposition proposition 13 relaxed problem rooted spanning forest selection simple path simplex algorithm solution to FCTP step 17 submatrix Suppose test problems tree v(CPR VCMIN(I VCPR vertex vertices zero