On the closure of the feasible set in generalized semi-infinite programming
In generalized semi-infinite programming the feasible set is known to be not closed in general. In this paper, under natural and generic assumptions, the closure of the feasible set is described in explicit terms. Keywords Semi-infinite programming * Feasible set * Projection * Genericity
Gespeichert in:
| Veröffentlicht in: | Central European journal of operations research 2007-09, Vol.15 (3), p.271-280 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 280 |
|---|---|
| container_issue | 3 |
| container_start_page | 271 |
| container_title | Central European journal of operations research |
| container_volume | 15 |
| creator | Günzel, Harald Jongen, Hubertus Th Stein, Oliver |
| description | In generalized semi-infinite programming the feasible set is known to be not closed in general. In this paper, under natural and generic assumptions, the closure of the feasible set is described in explicit terms. Keywords Semi-infinite programming * Feasible set * Projection * Genericity |
| doi_str_mv | 10.1007/s10100-007-0030-2 |
| format | Article |
| fullrecord | <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_journals_195540507</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A713751491</galeid><sourcerecordid>A713751491</sourcerecordid><originalsourceid>FETCH-LOGICAL-c373t-b9ef12c1c2f8ef510bf2162384e9133f66fe5b0ea69c27033abf56b51d7d7e2b3</originalsourceid><addsrcrecordid>eNotUE1PwzAMjRBIjMEP4FZxz4iTJlmP08SXmLQLSNyiNHVKpq4dSXeAX09GkWX52bL9nh4ht8AWwJi-T8BypRnmFIzyMzIDBYJWoJfnGZdCUl6qj0tyldKOMQ4VUzPyuu2L8RML1w3pGLEY_F_r0aZQd1gkHIvQFy32GG0XfrDJo32gofehDyMWhzi00e73oW-vyYW3XcKb_zon748Pb-tnutk-vaxXG-qEFiOtK_TAHTjul-glsNpzUFwsS6xACK-UR1kztKpyXDMhbO2lqiU0utHIazEnd9PfzP11xDSa3XCMfaY0UElZMsl0XlpMS63t0GS5wxity9Fk-W7o0Yc8X2kQWkKZiecEpgMXh5QienOIYW_jtwFmTh6byWNzgiePDRe_lVxujA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195540507</pqid></control><display><type>article</type><title>On the closure of the feasible set in generalized semi-infinite programming</title><source>SpringerLink Journals</source><source>EBSCOhost Business Source Complete</source><creator>Günzel, Harald ; Jongen, Hubertus Th ; Stein, Oliver</creator><creatorcontrib>Günzel, Harald ; Jongen, Hubertus Th ; Stein, Oliver</creatorcontrib><description>In generalized semi-infinite programming the feasible set is known to be not closed in general. In this paper, under natural and generic assumptions, the closure of the feasible set is described in explicit terms. Keywords Semi-infinite programming * Feasible set * Projection * Genericity</description><identifier>ISSN: 1435-246X</identifier><identifier>EISSN: 1613-9178</identifier><identifier>DOI: 10.1007/s10100-007-0030-2</identifier><language>eng</language><publisher>Heidelberg: Springer</publisher><subject>Feasibility ; Fuzzy sets ; Management research ; Mathematical optimization ; Operations research ; Optimization ; Set theory ; Studies</subject><ispartof>Central European journal of operations research, 2007-09, Vol.15 (3), p.271-280</ispartof><rights>COPYRIGHT 2007 Springer</rights><rights>Springer-Verlag 2007</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c373t-b9ef12c1c2f8ef510bf2162384e9133f66fe5b0ea69c27033abf56b51d7d7e2b3</citedby><cites>FETCH-LOGICAL-c373t-b9ef12c1c2f8ef510bf2162384e9133f66fe5b0ea69c27033abf56b51d7d7e2b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Günzel, Harald</creatorcontrib><creatorcontrib>Jongen, Hubertus Th</creatorcontrib><creatorcontrib>Stein, Oliver</creatorcontrib><title>On the closure of the feasible set in generalized semi-infinite programming</title><title>Central European journal of operations research</title><description>In generalized semi-infinite programming the feasible set is known to be not closed in general. In this paper, under natural and generic assumptions, the closure of the feasible set is described in explicit terms. Keywords Semi-infinite programming * Feasible set * Projection * Genericity</description><subject>Feasibility</subject><subject>Fuzzy sets</subject><subject>Management research</subject><subject>Mathematical optimization</subject><subject>Operations research</subject><subject>Optimization</subject><subject>Set theory</subject><subject>Studies</subject><issn>1435-246X</issn><issn>1613-9178</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNotUE1PwzAMjRBIjMEP4FZxz4iTJlmP08SXmLQLSNyiNHVKpq4dSXeAX09GkWX52bL9nh4ht8AWwJi-T8BypRnmFIzyMzIDBYJWoJfnGZdCUl6qj0tyldKOMQ4VUzPyuu2L8RML1w3pGLEY_F_r0aZQd1gkHIvQFy32GG0XfrDJo32gofehDyMWhzi00e73oW-vyYW3XcKb_zon748Pb-tnutk-vaxXG-qEFiOtK_TAHTjul-glsNpzUFwsS6xACK-UR1kztKpyXDMhbO2lqiU0utHIazEnd9PfzP11xDSa3XCMfaY0UElZMsl0XlpMS63t0GS5wxity9Fk-W7o0Yc8X2kQWkKZiecEpgMXh5QienOIYW_jtwFmTh6byWNzgiePDRe_lVxujA</recordid><startdate>20070901</startdate><enddate>20070901</enddate><creator>Günzel, Harald</creator><creator>Jongen, Hubertus Th</creator><creator>Stein, Oliver</creator><general>Springer</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>3V.</scope><scope>7SC</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>H8D</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KR7</scope><scope>L.-</scope><scope>L.0</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope></search><sort><creationdate>20070901</creationdate><title>On the closure of the feasible set in generalized semi-infinite programming</title><author>Günzel, Harald ; Jongen, Hubertus Th ; Stein, Oliver</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c373t-b9ef12c1c2f8ef510bf2162384e9133f66fe5b0ea69c27033abf56b51d7d7e2b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Feasibility</topic><topic>Fuzzy sets</topic><topic>Management research</topic><topic>Mathematical optimization</topic><topic>Operations research</topic><topic>Optimization</topic><topic>Set theory</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Günzel, Harald</creatorcontrib><creatorcontrib>Jongen, Hubertus Th</creatorcontrib><creatorcontrib>Stein, Oliver</creatorcontrib><collection>CrossRef</collection><collection>Global News & ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Aerospace Database</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>Central European journal of operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Günzel, Harald</au><au>Jongen, Hubertus Th</au><au>Stein, Oliver</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the closure of the feasible set in generalized semi-infinite programming</atitle><jtitle>Central European journal of operations research</jtitle><date>2007-09-01</date><risdate>2007</risdate><volume>15</volume><issue>3</issue><spage>271</spage><epage>280</epage><pages>271-280</pages><issn>1435-246X</issn><eissn>1613-9178</eissn><abstract>In generalized semi-infinite programming the feasible set is known to be not closed in general. In this paper, under natural and generic assumptions, the closure of the feasible set is described in explicit terms. Keywords Semi-infinite programming * Feasible set * Projection * Genericity</abstract><cop>Heidelberg</cop><pub>Springer</pub><doi>10.1007/s10100-007-0030-2</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1435-246X |
| ispartof | Central European journal of operations research, 2007-09, Vol.15 (3), p.271-280 |
| issn | 1435-246X 1613-9178 |
| language | eng |
| recordid | cdi_proquest_journals_195540507 |
| source | SpringerLink Journals; EBSCOhost Business Source Complete |
| subjects | Feasibility Fuzzy sets Management research Mathematical optimization Operations research Optimization Set theory Studies |
| title | On the closure of the feasible set in generalized semi-infinite programming |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T10%3A22%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20closure%20of%20the%20feasible%20set%20in%20generalized%20semi-infinite%20programming&rft.jtitle=Central%20European%20journal%20of%20operations%20research&rft.au=G%C3%BCnzel,%20Harald&rft.date=2007-09-01&rft.volume=15&rft.issue=3&rft.spage=271&rft.epage=280&rft.pages=271-280&rft.issn=1435-246X&rft.eissn=1613-9178&rft_id=info:doi/10.1007/s10100-007-0030-2&rft_dat=%3Cgale_proqu%3EA713751491%3C/gale_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=195540507&rft_id=info:pmid/&rft_galeid=A713751491&rfr_iscdi=true |