Multiparametric demand transportation problem

DOI10.1016/S0377-2217(01)00357-5zbMath0993.90013OpenAlexW2003595047MaRDI QIDQ1604061

Carlo Filippi, Giorgio Romanin-Jacur

Publication date: 3 July 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00357-5

zbMATH Keywords

parametric programmingtransportationnetwork programming

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Sensitivity, stability, parametric optimization (90C31) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (3)

Solving Large Batches of Linear Programs ⋮ An algorithm for approximate multiparametric linear programming ⋮ Global sensitivity analysis via a statistical tolerance approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theorem on flows in networks
• A geometric view of parametric linear programming
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• The facets of the polyhedral set determined by the Gale-Hoffman inequalities
• How good are convex hull algorithms?
• A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
• Lifting projections of convex polyhedra
• Faces of dual transportation polyhedra
• Decomposing the requirement space of a transporation problem into polyhedral cones
• A construction method in parametric programming
• New Finite Pivoting Rules for the Simplex Method
• Multiparametric Linear Programming

This page was built for publication: Multiparametric demand transportation problem