{"id":"https://openalex.org/W2012862353","doi":"https://doi.org/10.1057/jors.1987.42","title":"A Linear Approximation for Chance-Constrained Programming","display_name":"A Linear Approximation for Chance-Constrained Programming","publication_year":1987,"publication_date":"1987-03-01","ids":{"openalex":"https://openalex.org/W2012862353","doi":"https://doi.org/10.1057/jors.1987.42","mag":"2012862353"},"language":"en","primary_location":{"id":"doi:10.1057/jors.1987.42","doi":"https://doi.org/10.1057/jors.1987.42","is_oa":false,"landing_page_url":"https://doi.org/10.1057/jors.1987.42","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a","anvur-class-a","anvur-scientific","cwts-core","erih-plus","fnege-2","jufo-2","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},"volume":null,"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/A5044129236","display_name":"David L. Olson","orcid":"https://orcid.org/0000-0002-2835-1377","observed_orcids":["https://orcid.org/0000-0002-2835-1377"]},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David L. Olson","raw_affiliation_strings":["Department of Business AnalysisTexas A & M University USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Business AnalysisTexas A & M University USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087880992","display_name":"Scott R. Swenseth","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Scott R. Swenseth","raw_affiliation_strings":["Department of Business AnalysisTexas A & M University USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Business AnalysisTexas A & M University USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":2.4167,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.87737795,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"38","issue":"3","first_page":"261","last_page":"261"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9624000191688538,"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.9624000191688538,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.030500000342726707,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.0010000000474974513,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/chance-constrained-programming","display_name":"chance-constrained programming","score":0.8989999890327454},{"id":"https://openalex.org/keywords/linearization","display_name":"linearization","score":0.9369999766349792},{"id":"https://openalex.org/keywords/chance-constraints","display_name":"chance constraints","score":0.6309999823570251},{"id":"https://openalex.org/keywords/uncertainty","display_name":"uncertainty","score":0.5389999747276306},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"multi-objective optimization","score":0.722000002861023},{"id":"https://openalex.org/keywords/nonlinear-constraints","display_name":"nonlinear constraints","score":0.5379999876022339},{"id":"https://openalex.org/keywords/approximation-bounds","display_name":"approximation bounds","score":0.5230000019073486},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.47200000286102295}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7237749099731445},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7081025838851929},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5724964141845703},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5393019318580627},{"id":"https://openalex.org/C160824197","wikidata":"https://www.wikidata.org/wiki/Q2071054","display_name":"Linear approximation","level":3,"score":0.46460527181625366},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4518366754055023},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4396125078201294},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36157146096229553},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.31327903270721436},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.13470950722694397},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10079368948936462},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1057/jors.1987.42","doi":"https://doi.org/10.1057/jors.1987.42","is_oa":false,"landing_page_url":"https://doi.org/10.1057/jors.1987.42","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a","anvur-class-a","anvur-scientific","cwts-core","erih-plus","fnege-2","jufo-2","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"doi:10.2307/2581946","doi":"https://doi.org/10.2307/2581946","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2581946","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a","anvur-class-a","anvur-scientific","cwts-core","erih-plus","fnege-2","jufo-2","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Journal of the Operational Research Society","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1483431698","https://openalex.org/W1984315812","https://openalex.org/W2014357709","https://openalex.org/W2016399173","https://openalex.org/W2024521367","https://openalex.org/W2026778780","https://openalex.org/W2035125150","https://openalex.org/W2049606892","https://openalex.org/W2066194037","https://openalex.org/W2069098004","https://openalex.org/W2074003308","https://openalex.org/W2078623491","https://openalex.org/W2087581775","https://openalex.org/W2104604109","https://openalex.org/W2324357856"],"related_works":["https://openalex.org/W4253968188","https://openalex.org/W6983172852","https://openalex.org/W6944877060","https://openalex.org/W1543928764","https://openalex.org/W2130030719","https://openalex.org/W4389571851","https://openalex.org/W2062843008","https://openalex.org/W2000034396","https://openalex.org/W2954506418","https://openalex.org/W806042187"],"abstract_inverted_index":{"Decision":[0],"environments":[1],"involve":[2],"the":[3,23,44,48,83,96,104,110,114],"need":[4],"to":[5,43,58],"solve":[6],"problems":[7,63],"with":[8,64],"varying":[9],"degrees":[10],"of":[11,47,62,116],"uncertainty":[12,24],"as":[13,15,101,103],"well":[14],"multiple,":[16],"potentially":[17],"conflicting":[18],"objectives.":[19,120],"Chance":[20],"constraints":[21,29,76,118],"consider":[22],"encountered.":[25],"Codes":[26],"incorporating":[27],"chance":[28,49,75,97,111],"into":[30],"a":[31,39,93],"mathematical":[32],"programming":[33],"model":[34],"are":[35],"not":[36],"available":[37],"on":[38,95],"widespread":[40],"basis":[41],"owing":[42],"non-linear":[45,106],"form":[46],"constraints.":[50],"Therefore,":[51],"accurate":[52],"linear":[53,66],"approximations":[54],"would":[55],"be":[56,79],"useful":[57],"analyse":[59],"this":[60],"class":[61],"efficient":[65],"codes.":[67],"This":[68],"paper":[69],"presents":[70],"an":[71],"approximation":[72,89],"formula":[73],"for":[74],"which":[77],"can":[78],"used":[80],"in":[81],"either":[82],"single-":[84],"or":[85,119],"multiple-objective":[86],"case.":[87],"The":[88],"presented":[90],"will":[91],"place":[92],"bound":[94],"constraint":[98,112],"at":[99,113],"least":[100],"tight":[102],"true":[105],"form,":[107],"thus":[108],"overachieving":[109],"expense":[115],"other":[117]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2016-06-24T00:00:00"}