Simplicial Decomposition for Convex Generalized Networks

DOI10.1080/02522667.1990.10699030zbMath0739.90071MaRDI QIDQ4712275

David P. Ahlfeld, John M. Mulvey, Stavros A. Zenios

Publication date: 25 June 1992

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1990.10699030

zbMATH Keywords

simplicial decomposition; quasi-Newton algorithm; generalized network constraints; forcing sequence strategy; large scale nonlinear programs

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C06: Large-scale problems in mathematical programming

90C30: Nonlinear programming

49M27: Decomposition methods

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗, Vectorization and multitasking of nonlinear network programming algorithms, A smooth penalty function algorithm for network-structured problems, Application of the dual active set algorithm to quadratic network optimization

Uses Software

• NETGEN

Cites Work

• Solving Large Scale Generalized Networks
• OR Practice—Large-Scale Nonlinear Network Models and Their Application
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• A finite algorithm to maximize certain pseudoconcave functions on polytopes
• Simplicial decomposition in nonlinear programming algorithms
• Reporting computational experiments in mathematical programming
• Projected Newton Methods for Optimization Problems with Simple Constraints
• An extension of the frank and Wolfe method of feasible directions
• Elements of Large-Scale Mathematical Programming Part I: Concepts