Performance evaluation of independent superbasic sets on nonlinear replicated networks
type: Item
instance of: scholarly article
title: Performance evaluation of independent superbasic sets on nonlinear replicated networks
zbMATH Open document ID: 0582.90031
DOI: 10.1016/0377-2217(86)90300-0
published in: European Journal of Operational Research
publication date: 1986-01-01T00:00:00Z
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.
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3932750
zbMATH Keywords: replicated networks
zbMATH Keywords: maximal basis spanning trees
zbMATH Keywords: network flow
zbMATH Keywords: transshipment
zbMATH Keywords: linking arcs
zbMATH Keywords: non-differentiable nonlinear functions
zbMATH Keywords: linearly constrained nonlinear programming
zbMATH Keywords: computational performance
zbMATH Keywords: independent superbasic sets
author: Laureano F. Escudero Bueno
MaRDI profile type: Publication
full work available at URL: 0377-2217(86)90300-0
OpenAlex ID: W2019821737
cites work: A Reduced Gradient Algorithm for Nonlinear Network Problems
cites work: Network flow problems with one side constraint: A comparison of three solution methods
cites work: Projected Newton methods and optimization of multicommodity flows
cites work: Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
cites work: A primal truncated newton algorithm with application to large-scale nonlinear network optimization
cites work: A scaled reduced gradient algorithm for network flow problems with convex separable costs
cites work: Truncated-Newton algorithms for large-scale unconstrained optimization
cites work: On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming
cites work: On optimizing a maximin nonlinear function subject to replicated quasi- arborescence-like constraints
cites work: A motivation for using the truncated Newton approach in a very large scale nonlinear network problem
cites work: Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
cites work: An efficient implementation of the network simplex method
cites work: Q3722233
cites work: Multipoint methods for separable nonlinear networks
cites work: Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
cites work: Two-Segment Separable Programming
cites work: Large-scale linearly constrained optimization
cites work: A Nonlinear Network Flow Algorithm for Maximization of Benefits in a Hydroelectric Power System
cites work: Q5534163
description: scientific article; zbMATH DE number 3932750