An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons
From MaRDI portal
Publication:4022698
DOI10.1057/jors.1992.149zbMath0768.90073MaRDI QIDQ4022698
C. J. Goh, Natashia Boland, Alistair I. Mees
Publication date: 17 January 1993
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1992.149
sequential quadratic programming; convex simplex method; quadratic cost functions; active set methods; network flow optimization; out-of-kilter algorithm
90C35: Programming involving graphs or networks
90C20: Quadratic programming
90B10: Deterministic network models in operations research
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Analytic efficient solution set for bi-criteria quadratic network programs, Unnamed Item, A method for convex curve approximation, Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs, A faster version of the ASG algorithm
Uses Software