IJPAM: Volume 82, No. 4 (2013)

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

L.A. Pilipchuk
Belarussian State University
Nezalezhnosti Ave. 4, 220050, Minsk, BELARUS


Abstract. We use potentials for calculate a reduced costs in the increment of the objective function for the linear-fractional non-homogeneous flow programming optimization problem with additional constraints of general kind. The effective algorithm for solution of the system of potentials for a sparse matrix is considered.

Received: November 1, 2012

AMS Subject Classification: 65K05, 90C08, 90C35, 05C50, 15A03, 15A06

Key Words and Phrases: linear-fractional programming, two-component sparse matrix, increment of the objective function, decomposition, potentials, generalized multinetwork

Download paper from here.



DOI: 10.12732/ijpam.v82i4.12 How to cite this paper?
Source:
International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2013
Volume: 82
Issue: 4