{"id":"https://openalex.org/W2152242686","doi":"https://doi.org/10.1287/mnsc.48.5.665.7801","title":"Bounding Option Prices by Semidefinite Programming: A Cutting Plane Algorithm","display_name":"Bounding Option Prices by Semidefinite Programming: A Cutting Plane Algorithm","publication_year":2002,"publication_date":"2002-05-01","ids":{"openalex":"https://openalex.org/W2152242686","doi":"https://doi.org/10.1287/mnsc.48.5.665.7801","mag":"2152242686"},"language":"en","primary_location":{"id":"doi:10.1287/mnsc.48.5.665.7801","is_oa":false,"landing_page_url":"https://doi.org/10.1287/mnsc.48.5.665.7801","pdf_url":null,"source":{"id":"https://openalex.org/S33323087","display_name":"Management Science","issn_l":"0025-1909","issn":["0025-1909","1526-5501"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Management Science","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/A5054720711","display_name":"Jun\u2010ya Gotoh","orcid":"https://orcid.org/0000-0002-0097-7298"},"institutions":[{"id":"https://openalex.org/I146399215","display_name":"University of Tsukuba","ror":"https://ror.org/02956yf07","country_code":"JP","type":"education","lineage":["https://openalex.org/I146399215"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Jun-ya Gotoh","raw_affiliation_strings":["Institute of Policy and Planning Sciences, University of Tsukuba, 1-1-1 Tennoudai, Tsukuba, Ibaraki 305-8573, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Policy and Planning Sciences, University of Tsukuba, 1-1-1 Tennoudai, Tsukuba, Ibaraki 305-8573, Japan","institution_ids":["https://openalex.org/I146399215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001687718","display_name":"Hiroshi Konno","orcid":"https://orcid.org/0000-0003-4784-1483"},"institutions":[{"id":"https://openalex.org/I96679780","display_name":"Chuo University","ror":"https://ror.org/03qvqb743","country_code":"JP","type":"education","lineage":["https://openalex.org/I96679780"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hiroshi Konno","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Chuo University, 1-13-27 Kasuga, Bunkyo-ku, Tokyo 112-8551, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Chuo University, 1-13-27 Kasuga, Bunkyo-ku, Tokyo 112-8551, Japan","institution_ids":["https://openalex.org/I96679780"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3569,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.90926883,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"48","issue":"5","first_page":"665","last_page":"678"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10067","display_name":"Stochastic processes and financial applications","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2003","display_name":"Finance"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10067","display_name":"Stochastic processes and financial applications","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2003","display_name":"Finance"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10007","display_name":"Monetary Policy and Economic Impact","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/2000","display_name":"General Economics, Econometrics and Finance"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9904000163078308,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.8907533884048462},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.8478236198425293},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.8472757339477539},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.7502356767654419},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5712831616401672},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4908645749092102},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48496031761169434},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46580061316490173},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.4565654695034027},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4139673113822937},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3966621160507202},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38886189460754395},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.2636549472808838},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.17630040645599365},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.11093753576278687},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08075055480003357},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05830231308937073}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.8907533884048462},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.8478236198425293},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.8472757339477539},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.7502356767654419},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5712831616401672},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4908645749092102},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48496031761169434},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46580061316490173},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.4565654695034027},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4139673113822937},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3966621160507202},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38886189460754395},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2636549472808838},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.17630040645599365},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.11093753576278687},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08075055480003357},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05830231308937073},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1287/mnsc.48.5.665.7801","is_oa":false,"landing_page_url":"https://doi.org/10.1287/mnsc.48.5.665.7801","pdf_url":null,"source":{"id":"https://openalex.org/S33323087","display_name":"Management Science","issn_l":"0025-1909","issn":["0025-1909","1526-5501"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Management Science","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:inm:ormnsc:v:48:y:2002:i:5:p:665-678","is_oa":false,"landing_page_url":"http://doi.org/10.1287/mnsc.48.5.665.7801","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"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/W572922989","https://openalex.org/W1517228427","https://openalex.org/W1571438983","https://openalex.org/W1577789187","https://openalex.org/W1983698611","https://openalex.org/W1990664633","https://openalex.org/W1993250248","https://openalex.org/W2031668712","https://openalex.org/W2061293389","https://openalex.org/W2076786489","https://openalex.org/W2077791698","https://openalex.org/W2085737469","https://openalex.org/W2120804502","https://openalex.org/W2128978199","https://openalex.org/W2143333945","https://openalex.org/W2146612430","https://openalex.org/W2151065060","https://openalex.org/W2152947540","https://openalex.org/W2234551864","https://openalex.org/W2495457432","https://openalex.org/W2558813012","https://openalex.org/W4300175769"],"related_works":["https://openalex.org/W2362705850","https://openalex.org/W2353517195","https://openalex.org/W2366269287","https://openalex.org/W1553621070","https://openalex.org/W2152242686","https://openalex.org/W2369551725","https://openalex.org/W2078979423","https://openalex.org/W207322605","https://openalex.org/W3000089047","https://openalex.org/W2920857515"],"abstract_inverted_index":{"In":[0],"a":[1,9,14,59,83],"recent":[2],"article,":[3],"Bertsimas":[4],"and":[5,51],"Popescu":[6],"showed":[7],"that":[8,58,74],"tight":[10,60],"upper":[11],"bound":[12,62],"on":[13],"Europeantype":[15],"call":[16],"option":[17],"price,":[18,31],"given":[19],"the":[20,25,28],"first":[21],"n":[22,90],"moments":[23],"of":[24,27,45],"distribution":[26],"underlying":[29],"security":[30],"can":[32,63,77],"be":[33,64,78],"obtained":[34],"by":[35,66,82],"solving":[36,67],"an":[37],"associated":[38],"semidefinite":[39],"programming":[40],"problem":[41],"(SDP).":[42],"The":[43],"purpose":[44],"this":[46],"paper":[47],"is":[48,91],"to":[49],"improve":[50],"extend":[52],"their":[53],"results.":[54],"We":[55],"will":[56,72],"show":[57,73],"lower":[61],"calculated":[65],"another":[68],"SDP.":[69],"Also,":[70],"we":[71],"these":[75],"problems":[76],"solved":[79],"very":[80],"quickly":[81],"newly":[84],"developed":[85],"cutting":[86],"plane":[87],"algorithm":[88],"when":[89],"less":[92],"than":[93],"six":[94],"or":[95],"seven.":[96]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}
