scientific article; zbMATH DE number 3952462
[For the entire collection see Zbl 0572.00008.] Let a directed network with m nodes and n arcs be given. The general nonlinear network flow problem consists in finding a vector flow \(x=(x_ 1,...,x_ n)\) solution of the problem min\(\{\) f(x)\(|\) \(Ax=b\), \b{x}\(\leq x\leq \bar x\}\) where \(f: R^ n\to R\) is a cost function, A is the \(m\times n\) node-arc incidence matrix of the network, \(Ax=b\) expresses the flow conservation constraints and \b{x} and \(\bar x\) denote the lower and upper bound on the flow x. An important class of problems of this type is the hydrogeneration scheduling problem. The authors consider this problem in case of nondifferentiable convex function f of a certain type and for the solution they adopt a reduced subgradient algorithm of \textit{A. Bihain} et al. [Internal Report 84/3, Dept. of Mathematics, Fac. Univ. N.-D. de la Paix, Namur, Belgium (1984)].
- Quadratic cost flow and the conjugate gradient method
- Approximate subgradient methods for nonlinearly constrained network flow problems
- A reduced subgradient algorithm
- scientific article; zbMATH DE number 4125201
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3722233)