Article ID: | iaor20082005 |
Country: | Belarus |
Volume: | 51 |
Issue: | 3 |
Start Page Number: | 16 |
End Page Number: | 19 |
Publication Date: | May 2007 |
Journal: | Doklady of the National Academy of Sciences of Belarus |
Authors: | Gabasov R., Kirillova F.M. |
Keywords: | duality |
A dual method of solution of a linear programming problem of arbitrary form based on a new notion of a base to a canonical linear programming problem with two-side direct constraints is suggested. The theorems on the support optimality and algorithm finiteness are formulated.