Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets

Detalhes bibliográficos
Autor(a) principal: Kostyukova, O. I.
Data de Publicação: 2019
Outros Autores: Tchemisova, T. V.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
Texto Completo: http://hdl.handle.net/10773/25231
Resumo: The concepts of immobile indices and their immobility orders are objective and important characteristics of feasible sets of semi-infinite programming (SIP) problems. They can be used for the formulation of new efficient optimality conditions without constraint qualifications. Given a class of convex SIP problems with polyhedral index sets, we describe and justify a finite constructive algorithm (algorithm DIIPS) that allows to find in a finite number of steps all immobile indices and the corresponding immobility orders along the feasible directions. This algorithm is based on a representation of the cones of feasible directions in the polyhedral index sets in the form of linear combinations of extremal rays and on the approach proposed in our previous papers for the cases of immobile indices’ sets of simpler structures. A constructive procedure of determination of the extremal rays is described, and an example illustrating the application of the DIIPS algorithm is provided.
id RCAP_c45f31446c3fb0c06361dbc9faff400f
oai_identifier_str oai:ria.ua.pt:10773/25231
network_acronym_str RCAP
network_name_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository_id_str https://opendoar.ac.uk/repository/7160
spelling Algorithmic determination of immobile indices in convex SIP problems with polyhedral index setsSemi-infinite programming (SIP)Convex programming (CP)Immobile indexImmobility orderCone of feasible directionsExtremal rayThe concepts of immobile indices and their immobility orders are objective and important characteristics of feasible sets of semi-infinite programming (SIP) problems. They can be used for the formulation of new efficient optimality conditions without constraint qualifications. Given a class of convex SIP problems with polyhedral index sets, we describe and justify a finite constructive algorithm (algorithm DIIPS) that allows to find in a finite number of steps all immobile indices and the corresponding immobility orders along the feasible directions. This algorithm is based on a representation of the cones of feasible directions in the polyhedral index sets in the form of linear combinations of extremal rays and on the approach proposed in our previous papers for the cases of immobile indices’ sets of simpler structures. A constructive procedure of determination of the extremal rays is described, and an example illustrating the application of the DIIPS algorithm is provided.Taylor & Francis2019-02-06T14:51:09Z2020-01-01T00:00:00Z2020info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10773/25231eng0315-598610.1080/03155986.2018.1553754Kostyukova, O. I.Tchemisova, T. V.info:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2024-05-06T04:18:49Zoai:ria.ua.pt:10773/25231Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-28T14:04:10.783211Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse
dc.title.none.fl_str_mv Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets
title Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets
spellingShingle Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets
Kostyukova, O. I.
Semi-infinite programming (SIP)
Convex programming (CP)
Immobile index
Immobility order
Cone of feasible directions
Extremal ray
title_short Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets
title_full Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets
title_fullStr Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets
title_full_unstemmed Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets
title_sort Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets
author Kostyukova, O. I.
author_facet Kostyukova, O. I.
Tchemisova, T. V.
author_role author
author2 Tchemisova, T. V.
author2_role author
dc.contributor.author.fl_str_mv Kostyukova, O. I.
Tchemisova, T. V.
dc.subject.por.fl_str_mv Semi-infinite programming (SIP)
Convex programming (CP)
Immobile index
Immobility order
Cone of feasible directions
Extremal ray
topic Semi-infinite programming (SIP)
Convex programming (CP)
Immobile index
Immobility order
Cone of feasible directions
Extremal ray
description The concepts of immobile indices and their immobility orders are objective and important characteristics of feasible sets of semi-infinite programming (SIP) problems. They can be used for the formulation of new efficient optimality conditions without constraint qualifications. Given a class of convex SIP problems with polyhedral index sets, we describe and justify a finite constructive algorithm (algorithm DIIPS) that allows to find in a finite number of steps all immobile indices and the corresponding immobility orders along the feasible directions. This algorithm is based on a representation of the cones of feasible directions in the polyhedral index sets in the form of linear combinations of extremal rays and on the approach proposed in our previous papers for the cases of immobile indices’ sets of simpler structures. A constructive procedure of determination of the extremal rays is described, and an example illustrating the application of the DIIPS algorithm is provided.
publishDate 2019
dc.date.none.fl_str_mv 2019-02-06T14:51:09Z
2020-01-01T00:00:00Z
2020
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10773/25231
url http://hdl.handle.net/10773/25231
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 0315-5986
10.1080/03155986.2018.1553754
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Taylor & Francis
publisher.none.fl_str_mv Taylor & Francis
dc.source.none.fl_str_mv reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron:RCAAP
instname_str FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron_str RCAAP
institution RCAAP
reponame_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
collection Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository.name.fl_str_mv Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
repository.mail.fl_str_mv info@rcaap.pt
_version_ 1833594261502689280

Registros relacionados