RUS  ENG
Full version
JOURNALS // Avtomatika i Telemekhanika // Archive

Avtomat. i Telemekh., 2004 Issue 3, Pages 71–79 (Mi at1542)

This article is cited in 5 papers

Discrete Optimization

On the noninteger polyhedron vertices of the three-index axial transportation problem

M. K. Kravtsov, E. V. Lukshin

Scientific and research economic institute of Ministry of economy of the Republic of Belarus

Abstract: For the three-index axial transportation polyhedron defined by the integer vector, existence of noninteger vertices was proved. In particular, the three-index $nmk$ axial transportation polyhedron having vertices with $r$ fractional components was shown to exist for and only for any number $r\in\{4,6,7,\dots,\delta (n,m,k)\}$, where $\delta(n,m,k)=\min\{n,m+k-2\}+m+k-2$, $n\geq m\geq k\geq 3$.

Presented by the member of Editorial Board: A. I. Kibzun

Received: 27.06.2003


 English version:
Automation and Remote Control, 2004, 65:3, 422–430

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025