A method of pseudobasis matrices

Authors

  • V. I. Kudin

DOI:

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

Keywords:

algorithmic schemes, pseudobasis matrices

Abstract

A method of analysis and optimization of linear systems (in particular, of solution of linear programming problems) is proposed. It is based on the conception of pseudobasis matrices. The necessary theoretical substantiation of the construction of algorithmic schemes is given. The conditions of uniqueness (nonuniqueness) of optimum solutions are found. The method can be applied to problems of large dimensions and to the identification of passive constraints of a model in the course of the iteration process.

Downloads

Download data is not yet available.

References

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

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

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

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

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

Downloads

Published

01.03.2025

How to Cite

Kudin, V. I. (2025). A method of pseudobasis matrices . Reports of the National Academy of Sciences of Ukraine, (8), 53–56. https://doi.org/10.15407/dopovidi2014.08.053

Issue

No. 8 (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.