LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems. The implementation and testing of LSNNO, a new FORTRAN subroutine for solving large-scale nonlinear network optimization problems is described. The implemented algorithm applies the concepts of partial separability and partitioned quasi-Newton updating to high-dimensional nonlinear network optimization problems. Some numerical results on both academic and practical problems are reported.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element