Geodesic
The algorithm for determination of immobile indixes in convex SIP problems with polyhedral index sets
Problemy fiziki, matematiki i tehniki, no. 3 (2014), pp. 65-76

Voir la notice de l'article provenant de la source Math-Net.Ru

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, immobility order, cone of feasible directions, extreme ray.
Mots-clés : immobile index 
@article{PFMT_2014_3_a12,
     author = {M. V. Kulahina},
     title = {The algorithm for determination of immobile indixes in convex {SIP} problems with polyhedral index sets},
     journal = {Problemy fiziki, matematiki i tehniki},
     pages = {65--76},
     publisher = {mathdoc},
     number = {3},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PFMT_2014_3_a12/}
}
TY  - JOUR
AU  - M. V. Kulahina
TI  - The algorithm for determination of immobile indixes in convex SIP problems with polyhedral index sets
JO  - Problemy fiziki, matematiki i tehniki
PY  - 2014
SP  - 65
EP  - 76
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PFMT_2014_3_a12/
LA  - ru
ID  - PFMT_2014_3_a12
ER  - 
%0 Journal Article
%A M. V. Kulahina
%T The algorithm for determination of immobile indixes in convex SIP problems with polyhedral index sets
%J Problemy fiziki, matematiki i tehniki
%D 2014
%P 65-76
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PFMT_2014_3_a12/
%G ru
%F PFMT_2014_3_a12
M. V. Kulahina. The algorithm for determination of immobile indixes in convex SIP problems with polyhedral index sets. Problemy fiziki, matematiki i tehniki, no. 3 (2014), pp. 65-76. http://geodesic.mathdoc.fr/item/PFMT_2014_3_a12/