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




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Avtomatika i Telemekhanika, 1981, Issue 11, Pages 104–113 (Mi at6048)  
Developing Systems

A direct method for decomposition of a linear programming problem. I

V. E. Krivtsov

Moscow
Full-text PDF (1594 kB)
Abstract: A direct decomposition method is suggested for a linear programming problem whereby the original problem is reduced to a piecewise-linear programming problem. The latter is solved by using a special algorithm which implements a procedure of methods of feasible directions. An example is discussed.

Received: 07.08.1980
Bibliographic databases:
Document Type: Article
UDC: 519.82:518.5
Language: Russian
Citation: V. E. Krivtsov, “A direct method for decomposition of a linear programming problem. I”, Avtomat. i Telemekh., 1981, no. 11, 104–113; Autom. Remote Control, 42:11 (1981), 1516–1523
Citation in format AMSBIB
\Bibitem{Kri81}
\by V.~E.~Krivtsov
\paper A direct method for decomposition of a linear programming problem.~I
\jour Avtomat. i Telemekh.
\yr 1981
\issue 11
\pages 104--113
\mathnet{http://mi.mathnet.ru/at6048}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=705153}
\zmath{https://zbmath.org/?q=an:0491.49022}
\transl
\jour Autom. Remote Control
\yr 1981
\vol 42
\issue 11
\pages 1516--1523
Linking options:
  • https://www.mathnet.ru/eng/at6048
  • https://www.mathnet.ru/eng/at/y1981/i11/p104
    Cycle of papers
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:191
    Full-text PDF :98
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024