|
Sibirskii Matematicheskii Zhurnal, 2011, Volume 52, Number 3, Pages 615–618
(Mi smj2223)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
The polyhedral Lagrange principle
S. S. Kutateladze Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Abstract:
The Lagrange principle is established for dominated polyhedral sublinear operators.
Keywords:
Dedekind complete vector lattice, linear programming, polyhedral sublinear inequalities, interval equations, Farkas lemma, Boolean valued analysis.
Received: 23.03.2011
Citation:
S. S. Kutateladze, “The polyhedral Lagrange principle”, Sibirsk. Mat. Zh., 52:3 (2011), 615–618; Siberian Math. J., 52:3 (2011), 484–486
Linking options:
https://www.mathnet.ru/eng/smj2223 https://www.mathnet.ru/eng/smj/v52/i3/p615
|
Statistics & downloads: |
Abstract page: | 339 | Full-text PDF : | 106 | References: | 55 | First page: | 22 |
|