A dual exterior point simplex type algorithm for the minimum cost network flow problem
2009 ◽
Vol 19
(1)
◽
pp. 157-170
◽
Keyword(s):
A new dual simplex type algorithm for the Minimum Cost Network Flow Problem (MCNFP) is presented. The proposed algorithm belongs to a special 'exterior- point simplex type' category. Similarly to the classical network dual simplex algorithm (NDSA), this algorithm starts with a dual feasible tree-solution and reduces the primal infeasibility, iteration by iteration. However, contrary to the NDSA, the new algorithm does not always maintain a dual feasible solution. Instead, the new algorithm might reach a basic point (tree-solution) outside the dual feasible area (exterior point - dual infeasible tree).
2009 ◽
Vol 36
(4)
◽
pp. 1176-1190
◽
Keyword(s):
Keyword(s):
2005 ◽
Vol 82
(5)
◽
pp. 609-616
Keyword(s):
2013 ◽
Vol 23
(1)
◽
pp. 3-17
◽
Keyword(s):
2017 ◽
Vol 30
(2)
◽
pp. 220
Keyword(s):
1999 ◽
Vol 25
(5)
◽
pp. 205-211
◽
Keyword(s):
1994 ◽
Vol 78
(1)
◽
pp. 116-129
◽
Keyword(s):