|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 1983, Volume 23, Number 6, Pages 1326–1340
(Mi zvmmf4471)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
On regularization of lexicographic problems by the method of minimum concessions
V. N. Nefedov Moscow
Abstract:
A method of regularizing multistage lexicographic problems, based on the introduction of “concessions”, is studied, The class of lexicographic problems is determined, for which the method of concessions is regularizing with minimal tolerable concessions with respect to the criteria. For convex piecewise polynomial lexicographic problems, an estimate is obtained for the deviation of the regularized from the true solution.
Received: 28.01.1982 Revised: 21.10.1982
Citation:
V. N. Nefedov, “On regularization of lexicographic problems by the method of minimum concessions”, Zh. Vychisl. Mat. Mat. Fiz., 23:6 (1983), 1326–1340; U.S.S.R. Comput. Math. Math. Phys., 23:6 (1983), 27–36
Linking options:
https://www.mathnet.ru/eng/zvmmf4471 https://www.mathnet.ru/eng/zvmmf/v23/i6/p1326
|
Statistics & downloads: |
Abstract page: | 171 | Full-text PDF : | 69 | First page: | 1 |
|