GENOS 1.0

Nonlinear optimization for problems with network and generalized network constraints

The algorithms in GENOS 1.0 include network simplex, primal truncated Newton, and simplicial decomposition.

Software is written in ANSI Fortran, in double precision. Machine dependencies are restricted to the subroutine that defines machine-dependent constants. Versions of the code that are optimized for vector and parallel architectures are available.

Need more info?

John Mulvey                       Stavros A. Zenios 
Princeton University              The Wharton School 
Princeton, NJ 08544               University of Pennsylvania 
mulvey@macbeth.princeton.edu      zenios@wharton.upenn.edu

Reference:

R. S. Dembo, J. M. Mulvey and S. A. Zenios, Large-scale nonlinear network models and their application, Oper. Res 37, (1989), pp. 353--372.

J. M. Mulvey and S. A. Zenios, GENOS 1.0 User's Guide: A generalized network optimization system, Report 87-13-03, Department of Decision Science, The Wharton School, University of Pennsylvania, 1987.

[ Optimization Software Guide | OTC Home Page | NEOS Server | NEOS Guide ]