This article is cited in 4 papers

Methods of Chebyshev points of convex sets and their applications

T. I. Belykh^a, V. P. Bulatov^b, È. N. Yas'kova<sup>b

a</sup> Baikal State University of Economics and Law, ul. Lenina 11, Irkutsk, 664003, Russia
^b Melentiev Energy System Institute, Siberian Branch, Russian Academy of Sciences, ul. Lermontova 130, Irkutsk, 664033, Russia

Abstract: Chebyshev points of bounded convex sets, search algorithms for them, and various applications to convex programming are considered for simple approximations of reachable sets, optimal control, global optimization of additive functions on convex polyhedra, and integer programming. The problem of searching for Chebyshev points in multicriteria models of development and operation of electric power systems is considered.

Key words: convex programming, problem, convex sets, Chebyshev points, integer programming problem.

UDC: 519.651

Received: 09.04.2007

 English version: Computational Mathematics and Mathematical Physics, 2008, 48:1, 16–29

Bibliographic databases:

• 
• 
• 
•