{"id":"https://openalex.org/W2092720955","doi":"https://doi.org/10.1137/120867925","title":"Finite Linear Programming Approximations of Constrained Discounted Markov Decision Processes","display_name":"Finite Linear Programming Approximations of Constrained Discounted Markov Decision Processes","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2092720955","doi":"https://doi.org/10.1137/120867925","mag":"2092720955"},"language":"en","primary_location":{"id":"doi:10.1137/120867925","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120867925","pdf_url":null,"source":{"id":"https://openalex.org/S897311980","display_name":"SIAM Journal on Control and Optimization","issn_l":"0363-0129","issn":["0363-0129","1095-7138"],"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 Control and 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/A5052608804","display_name":"Fran\u00e7ois Dufour","orcid":"https://orcid.org/0000-0001-6653-2024"},"institutions":[{"id":"https://openalex.org/I4210166017","display_name":"Institut de Math\u00e9matiques de Bordeaux","ror":"https://ror.org/05m3r1b84","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I15057530","https://openalex.org/I4210141950","https://openalex.org/I4210160189","https://openalex.org/I4210166017"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Fran\u00e7ois Dufour","raw_affiliation_strings":["Institut de Math\u00e9matiques de Bordeaux","Quality control and dynamic reliability"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut de Math\u00e9matiques de Bordeaux","institution_ids":["https://openalex.org/I4210166017"]},{"raw_affiliation_string":"Quality control and dynamic reliability","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002012512","display_name":"Tom\u00e1s Prieto-Rumeau","orcid":"https://orcid.org/0000-0003-4677-4725"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tom\u00e1s Prieto-Rumeau","raw_affiliation_strings":["Department of Statistics and Operations Research [Madrid]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Statistics and Operations Research [Madrid]","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.7669,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.96887528,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"51","issue":"2","first_page":"1298","last_page":"1324"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11195","display_name":"Simulation Techniques and Applications","score":0.9724000096321106,"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/mathematics","display_name":"Mathematics","score":0.7909300327301025},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.7576532363891602},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7031968832015991},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.6967334747314453},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5026223659515381},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.49704650044441223},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.4582367241382599},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.44317230582237244},{"id":"https://openalex.org/keywords/approximations-of-\u03c0","display_name":"Approximations of \u03c0","score":0.43316805362701416},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.43104034662246704},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4249430298805237},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.41454121470451355},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4094493091106415}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7909300327301025},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.7576532363891602},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7031968832015991},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.6967334747314453},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5026223659515381},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.49704650044441223},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.4582367241382599},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.44317230582237244},{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.43316805362701416},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.43104034662246704},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4249430298805237},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.41454121470451355},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4094493091106415},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/120867925","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120867925","pdf_url":null,"source":{"id":"https://openalex.org/S897311980","display_name":"SIAM Journal on Control and Optimization","issn_l":"0363-0129","issn":["0363-0129","1095-7138"],"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 Control and Optimization","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-00925862v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00925862","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Control and Optimization, 2013, 51 (2), pp.1298-1324. ⟨10.1137/120867925⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/114910","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/114910","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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 de revue"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/189492","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/189492","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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 de revue"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.6600000262260437}],"awards":[{"id":"https://openalex.org/G5427846863","display_name":"Contr\u00f4le tol\u00e9rant aux pannes pour les syst\u00e8mes embarqu\u00e9s","funder_award_id":"ANR-09-SEGI-0004","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1980480099","https://openalex.org/W1985929135","https://openalex.org/W2017419329","https://openalex.org/W2032895718","https://openalex.org/W2042436556","https://openalex.org/W2049032169","https://openalex.org/W2064778949","https://openalex.org/W2073471284","https://openalex.org/W2081374871","https://openalex.org/W2115558605","https://openalex.org/W2145885891","https://openalex.org/W2149148771","https://openalex.org/W2157829425","https://openalex.org/W2158800767","https://openalex.org/W3101717792","https://openalex.org/W4254197176"],"related_works":["https://openalex.org/W2152670157","https://openalex.org/W4308702637","https://openalex.org/W2386410636","https://openalex.org/W176737593","https://openalex.org/W2808418668","https://openalex.org/W2903299703","https://openalex.org/W2016648086","https://openalex.org/W2156021013","https://openalex.org/W2042946219","https://openalex.org/W4297823484"],"abstract_inverted_index":{"We":[0,17],"consider":[1],"a":[2,54,68,114],"Markov":[3],"decision":[4],"process":[5],"(MDP)":[6],"with":[7],"constraints":[8],"under":[9],"the":[10,25,37,43,72,76,79,85,88,99,106,110,129],"total":[11],"expected":[12],"discounted":[13],"cost":[14,91],"optimality":[15],"criterion.":[16],"are":[18,92],"interested":[19],"in":[20],"proposing":[21],"approximation":[22,57],"methods":[23],"of":[24,28,42,50,58,75,78,84,87,98,101,109,128],"optimal":[26,89,131],"value":[27],"this":[29,33,59],"constrained":[30,44,90,111,132],"MDP.":[31],"To":[32],"end,":[34],"starting":[35],"from":[36],"linear":[38],"programming":[39],"(LP)":[40],"formulation":[41,108],"MDP":[45,112],"(on":[46],"an":[47],"infinite-dimensional":[48],"space":[49],"measures),":[51],"we":[52,104],"propose":[53],"finite":[55],"state":[56],"LP":[60,107],"problem.":[61],"This":[62],"is":[63],"achieved":[64],"by":[65],"suitably":[66],"approximating":[67],"probability":[69],"measure":[70],"underlying":[71],"random":[73],"transitions":[74],"dynamics":[77],"system.":[80],"Explicit":[81],"convergence":[82],"orders":[83],"approximations":[86,127],"obtained.":[93],"By":[94],"exploiting":[95],"convexity":[96],"properties":[97],"class":[100],"relaxed":[102],"controls,":[103],"reduce":[105],"to":[113,123],"finite-dimensional":[115],"static":[116],"optimization":[117],"problem":[118],"that":[119],"can":[120],"be":[121],"used":[122],"obtain":[124],"explicit":[125],"numerical":[126,135],"corresponding":[130],"cost.":[133],"A":[134],"application":[136],"illustrates":[137],"our":[138],"theoretical":[139],"results.":[140]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}