Dimensionality reduction for a class of convex network flow problem

DOI10.1080/00207728008967100MaRDI QIDQ3893695zbMATH OpenOpenAlexFDO

Authors P. Kerdvonbundit, T. R. Jefferson, Carlton H. Scott

Publication date 1980

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207728008967100

zbMATH Keywords

convex network flow problemdimensionality reductionflow conservation at each nodegeneralized geometric programminglower boundsunconstrained dual programupper bounds

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Mathematical programming (90C99)

Cites work

• Geometric Programming
• Least d-Majorized Network Flows with Inventory and Statistical Applications

This page was built for publication: Dimensionality reduction for a class of convex network flow problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3893695)