Correction of improper linear programming problems in canonical form by applying the minimax criterion

Given an inconsistent system of linear algebraic equations, necessary and sufficient conditions are established for the solvability of the problem of its matrix correction by applying the minimax criterion with the assumption that the solution is nonnegative. The form of the solution to the correcte...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computational mathematics and mathematical physics Ročník 52; číslo 12; s. 1624 - 1634
Hlavní autor: Barkalova, O. S.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Dordrecht SP MAIK Nauka/Interperiodica 01.12.2012
Springer Nature B.V
Témata:
Algebra
Computational mathematics
Computational Mathematics and Numerical Analysis
Criteria
Linear programming
Mathematical analysis
Mathematical models
Mathematics
Mathematics and Statistics
Matlab
Matrix
Minimax technique
Simplex method
Studies
Vectors (mathematics)
matrix correction
inconsistent system of linear algebraic equations
minimax criterion
improper linear programming problem
MATLAB
ISSN:0965-5425, 1555-6662
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Given an inconsistent system of linear algebraic equations, necessary and sufficient conditions are established for the solvability of the problem of its matrix correction by applying the minimax criterion with the assumption that the solution is nonnegative. The form of the solution to the corrected system is presented. Two formulations of the problem are considered, specifically, the correction of both sides of the original system and correction with the right-hand-side vector being fixed. The minimax-criterion correction of an improper linear programming problem is reduced to a linear programming problem, which is solved numerically in MATLAB.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0965-5425
1555-6662
DOI:10.1134/S0965542512120044