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

DOI10.1057/JORS.1992.149MaRDI QIDQ4022698zbMATH OpenOpenAlexFDO

Authors Natashia Boland, C. J. Goh, Alistair Mees

Publication date 17 January 1993

Published in The 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

active set methodssequential quadratic programmingconvex simplex methodquadratic cost functionsnetwork flow optimizationout-of-kilter algorithm

Mathematics Subject Classification ID

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

Recommendations

• A method of network programming in problems of nonlinear optimization
• Algorithms for network piecewise-linear programs: A comparative study
• scientific article; zbMATH DE number 433004
• Algorithms for the non-bifurcated network design problem
• Vectorization and multitasking of nonlinear network programming algorithms
• scientific article; zbMATH DE number 1057923
• An efficient method for nonlinearly constrained networks
• scientific article; zbMATH DE number 738908
• Non-static network optimization problems: A survey

Cited in

(18)

• scientific article; zbMATH DE number 3869028 (Why is no real title available?)
• scientific article; zbMATH DE number 3892919 (Why is no real title available?)
• Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
• scientific article; zbMATH DE number 433004 (Why is no real title available?)
• scientific article; zbMATH DE number 2206640 (Why is no real title available?)
• Analytic efficient solution set for bi-criteria quadratic network programs
• Performance evaluation of independent superbasic sets on nonlinear replicated networks
• Quadratic cost flow and the conjugate gradient method
• Computational development of a lagrangian dual approach for quadratic networks
• A method for convex curve approximation
• A faster version of the ASG algorithm
• DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
• Nonlinear Network Programming on Vector Supercomputers: A Study on the CRAY X-MP
• A comparison of phase and nonphase network flow algorithms
• A method of network programming in problems of nonlinear optimization
• Algorithms for network piecewise-linear programs: A comparative study
• A global convergent algorithm for flows in a two-dimensional network
• Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs

Describes a project that uses

Uses Software

• NLPQL

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4022698)