On the closest point to the origin in transportation polytopes

DOI10.1016/J.DAM.2015.01.027MaRDI QIDQ299056zbMATH OpenOpenAlexFDO

Authors Gilberto Calvillo, David Romero

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 conditionsnorm minimizationorthogonal projectiontransportation polytope

Mathematics Subject Classification ID

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

Recommendations

• Adjacent Extreme Points Of A Transportation Polytope
• Extreme points of certain transportation polytopes with fixed total sums
• scientific article; zbMATH DE number 3861931
• The extreme points of centrosymmetric transportation polytopes
• scientific article; zbMATH DE number 3854809
• scientific article; zbMATH DE number 4172739
• A linear bound on the diameter of the transportation polytope
• Perturbation of transportation polytopes
• Combinatorics and geometry of transportation polytopes: an update
• Location of polygon vertices on circles and its application in transport studies

Cites work

• scientific article; zbMATH DE number 3561096 (Why is no real title available?)
• A Comparative Study of Algorithms for Matrix Balancing
• A linear bound on the diameter of the transportation polytope
• A survey of algorithms for exact distributions of test statistics in r\(\times c\) contingency tables with fixed margins
• Asymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes
• Combinatorics and geometry of transportation polytopes: an update
• Easy transportation-like problems on K-dimensional arrays
• Graphs of transportation polytopes
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Minimum norm problems over transportation polytopes
• On the number of faces of certain transportation polytopes
• Permutohedra and minimal matrices
• Perturbation of central transportation polytopes of order \(kn \times n\)
• Signature classes of transportation polytopes
• Solution of projection problems over polytopes
• The polynomial solvability of convex quadratic programming

Cited in

(4)

• Projecting onto rectangular matrices with prescribed row and column sums
• Adjacent Extreme Points Of A Transportation Polytope
• The extreme points of centrosymmetric transportation polytopes
• The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential

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

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