An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons

DOI10.1057/jors.1992.149zbMath0768.90073OpenAlexW1995219443MaRDI 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

zbMATH Keywords

sequential quadratic programmingconvex simplex methodquadratic cost functionsactive set methodsnetwork flow optimizationout-of-kilter algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Quadratic programming (90C20) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

A faster version of the ASG algorithm ⋮ 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

Uses Software

• NLPQL

This page was built for publication: An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons