DECOMPOSITION ALGORITHMS POTENTIALS FOR THE NON-HOMOGENEOUS GENERALIZED NETWORKED PROBLEMS OF LINEAR-FRACTIONAL PROGRAMMING

DOI10.12732/IJPAM.V82I4.12zbMATH Open1264.65089OpenAlexW1982535648MaRDI QIDQ4917771

L. A. Pilipchuk

Publication date: 2 May 2013

Published in: International Journal of Pure and Apllied Mathematics (Search for Journal in Brave)

Full work available at URL: http://ijpam.eu/contents/2013-82-4/12/index.html

zbMATH Keywords

algorithmdecompositionpotentialslinear-fractional programmingflow programming optimizationincrement of the objective functiongeneralized multinetworktwo-component sparse matrix

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

This page was built for publication: DECOMPOSITION ALGORITHMS POTENTIALS FOR THE NON-HOMOGENEOUS GENERALIZED NETWORKED PROBLEMS OF LINEAR-FRACTIONAL PROGRAMMING

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