Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

An improved mathematical programming algorithm and its convergence

Authors: Xiu, Naihua; Zhang, Guoliang; Wang, Xudong;

An improved mathematical programming algorithm and its convergence

Abstract

The authors propose two improved algorithms for solving the problems of optimal design and control of pipeline nets. One of them is a general model (P), in which the governing system of equations (EQ) is equivalent to an unconstrained minimization problem (P), while the other model (P') corresponds to the optimal design and control for the degraded nets of nonlinear pipelines. The proposed algorithms not only extend the scope of selection for the iterative matrix \(B\), but also diminish the number of subprograms by one, or more precisely, from 3 to 2. Moreover, they prove the convergence of their algorithms under certain conditions.

Keywords

Nonlinear programming, control of pipeline nets, Programming involving graphs or networks, optimal design

Powered by OpenAIRE graph
Found an issue? Give us feedback