Easy transportation-like problems on K-dimensional arrays

DOI10.1007/BF00940537zbMath0679.90037OpenAlexW1988519304MaRDI QIDQ1823138

David Romero

Publication date: 1990

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940537

zbMATH Keywords

norm minimizationinput-output matrices

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Multisectoral models in economics (91B66) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

On the closest point to the origin in transportation polytopes ⋮ Projecting onto rectangular matrices with prescribed row and column sums ⋮ On multi-index assignment polytopes

Cites Work

• A survey of algorithms for exact distributions of test statistics in r\(\times c\) contingency tables with fixed margins
• Minimum norm problems over transportation polytopes
• A lagrangean relaxation algorithm for the constrained matrix problem
• Dualität und Approximation bei konvexen Optimierungsproblemen
• Contingency tables with given marginals

This page was built for publication: Easy transportation-like problems on K-dimensional arrays