Odd cycles and a class of facets of the axial 3-index assignment polytope
On a category of linear mathematical programming problems with interval coefficients.
On cycling in the simplex method of the transportation problem
This paper shows that cycling of the simplex method for the m × n transportation problem where k-1 zero basic variables are leaving and reentering the basis does not occur once it does not occur in the k × k assignment problem. A method to disprove cycling for a particular k is applied for k=2,3,4,5 and 6.
On systems, periods and semipositive mappings
On the approximation of inconsistent inequality systems.
Optimal allocation in multivariate sampling through Chebyshev approximation.
Optimal Location of Production Centers Interconnected Materials and Products Allocation