The method of permissible basis matrices

Authors

  • V. I. Kudin

DOI:

https://doi.org/10.15407/dopovidi2014.09.044

Keywords:

basis matrices, permission

Abstract

A method of analysis and optimization of a linear system, namely the method of permissible basis matrices, is proposed. The method (e. g., solving the linear programming problems) is based on the concept of basis matrices. This paper provides the necessary theoretical justification for the construction of algorithmic schemes. The conditions of uniqueness and nonuniqueness of optimal solutions are established. The method aims to solve the problems of large dimension and to identify the passive constraints of a model in the iterative process.

Downloads

Download data is not yet available.

References

Skhreiwer A. The theory of linear and integer programming. Vol. 1., Moscow, 1991 (in Russian).

Chernikov S. N. Linear inequalities, Moscow: Mir, 1968 (in Russian).

Kudin V. I., Lyashko S. I., Yatsenko Yu. P., Khrytonenko N. M. Kibernetika i system. analiz, 2007, No 4: 119–127 (in Russian).

Volkovich V. L., Voynalovaich V. M., Kudin V. I. Avtomatika, 1987, No 4: 79–86 (in Russian).

Kudin V. I., Lyashko S. I., Yatsenko Yu. P., Khrytonenko N. M. Dopov. Nac. akad. nauk Ukr., 2007, No 9: 29–33 (in Ukrainian).

Downloads

Published

06.03.2025

How to Cite

Kudin, V. I. (2025). The method of permissible basis matrices . Reports of the National Academy of Sciences of Ukraine, (9), 44–48. https://doi.org/10.15407/dopovidi2014.09.044

Issue

No. 9 (2014): Reports of the National Academy of Sciences of Ukraine

Section

Information Science and Cybernetics

License

Copyright (c) 2025 Reports of the National Academy of Sciences of Ukraine

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.