Simplicial Decomposition for Convex Generalized Networks

DOI10.1080/02522667.1990.10699030MaRDI QIDQ4712275zbMATH OpenOpenAlexFDO

Authors John M. Mulvey, David P. Ahlfeld, 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

forcing sequence strategygeneralized network constraintslarge scale nonlinear programsquasi-Newton algorithmsimplicial decomposition

Mathematics Subject Classification ID

Decomposition methods (49M27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Programming involving graphs or networks (90C35)

Recommendations

• Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints
• Restricted simplicial decomposition for convex constrained problems
• Restricted simplicial decomposition with side constraints
• Restricted simplicial decomposition: Computation and extensions
• Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems

Cites work

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

Cited in

(11)

• Finiteness in restricted simplicial decomposition
• Vectorization and multitasking of nonlinear network programming algorithms
• A smooth penalty function algorithm for network-structured problems
• Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints
• Restricted simplicial decomposition for convex constrained problems
• Application of the dual active set algorithm to quadratic network optimization
• Network design applications of the class of column generation/simplicial decomposition algorithms in convex differentiable optimization
• Solving Large Scale Generalized Networks
• Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems
• A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗
• Restricted simplicial decomposition with side constraints

Describes a project that uses

Uses Software

• NETGEN

This page was built for publication: Simplicial Decomposition for Convex Generalized Networks

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