We consider two person zero-sum repeated games with lack of information on one side and with payoffs of special “separable” form. The solutions for these games are reduced to the solutions for families of special transportation type problems with recursive structure. We illustrate our...

LetG=(U,V,E) be a bipartite graph with weights of its edgesc <Subscript> ij </Subscript>. For the assignment and transportation problem given by such a graph we propose efficient procedures for partitioning the edge setE into three classes:E <Subscript>o</Subscript> is the set of edgesij withx <Subscript> ij </Subscript>=0 for each optimum solution (0-persistent...</subscript></subscript></subscript>

В статье определена зависимость между конкурентной стратегией и оперативным уровнем управления логистической системой предприятия. Представлено решение...

The problem of finding an appropriate transportation plan for a transport company collaborating with a window manufacturer to reduce transport costs by minimizing the total distance travelled and provide a minimum car fleet is presented in this paper. The problem involves 3 major manufacturing...

The factored transportation problem is one having cost coefficients of the form c_ij = u_iv_j. The main result proven in this paper is that if rows are arranged according to nonincreasing u_i and columns by nondecreasing v_j, then the northwest corner rule provides an optimal solution. Applications...

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...

Transportation Problem (TP) is one of the basic operational research problems, which plays an important role in many practical applications. In this paper, a bio-inspired mathematical model is proposed to handle the Linear Transportation Problem (LTP) in directed networks by modifying the...