This article is cited 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.

UDC: 519.85

MSC: Primary 90B50; Secondary 41A65

Received: 28.01.1982
Revised: 21.10.1982

 English version: USSR Computational Mathematics and Mathematical Physics, 1983, 23:6, 27–36

Bibliographic databases:

• 
•