This article is cited in 1 paper

MATHEMATICS

The algorithm for determination of immobile indixes in convex SIP problems with polyhedral index sets

M. V. Kulahina

Institute of Mathematics of National Academy of Sciences of Belarus, Minsk, Belarus

Abstract: The convex Semi-Infinite Programming (SIP) problems with polyhedral index sets are considered. For these problems a finite algorithm for determination of immobile indixes and their immobility orders along the feasible directions is described and justified. An example illustrating the application of the algorithm is provided.

Keywords: semi-infinite programming, convex programming, immobile index, immobility order, cone of feasible directions, extreme ray.

UDC: 519.853

Received: 06.06.2014