🚀 go-pugleaf

	I am interested in obtaining either C or FORTRAN coding for
a generalized network solver. The particular problem of interest is 
this:
	Consider a directed graph with set of nodes, N, and  a set of arcs, ARCS.
Each arc, (i,j), has a scalar associated with it, Aij   , the COST of (i,j).
Let Fij  denote the FLOW on arc (i,j). There are upper and lower bounds on Fij,
Cij and Lij respectively.

With each arc (i,j),  there is an associated scalar Kij, the GAIN of arc (i,j).

The problem:
                 _
      minimize   > Aij Fij
                 -
         (i,j) element of ARCS


subject to

         (Conservation of flow)
          _                               _
          >  Kmi  Fmi          -          >  Fim          =  0    (For All i in N)
          -                               -
          m                               m
   (m,i) element of ARCS        (i,m) element of ARCS

       
          (capacity constraints)

          Lij <=  Fij   <=  Cij        (for all (i,j) in the set ARCS)	   

------------------------------------------------------------------------------------

I am interested in obtaining a network solver that handles the above for 
cases with  Kij not always unity (ie networks with gains and losses.)

I already have a paper by Bertsekas and Tseng (OPERATIONS RESEARCH, VOL36 No 1
1988),  in which an algorithm is formulated for solving a network with Gains.
Does anyone know if the algorithm has been coded ? I know that they have already 
coded a solver for a zero-gain network.

Any help gratefully recieved.

Kurt Brinschwitz.