Performance evaluation of independent superbasic sets on nonlinear replicated networks

DOI10.1016/0377-2217(86)90300-0MaRDI QIDQ1068689zbMATH OpenOpenAlexFDO

Authors Laureano F. Escudero Bueno

Publication date 1986

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(86)90300-0

zbMATH Keywords

computational performanceindependent superbasic setslinearly constrained nonlinear programminglinking arcsmaximal basis spanning treesnetwork flownon-differentiable nonlinear functionsreplicated networkstransshipment

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Review text

We describe a new type of network flow problems that basically consists of the classical transshipment problem with the following extensions: (1) The replication of a network by producing subnetworks with identical structure, being linked by so-called linking arcs; (2) the objective function terms related to the linking arcs are non-differentiable nonlinear functions. By using a networks-specialized implementation of a linearly constrained nonlinear programming algorithm described elsewhere, we report the computational performance of the new concept of independent superbasic sets that allows to obtain in parallel independent pieces of the solution at each iteration.

Recommendations

• On optimizing a maximin nonlinear function subject to replicated quasi- arborescence-like constraints
• An efficient method for nonlinearly constrained networks
• scientific article; zbMATH DE number 1057923
• An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons
• Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup

Cites work

• A motivation for using the truncated Newton approach in a very large scale nonlinear network problem
• A Nonlinear Network Flow Algorithm for Maximization of Benefits in a Hydroelectric Power System
• A primal truncated newton algorithm with application to large-scale nonlinear network optimization
• A Reduced Gradient Algorithm for Nonlinear Network Problems
• A scaled reduced gradient algorithm for network flow problems with convex separable costs
• An efficient implementation of the network simplex method
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• scientific article; zbMATH DE number 3952462 (Why is no real title available?)
• scientific article; zbMATH DE number 3246195 (Why is no real title available?)
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
• Large-scale linearly constrained optimization
• Multipoint methods for separable nonlinear networks
• Network flow problems with one side constraint: A comparison of three solution methods
• On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming
• On optimizing a maximin nonlinear function subject to replicated quasi- arborescence-like constraints
• Projected Newton methods and optimization of multicommodity flows
• Truncated-Newton algorithms for large-scale unconstrained optimization
• Two-Segment Separable Programming

Cited in

(4)

• Network planning under uncertainty with an application to hydropower generation
• Measuring robustness of superpeer topologies
• On large scale nonlinear network optimization
• A survey of dynamic network flows

This page was built for publication: Performance evaluation of independent superbasic sets on nonlinear replicated networks

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