Avtomatika i Telemekhanika
 RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 General information Latest issue Archive Impact factor Guidelines for authors Submit a manuscript Search papers Search references RSS Latest issue Current issues Archive issues What is RSS

 Avtomat. i Telemekh.: Year: Volume: Issue: Page: Find

 Avtomat. i Telemekh., 1981, Issue 9, Pages 86–94 (Mi at5910)

Developing Systems

A finite method for solution of a general linear programming problem with a reduced number of iterations

M. A. Zuenkov, V. V. Ignatushchenko

Moscow

Abstract: A finite method is proposed for solution of a general linear programming problem. The algorithms are designed so that the search is performed only among vertices of the constrain polyhedron which are associated with vertices of a two-dimensional polyhedral set which is the mapping of the initial polyhedron on a plane chosen in a special / way. The mapping itself is not performed; a check is only made that the vertex is a vertex in the mapping.

Full text: PDF file (1439 kB)

English version:
Automation and Remote Control, 1981, 42:9, 1204–1211

Bibliographic databases:
UDC: 519.82

Citation: M. A. Zuenkov, V. V. Ignatushchenko, “A finite method for solution of a general linear programming problem with a reduced number of iterations”, Avtomat. i Telemekh., 1981, no. 9, 86–94; Autom. Remote Control, 42:9 (1981), 1204–1211

Citation in format AMSBIB
\Bibitem{ZueIgn81} \by M.~A.~Zuenkov, V.~V.~Ignatushchenko \paper A finite method for solution of a general linear programming problem with a reduced number of iterations \jour Avtomat. i Telemekh. \yr 1981 \issue 9 \pages 86--94 \mathnet{http://mi.mathnet.ru/at5910} \mathscinet{http://www.ams.org/mathscinet-getitem?mr=705506} \zmath{https://zbmath.org/?q=an:0491.49024} \transl \jour Autom. Remote Control \yr 1981 \vol 42 \issue 9 \pages 1204--1211