Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets
Year of publication: |
2020
|
---|---|
Authors: | Kostyukova, Olga ; Tchemisova, T. V. |
Published in: |
INFOR : information systems and operational research. - Abingdon : Taylor & Francis Group, ISSN 1916-0615, ZDB-ID 1468358-1. - Vol. 58.2020, 2, p. 182-201
|
Subject: | cone of feasible directions | convex programming (CP) | extremal ray | immobile index | immobility order | Semi-infinite programming (SIP) | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Implicit optimality criterion for convex SIP problem with box constrained index set
Kostyukova, O., (2012)
-
Optimal proactive monitor placement & scheduling for IoT networks
Mostafa, Basma, (2022)
-
Eirinakis, Pavlos, (2024)
- More ...
-
Implicit optimality criterion for convex SIP problem with box constrained index set
Kostyukova, O. I., (2012)
-
Implicit optimality criterion for convex SIP problem with box constrained index set
Kostyukova, O. I., (2012)
- More ...