Convex cost flow. Adaptation of network simplex algorithm
Starting from the optimality test in Network Simplex Algorithm with linear objective function and the way of keeping a convex function defined on integer numbers, is proposed an adaptation of the algorithm mentioned above. The main topics in this article are related to the way of finding optimality conditions in the convex model, together with a description of the adapted algorithm.
network simplex optimality conditions convex programming combinatorial optimization