On the closest point to the origin in transportation polytopes

DOI10.1016/j.dam.2015.01.027zbMath1351.90120OpenAlexW2057274528MaRDI QIDQ299056

David Romero, Gilberto Calvillo

Publication date: 22 June 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.01.027

zbMATH Keywords

inverse problemquadratic optimizationKarush-Kuhn-Tucker conditionsorthogonal projectionnorm minimizationtransportation polytope

Mathematics Subject Classification ID

Quadratic programming (90C20) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (2)

Projecting onto rectangular matrices with prescribed row and column sums ⋮ The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential

Cites Work

• Signature classes of transportation polytopes
• A linear bound on the diameter of the transportation polytope
• Graphs of transportation polytopes
• A survey of algorithms for exact distributions of test statistics in r\(\times c\) contingency tables with fixed margins
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Minimum norm problems over transportation polytopes
• Solution of projection problems over polytopes
• On the number of faces of certain transportation polytopes
• Easy transportation-like problems on K-dimensional arrays
• Permutohedra and minimal matrices
• Combinatorics and Geometry of Transportation Polytopes: An Update
• A Comparative Study of Algorithms for Matrix Balancing
• Asymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes
• The polynomial solvability of convex quadratic programming
• Unnamed Item
• Unnamed Item

This page was built for publication: On the closest point to the origin in transportation polytopes