Multiparametric demand transportation problem

European Journal of Operational Research

Volumn 139, Issue 2, 2002, Pages 206-219

  Filippi, Carlo ^a   Romanin Jacur, Giorgio ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

Network programming; Parametric programming; Transportation

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; TREES (MATHEMATICS); VECTORS;

NETWORK PROGRAMMING;

OPERATIONS RESEARCH;

EID: 0036604837     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00357-5     Document Type: Article

References (17)

1. A geometric view of parametric linear programming
2. How good are convex hull algorithms?
3. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
4. Faces of dual transportation polyhedra
5. New finite pivoting rules for the simplex method
6. Multiparametric linear programming
7. A theorem on flows in networks
8. A constructing method in parametric programming
9. A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
10. Lifting projections of convex polyhedra
11. Decomposing the requirement space of a transportation problem into polyhedral cones
12. The facets of the polyhedral set determined by the Gale-Hoffman inequalities