|
Problemy Fiziki, Matematiki i Tekhniki (Problems of Physics, Mathematics and Technics), 2014, Issue 3(20), Pages 65–76
(Mi pfmt325)
|
|
|
|
This article is cited in 1 scientific paper (total 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.
Received: 06.06.2014
Citation:
M. V. Kulahina, “The algorithm for determination of immobile indixes in convex SIP problems with polyhedral index sets”, PFMT, 2014, no. 3(20), 65–76
Linking options:
https://www.mathnet.ru/eng/pfmt325 https://www.mathnet.ru/eng/pfmt/y2014/i3/p65
|
Statistics & downloads: |
Abstract page: | 126 | Full-text PDF : | 39 | References: | 43 |
|