{"id":"https://openalex.org/W2050464653","doi":"https://doi.org/10.1137/08074009x","title":"A Cutting-Surface Method for Uncertain Linear Programs with Polyhedral Stochastic Dominance Constraints","display_name":"A Cutting-Surface Method for Uncertain Linear Programs with Polyhedral Stochastic Dominance Constraints","publication_year":2009,"publication_date":"2009-10-01","ids":{"openalex":"https://openalex.org/W2050464653","doi":"https://doi.org/10.1137/08074009x","mag":"2050464653"},"language":"en","primary_location":{"id":"doi:10.1137/08074009x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/08074009x","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016276353","display_name":"Tito Homem\u2010de\u2010Mello","orcid":"https://orcid.org/0000-0002-2044-3306"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tito Homem-de-Mello","raw_affiliation_strings":["tito@northwestern.edu and mehrotra@iems.northwestern.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"tito@northwestern.edu and mehrotra@iems.northwestern.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036216845","display_name":"Sanjay Mehrotra","orcid":"https://orcid.org/0000-0003-1106-1901"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sanjay Mehrotra","raw_affiliation_strings":["thmello@uic.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"thmello@uic.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016276353"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0829,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.87519525,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"20","issue":"3","first_page":"1250","last_page":"1273"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9853000044822693,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7889691591262817},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.7313629388809204},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6803783774375916},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6427198648452759},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.5450312495231628},{"id":"https://openalex.org/keywords/stochastic-dominance","display_name":"Stochastic dominance","score":0.5190744996070862},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.4895549714565277},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4763129949569702},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.46818387508392334},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4331856369972229},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4205312728881836},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19684308767318726}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7889691591262817},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.7313629388809204},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6803783774375916},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6427198648452759},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5450312495231628},{"id":"https://openalex.org/C33252445","wikidata":"https://www.wikidata.org/wiki/Q3713315","display_name":"Stochastic dominance","level":2,"score":0.5190744996070862},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.4895549714565277},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4763129949569702},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.46818387508392334},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4331856369972229},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4205312728881836},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19684308767318726},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/08074009x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/08074009x","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.416.4715","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.4715","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.optimization-online.org/DB_FILE/2008/11/2137.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.584.2385","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.584.2385","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://users.iems.northwestern.edu/~tito/pubs/SDLP_rev1_submitted_text.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W117353047","https://openalex.org/W1498979476","https://openalex.org/W1508957056","https://openalex.org/W1518078339","https://openalex.org/W1526512085","https://openalex.org/W1553702074","https://openalex.org/W1574055584","https://openalex.org/W1966629740","https://openalex.org/W1966823320","https://openalex.org/W1970193303","https://openalex.org/W1978894191","https://openalex.org/W1990494141","https://openalex.org/W2008129782","https://openalex.org/W2053427412","https://openalex.org/W2076535438","https://openalex.org/W2091847830","https://openalex.org/W2121468937","https://openalex.org/W2133281559","https://openalex.org/W2134540600","https://openalex.org/W2164206203","https://openalex.org/W2301746362","https://openalex.org/W3027820740"],"related_works":["https://openalex.org/W2916043681","https://openalex.org/W2896131632","https://openalex.org/W2391438543","https://openalex.org/W2166189858","https://openalex.org/W2260220185","https://openalex.org/W2313224943","https://openalex.org/W2065491738","https://openalex.org/W2083996107","https://openalex.org/W2036105324","https://openalex.org/W2065436195"],"abstract_inverted_index":{"In":[0],"this":[1,27,59,101],"paper":[2],"we":[3,30],"study":[4],"linear":[5,16,78],"optimization":[6,51],"problems":[7],"with":[8],"a":[9,32,45,63],"newly":[10],"introduced":[11],"concept":[12],"of":[13,26,47,58,122,126,136,138],"multidimensional":[14],"polyhedral":[15,24,56,124],"second-order":[17],"stochastic":[18],"dominance":[19,28],"constraints.":[20],"By":[21],"using":[22],"the":[23,55,91,104,111,123,127,134,148],"properties":[25],"condition,":[29],"present":[31,62,97],"cutting-surface":[33],"algorithm":[34,66],"and":[35,73],"show":[36],"its":[37],"finite":[38],"convergence.":[39],"The":[40],"cut":[41],"generation":[42],"problem":[43,60,80,102],"is":[44,81,119],"difference":[46],"convex":[48],"functions":[49],"(DC)":[50],"problem.":[52,128],"We":[53,95],"exploit":[54],"structure":[57],"to":[61,107,113,147],"novel":[64],"branch-and-cut":[65],"that":[67],"incorporates":[68],"concepts":[69],"from":[70],"concave":[71],"minimization":[72],"binary":[74],"integer":[75],"programming.":[76],"A":[77],"programming":[79],"formulated":[82],"for":[83,100],"generating":[84],"concavity":[85],"cuts":[86],"in":[87],"our":[88,139],"case,":[89],"where":[90],"polyhedra":[92],"are":[93,131],"unbounded.":[94],"also":[96],"duality":[98],"results":[99],"relating":[103],"dual":[105],"multipliers":[106],"utility":[108],"functions,":[109],"without":[110],"need":[112],"impose":[114],"constraint":[115],"qualifications,":[116],"which":[117],"again":[118],"possible":[120],"because":[121],"nature":[125,135],"Numerical":[129],"examples":[130],"presented":[132],"showing":[133],"solutions":[137],"model.":[140],"(A":[141],"corrected":[142],"PDF":[143],"has":[144],"been":[145],"appended":[146],"original.)":[149]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}