Dimensionality reduction for a class of convex network flow problem

DOI10.1080/00207728008967100zbMath0447.90084OpenAlexW2164869305MaRDI QIDQ3893695

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

Publication date: 1980

Published in: International Journal of Systems Science (Search for Journal in Brave)

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

zbMATH Keywords

upper boundslower boundsdimensionality reductiongeneralized geometric programmingunconstrained dual programconvex network flow problemflow conservation at each node

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) 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