The Linear Programming Approach to Approximate Dynamic Programming

The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of large-scale stochastic control problems. We study an efficient method based on linear programming for approximating solutions to such problems. The approach "fits"...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Operations research Ročník 51; číslo 6; s. 850 - 865
Hlavní autoři: de Farias, D. P, Van Roy, B
Médium: Journal Article
Jazyk:angličtina
Vydáno: Linthicum INFORMS 01.11.2003
Institute for Operations Research and the Management Sciences
Témata:
ISSN:0030-364X, 1526-5463
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of large-scale stochastic control problems. We study an efficient method based on linear programming for approximating solutions to such problems. The approach "fits" a linear combination of pre-selected basis functions to the dynamic programming cost-to-go function. We develop error bounds that offer performance guarantees and also guide the selection of both basis functions and "state-relevance weights" that influence quality of the approximation. Experimental results in the domain of queueing network control provide empirical support for the methodology.
AbstractList The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of large-scale stochastic control problems. We study an efficient method based on linear programming for approximating solutions to such problems. The approach "fits" a linear combination of pre-selected basis functions to the dynamic programming cost-to-go function. We develop error bounds that offer performance guarantees and also guide the selection of both basis functions and "state-relevance weights" that influence quality of the approximation. Experimental results in the domain of queueing network control provide empirical support for the methodology.
The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of large-scale stochastic control problems. We study an efficient method based on linear programming for approximating solutions to such problems. The approach fits a linear combination of pre-selected basis functions to the dynamic programming cost-to-go function. We develop error bounds that offer performance guarantees and also guide the selection of both basis functions and state-relevance weights that influence quality of the approximation. Experimental results in the domain of queueing network control provide empirical support for the methodology. [PUBLICATION ABSTRACT]
Audience Trade
Author Van Roy, B
de Farias, D. P
Author_xml – sequence: 1
  fullname: de Farias, D. P
– sequence: 2
  fullname: Van Roy, B
BookMark eNqNkctKxDAUhoMoOF6eQBfFhbvWpLm0WY53YUAXCu5CJk06GabJmFTUtze1IiKCchYJOf-Xc_l3wKbzTgNwgGCByro68eugC4oKVtQUFiXhJd0AE0RLllPC8CaYQIhhjhl53AY7MS4hhJwyOgGn9wudzazTMmR3wbdBdp11bTZdr4OXapH1fry_2k72Ojt_c7Kz6rt2D2wZuYp6__PcBQ-XF_dn1_ns9urmbDrLFSGsz5sGwpoTXqfQuJEVqpSaG9zAmnHJZFUS1LBGGTOvDVEV5XNcGwmNNlBDOce74Gj8N3Xz9KxjL5b-ObhUUpSII1whCpMoH0WtXGlhnfF9kKrVTge5SkszNj1PEUI1T0tiSV_8ok_R6DTmrwAeARV8jEEbsQ5pNeFNICgGM8RghqBIMJHMEB9mJIr_oJTtZW-9S-Xs6g_2cGSXsffhqxxBuCSkSulyTA_Nhy7-s5_jEVrYdvFiwzj6QA_q-CXH7_2FueY
CODEN OPREAI
CitedBy_id crossref_primary_10_1137_13094774X
crossref_primary_10_1007_s12532_020_00189_0
crossref_primary_10_1007_s10472_006_9038_x
crossref_primary_10_1016_j_orl_2012_08_006
crossref_primary_10_1007_s10626_010_0093_4
crossref_primary_10_1287_ijoc_2015_0645
crossref_primary_10_1049_iet_gtd_20070174
crossref_primary_10_1287_opre_1110_0929
crossref_primary_10_1287_opre_1070_0408
crossref_primary_10_1287_opre_2015_1442
crossref_primary_10_3233_JIFS_211577
crossref_primary_10_1016_j_automatica_2021_109748
crossref_primary_10_1016_j_compchemeng_2006_05_043
crossref_primary_10_1287_mnsc_1120_1643
crossref_primary_10_1287_ijoc_2015_0651
crossref_primary_10_1080_07408170590918083
crossref_primary_10_1007_s00186_013_0432_y
crossref_primary_10_1287_opre_1090_0705
crossref_primary_10_1016_j_automatica_2021_110052
crossref_primary_10_1007_s00186_013_0454_5
crossref_primary_10_1287_moor_2019_1000
crossref_primary_10_1287_moor_2023_0221
crossref_primary_10_1109_TCST_2009_2023512
crossref_primary_10_1287_trsc_2016_0708
crossref_primary_10_1002_rnc_2894
crossref_primary_10_1287_mnsc_2020_00038
crossref_primary_10_1016_j_ifacol_2017_08_1993
crossref_primary_10_1080_24725854_2018_1537532
crossref_primary_10_1287_opre_1040_0114
crossref_primary_10_1287_deca_2017_0352
crossref_primary_10_1016_j_engappai_2021_104515
crossref_primary_10_1049_iet_cta_2019_0289
crossref_primary_10_1016_j_sysconle_2024_106003
crossref_primary_10_1137_120874679
crossref_primary_10_1016_j_ijepes_2012_11_015
crossref_primary_10_1002_nav_22005
crossref_primary_10_1016_j_automatica_2021_110061
crossref_primary_10_1287_ijoc_1070_0240
crossref_primary_10_1137_15M1036233
crossref_primary_10_1016_j_conengprac_2009_09_001
crossref_primary_10_1287_ijoc_1090_0345
crossref_primary_10_1016_j_sysconle_2016_11_010
crossref_primary_10_1287_ijoc_2015_0668
crossref_primary_10_1109_LCSYS_2024_3405958
crossref_primary_10_1016_j_cor_2024_106639
crossref_primary_10_1155_2010_815213
crossref_primary_10_5547_01956574_39_1_jmor
crossref_primary_10_1109_LRA_2023_3315228
crossref_primary_10_1287_ijoc_1100_0433
crossref_primary_10_1109_TAC_2010_2042005
crossref_primary_10_1016_j_ress_2020_107081
crossref_primary_10_1007_s10626_009_0071_x
crossref_primary_10_1287_moor_1060_0208
crossref_primary_10_1016_j_envsoft_2014_11_027
crossref_primary_10_1016_j_ins_2022_11_030
crossref_primary_10_1214_18_STS672
crossref_primary_10_1287_moor_1040_0129
crossref_primary_10_1016_j_orl_2020_06_005
crossref_primary_10_1049_ip_cta_20050094
crossref_primary_10_1111_poms_13075
crossref_primary_10_1109_TAC_2025_3546078
crossref_primary_10_1287_msom_2018_0730
crossref_primary_10_1016_j_cie_2018_04_022
crossref_primary_10_1109_TAC_2019_2906423
crossref_primary_10_1287_ijoc_1090_0350
crossref_primary_10_1287_opre_2022_2354
crossref_primary_10_1109_LCSYS_2022_3180898
crossref_primary_10_1016_j_ijar_2011_09_007
crossref_primary_10_1287_mnsc_2022_03736
crossref_primary_10_1109_TAC_2015_2414811
crossref_primary_10_1287_mnsc_2019_3289
crossref_primary_10_1109_LCSYS_2023_3290489
crossref_primary_10_1109_TAC_2009_2031582
crossref_primary_10_1007_s00500_023_08462_9
crossref_primary_10_1137_060665506
crossref_primary_10_1287_opre_1070_0445
crossref_primary_10_1287_mnsc_2022_01108
crossref_primary_10_1017_S0269964818000402
crossref_primary_10_1007_s10107_021_01685_4
crossref_primary_10_1287_opre_2018_1820
crossref_primary_10_1007_s10107_021_01624_3
crossref_primary_10_1080_24725854_2018_1504357
crossref_primary_10_1109_TAC_2019_2907812
crossref_primary_10_1002_nav_20384
crossref_primary_10_1109_TVT_2024_3355186
crossref_primary_10_1137_18M1208423
crossref_primary_10_1137_19M1305835
crossref_primary_10_1016_j_sysconle_2015_09_002
crossref_primary_10_1080_00207179_2015_1091510
crossref_primary_10_1111_poms_13132
crossref_primary_10_1016_j_orl_2017_09_001
crossref_primary_10_1109_TBDATA_2020_2988273
crossref_primary_10_1016_j_sysconle_2016_05_009
crossref_primary_10_1016_j_ejor_2011_06_033
crossref_primary_10_1287_msom_5_4_348_24884
crossref_primary_10_1002_rnc_3152
crossref_primary_10_1016_j_ifacsc_2020_100106
crossref_primary_10_1007_s10107_017_1219_3
crossref_primary_10_1109_TVT_2008_927714
crossref_primary_10_1111_j_1467_8659_2009_01591_x
crossref_primary_10_1109_TCOMM_2019_2899620
crossref_primary_10_1109_TASE_2014_2366295
crossref_primary_10_1109_LCSYS_2024_3416240
crossref_primary_10_1016_j_orl_2017_05_010
crossref_primary_10_1145_1842713_1842715
crossref_primary_10_1016_j_sorms_2014_09_001
crossref_primary_10_1017_S026996480999012X
crossref_primary_10_1287_trsc_2016_0682
crossref_primary_10_1109_TITS_2021_3112825
crossref_primary_10_1287_msom_2015_0545
crossref_primary_10_1016_j_omega_2025_103361
crossref_primary_10_1287_mnsc_2014_2136
crossref_primary_10_1287_mnsc_2022_4354
crossref_primary_10_1287_mnsc_2022_4476
crossref_primary_10_1002_nav_20164
crossref_primary_10_1002_rnc_1665
crossref_primary_10_1007_s10696_024_09551_z
crossref_primary_10_1287_opre_2014_1301
crossref_primary_10_1287_isre_2018_0819
crossref_primary_10_2139_ssrn_3248075
crossref_primary_10_1016_j_automatica_2014_11_004
crossref_primary_10_1109_TCST_2010_2056371
crossref_primary_10_1287_opre_2020_2024
crossref_primary_10_1017_S1365100515000528
crossref_primary_10_1287_opre_2022_2287
crossref_primary_10_1016_j_dche_2022_100057
crossref_primary_10_1016_j_ejor_2025_08_038
crossref_primary_10_1016_j_tre_2022_102685
crossref_primary_10_1007_s10458_007_9026_5
crossref_primary_10_1287_mnsc_2020_3677
crossref_primary_10_1287_moor_1060_0188
crossref_primary_10_1016_j_jet_2018_08_006
crossref_primary_10_1016_j_sysarc_2023_102871
crossref_primary_10_1111_poms_13458
crossref_primary_10_1109_TAC_2015_2500638
crossref_primary_10_1162_0899766053019926
crossref_primary_10_1287_deca_1050_0042
crossref_primary_10_1287_opre_1120_1044
crossref_primary_10_1016_j_energy_2017_09_131
crossref_primary_10_1016_j_ifacol_2025_01_163
crossref_primary_10_1007_s10479_018_3003_z
crossref_primary_10_1287_msom_1100_0302
crossref_primary_10_1007_s10729_021_09566_0
crossref_primary_10_1109_COMST_2015_2420686
crossref_primary_10_1016_j_ejor_2014_08_003
crossref_primary_10_1002_net_21932
crossref_primary_10_1016_j_arcontrol_2018_09_005
crossref_primary_10_1371_journal_pone_0186014
crossref_primary_10_1109_TAC_2015_2418672
crossref_primary_10_4028_www_scientific_net_AMR_459_575
crossref_primary_10_1016_j_ejor_2024_09_019
crossref_primary_10_1080_03155986_2019_1624491
crossref_primary_10_1109_JSAC_2008_080514
crossref_primary_10_1287_opre_2017_1631
crossref_primary_10_1007_s10107_014_0769_x
crossref_primary_10_1111_j_1756_2171_2012_00165_x
crossref_primary_10_1109_TAC_2017_2743163
crossref_primary_10_4028_www_scientific_net_AMR_459_571
crossref_primary_10_1287_ijoc_2020_0969
crossref_primary_10_1080_02522667_2010_10699960
crossref_primary_10_1016_j_cor_2015_04_014
crossref_primary_10_1287_opre_1060_0368
crossref_primary_10_1287_moor_1040_0094
crossref_primary_10_1007_s10288_014_0279_y
crossref_primary_10_1016_j_arcontrol_2017_11_001
crossref_primary_10_1109_TAC_2018_2790261
crossref_primary_10_1080_14697688_2021_1921242
crossref_primary_10_1287_ijoc_2021_0203
crossref_primary_10_1287_msom_1060_0116
crossref_primary_10_1007_s10107_013_0631_6
crossref_primary_10_1287_opre_1090_0796
crossref_primary_10_1287_opre_2016_1531
crossref_primary_10_1016_j_ifacol_2017_08_1575
crossref_primary_10_1177_10591478251356474
crossref_primary_10_1287_opre_1090_0790
crossref_primary_10_1109_TCST_2022_3179615
crossref_primary_10_1287_trsc_1090_0262
crossref_primary_10_1016_j_neucom_2019_08_045
crossref_primary_10_1016_j_compchemeng_2019_106544
crossref_primary_10_2514_1_60487
crossref_primary_10_1016_j_arcontrol_2023_100917
crossref_primary_10_1016_j_ejor_2008_03_023
crossref_primary_10_1109_TCST_2023_3245824
crossref_primary_10_1177_0954405414537243
crossref_primary_10_1016_j_ejor_2008_07_008
crossref_primary_10_1080_00207179_2022_2027523
crossref_primary_10_1287_trsc_2023_0120
crossref_primary_10_1109_TCCN_2019_2898000
crossref_primary_10_1016_j_automatica_2024_111746
crossref_primary_10_1109_LCSYS_2024_3403470
crossref_primary_10_1109_TSTE_2013_2278406
crossref_primary_10_1287_ijoc_2023_0245
crossref_primary_10_1109_JIOT_2023_3312118
crossref_primary_10_1109_TAC_2008_921013
crossref_primary_10_1109_TAC_2008_925856
crossref_primary_10_1287_ijoc_2020_0987
crossref_primary_10_1287_opre_1040_0166
crossref_primary_10_1007_s10729_018_9437_7
crossref_primary_10_1287_opre_2018_1782
crossref_primary_10_1109_TAC_2013_2270052
crossref_primary_10_1016_j_ejor_2012_06_046
crossref_primary_10_1016_j_ejor_2023_01_006
crossref_primary_10_1016_j_ejor_2020_11_010
crossref_primary_10_1287_ijoc_1050_0155
crossref_primary_10_1287_msom_2022_0318
crossref_primary_10_1109_TAC_2012_2186176
crossref_primary_10_1287_opre_1120_1121
crossref_primary_10_1016_j_ejor_2011_09_007
crossref_primary_10_1287_moor_1120_0574
crossref_primary_10_1109_TASE_2024_3456074
crossref_primary_10_1287_opre_2019_1953
crossref_primary_10_1109_TAC_2019_2907414
crossref_primary_10_3390_math12243922
crossref_primary_10_1137_040614384
crossref_primary_10_1109_TAC_2010_2052697
crossref_primary_10_1016_j_tre_2022_102816
crossref_primary_10_1287_ijoc_1080_0305
crossref_primary_10_1016_j_orhc_2023_100400
crossref_primary_10_1016_j_jprocont_2010_06_007
crossref_primary_10_1109_TSG_2015_2494874
crossref_primary_10_1287_mnsc_1120_1551
crossref_primary_10_1109_TAC_2021_3050440
crossref_primary_10_1111_poms_13404
crossref_primary_10_1287_ijoo_2019_0036
crossref_primary_10_1016_j_ejor_2019_01_050
crossref_primary_10_1016_j_trb_2023_102874
crossref_primary_10_1109_LCSYS_2021_3053180
crossref_primary_10_1287_opre_2020_0464
crossref_primary_10_1007_s10479_013_1391_7
crossref_primary_10_1109_TAC_2017_2731817
crossref_primary_10_1287_opre_1080_0590
crossref_primary_10_1016_j_cor_2024_106711
crossref_primary_10_1109_TPWRS_2014_2355204
crossref_primary_10_1109_TNNLS_2013_2247418
crossref_primary_10_1007_s10626_008_0055_2
crossref_primary_10_1016_j_artint_2008_11_003
crossref_primary_10_1109_TNNLS_2014_2305841
crossref_primary_10_1137_17M1133087
crossref_primary_10_3390_math9101099
crossref_primary_10_1287_moor_1070_0252
crossref_primary_10_1287_opre_2016_1574
crossref_primary_10_1287_opre_2015_1349
crossref_primary_10_1016_j_automatica_2021_109897
crossref_primary_10_1080_24725854_2022_2156003
crossref_primary_10_1016_j_ress_2016_06_012
crossref_primary_10_1109_TAC_2023_3288623
crossref_primary_10_1287_opre_2022_2269
crossref_primary_10_1287_opre_1040_0185
crossref_primary_10_1016_j_amc_2010_09_018
crossref_primary_10_1111_poms_13669
crossref_primary_10_1137_16M1101209
crossref_primary_10_1137_06067746X
crossref_primary_10_1287_mnsc_2020_3592
crossref_primary_10_1115_1_4033834
crossref_primary_10_1109_TPEL_2016_2584678
crossref_primary_10_1007_s10951_009_0160_6
crossref_primary_10_1057_palgrave_rpm_5160086
crossref_primary_10_1109_TAC_2024_3465536
Cites_doi 10.1016/0022-247X(85)90317-8
10.1023/A:1019182903300
10.1287/mnsc.10.1.98
10.1007/BF00353877
10.1093/rfs/14.1.113
10.1214/aoap/1015345407
10.1287/mnsc.25.4.352
10.1007/BF01586932
10.1017/S1365100597002095
10.1109/90.842140
10.1007/BF00115009
10.1109/72.935083
10.1109/9.50339
10.1109/9.580874
10.1287/mnsc.16.5.281
10.1287/mnsc.6.3.259
10.1023/A:1022638523391
10.1287/opre.47.1.38
10.1007/BF00992701
10.1023/A:1004641123405
10.1093/oso/9780198538493.001.0001
10.1145/203330.203343
ContentType Journal Article
Copyright Copyright 2003 INFORMS
COPYRIGHT 2003 Institute for Operations Research and the Management Sciences
Copyright Institute for Operations Research and the Management Sciences Nov/Dec 2003
Copyright_xml – notice: Copyright 2003 INFORMS
– notice: COPYRIGHT 2003 Institute for Operations Research and the Management Sciences
– notice: Copyright Institute for Operations Research and the Management Sciences Nov/Dec 2003
DBID AAYXX
CITATION
3V.
7WY
7WZ
7X7
7XB
87Z
88E
88F
8AL
8AO
8FE
8FG
8FI
8FJ
8FK
8FL
8G5
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FRNLG
FYUFA
F~G
GHDGH
GNUQQ
GUQSH
HCIFZ
JQ2
K60
K6~
K7-
K9.
L.-
L6V
M0C
M0N
M0S
M1P
M1Q
M2O
M7S
MBDVC
P5Z
P62
PHGZM
PHGZT
PJZUB
PKEHL
PPXIY
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
DOI 10.1287/opre.51.6.850.24925
DatabaseName CrossRef
ProQuest Central (Corporate)
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
Health & Medical Collection
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Medical Database (Alumni Edition)
Military Database (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
ProQuest SciTech Collection
ProQuest Technology Collection
Hospital Premium Collection
Hospital Premium Collection (Alumni Edition)
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni)
ProQuest Research Library
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials - QC
ProQuest Central
Business Premium Collection
Technology Collection
ProQuest One
ProQuest Central Korea
Business Premium Collection (Alumni)
Health Research Premium Collection
ABI/INFORM Global (Corporate)
Health Research Premium Collection (Alumni)
ProQuest Central Student
ProQuest Research Library
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
ProQuest Health & Medical Complete (Alumni)
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ABI/INFORM Global
Computing Database
ProQuest Health & Medical Collection
Medical Database
Military Database (ProQuest)
Research Library
Engineering Database
Research Library (Corporate)
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest Health & Medical Research Collection
ProQuest One Academic Middle East (New)
One Health & Nursing
ProQuest One Business
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
ProQuest Central Basic
DatabaseTitle CrossRef
ProQuest Business Collection (Alumni Edition)
Research Library Prep
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
SciTech Premium Collection
ProQuest Military Collection
ProQuest Central China
ABI/INFORM Complete
ProQuest One Applied & Life Sciences
Health Research Premium Collection
Health & Medical Research Collection
ProQuest Central (New)
ProQuest Medical Library (Alumni)
Engineering Collection
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest One Academic Eastern Edition
ProQuest Hospital Collection
ProQuest Technology Collection
Health Research Premium Collection (Alumni)
ProQuest Business Collection
ProQuest Hospital Collection (Alumni)
ProQuest Health & Medical Complete
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Health & Medical Complete (Alumni)
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest One Health & Nursing
Research Library (Alumni Edition)
ProQuest Pharma Collection
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Health & Medical Research Collection
ProQuest Engineering Collection
Health and Medicine Complete (Alumni Edition)
ProQuest Central Korea
ProQuest Research Library
ABI/INFORM Complete (Alumni Edition)
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest Military Collection (Alumni Edition)
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
ProQuest Medical Library
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList
ProQuest Business Collection (Alumni Edition)
CrossRef


Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Sciences (General)
Computer Science
Business
EISSN 1526-5463
EndPage 865
ExternalDocumentID 515539611
A111899256
10_1287_opre_51_6_850_24925
4132447
opre.51.6.850.24925
opres_51_6_850
Genre Research Article
Feature
GroupedDBID 02
08R
123
1AW
1OL
29N
2AX
3V.
4.4
7WY
7X7
85S
88E
8AL
8AO
8FE
8FG
8FI
8FJ
8FL
8G5
8V8
92
AABCJ
ABBHK
ABDEX
ABEFU
ABJCF
ABPPZ
ABSIS
ABUWG
ABWPA
ACDCL
ACHQT
ACIWK
ACNCT
ACUWV
ACVYA
ADBBV
ADGDI
ADNFJ
AENEX
AEUPB
AFFNX
AFKRA
AJPNJ
AKVCP
ALMA_UNASSIGNED_HOLDINGS
AQNXB
AQSKT
ARAPS
AZQEC
B-7
BBAFP
BENPR
BEZIV
BGLVJ
BPHCQ
BVXVI
CBXGM
CCKSF
CS3
CWXUR
CYVLN
DWQXO
DZ
EBA
EBE
EBO
EBR
EBS
EBU
ECR
EHE
EJD
EMI
EMK
EPL
F20
F5P
FH7
FRNLG
FYUFA
G8K
GENNL
GNUQQ
GROUPED_ABI_INFORM_COMPLETE
GROUPED_ABI_INFORM_RESEARCH
GUPYA
GUQSH
HCIFZ
HVGLF
H~9
IAO
ICJ
IEA
IGG
IOF
ITC
JAV
JBC
JPL
JSODD
JST
K6
K60
K6V
K7-
L6V
LI
M0C
M0N
M1P
M1Q
M2O
M7S
MBDVC
MV1
N95
NIEAY
P2P
P62
PQEST
PQQKQ
PQUKI
PRG
PROAC
PSQYO
PTHSS
QVA
RNS
RPU
SA0
TAE
TH9
TN5
U5U
VQA
WH7
X
XFK
XHC
XI7
XJT
XXP
YHZ
YNT
YZZ
ZCG
ZY4
AETEA
HGD
Y99
-DZ
-~X
18M
AAAZS
AAWTO
AAXLS
AAYOK
ABAWQ
ABDPE
ABKVW
ABLWH
ABXSQ
ABYYQ
ACGFO
ACHJO
ACSVP
ACXJH
ADEPB
ADMHG
ADNWM
ADULT
AEGXH
AEMOZ
AFAIT
AFTQD
AGKTX
AHAJD
AHQJS
AIAGR
ALIPV
APTMU
ASMEE
BAAKF
CCPQU
HF~
HMCUK
IPSME
JAAYA
JBMMH
JBZCM
JENOY
JHFFW
JKQEH
JLEZI
JLXEF
JPPEU
K1G
K6~
PHGZM
PHGZT
PQBIZ
PQBZA
UKHRP
XOL
XSW
~02
~92
AADHG
AAYXX
ADMHC
AFFHD
CITATION
PJZUB
PPXIY
PQGLB
YYP
7XB
8FK
JQ2
K9.
L.-
PKEHL
PRINS
Q9U
ID FETCH-LOGICAL-c446t-dd0089498989e3da717ccbf3d0869a6a7241d6dcffb8f4c759b38fa0fef0e0ab3
IEDL.DBID M7S
ISICitedReferencesCount 409
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000187176800002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0030-364X
IngestDate Tue Oct 28 09:44:08 EDT 2025
Sat Nov 29 12:58:29 EST 2025
Sat Nov 29 10:59:48 EST 2025
Tue Nov 18 22:27:22 EST 2025
Sat Nov 29 06:35:29 EST 2025
Thu Jun 19 15:55:59 EDT 2025
Tue Jan 05 23:29:21 EST 2021
Fri Jan 15 03:35:16 EST 2021
IsPeerReviewed true
IsScholarly true
Issue 6
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c446t-dd0089498989e3da717ccbf3d0869a6a7241d6dcffb8f4c759b38fa0fef0e0ab3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 219137150
PQPubID 37962
PageCount 16
ParticipantIDs informs_primary_10_1287_opre_51_6_850_24925
highwire_informs_opres_51_6_850
crossref_citationtrail_10_1287_opre_51_6_850_24925
gale_infotracgeneralonefile_A111899256
proquest_journals_219137150
crossref_primary_10_1287_opre_51_6_850_24925
jstor_primary_4132447
gale_infotracacademiconefile_A111899256
ProviderPackageCode Y99
RPU
NIEAY
PublicationCentury 2000
PublicationDate 2003-11-01
PublicationDateYYYYMMDD 2003-11-01
PublicationDate_xml – month: 11
  year: 2003
  text: 2003-11-01
  day: 01
PublicationDecade 2000
PublicationPlace Linthicum
PublicationPlace_xml – name: Linthicum
PublicationTitle Operations research
PublicationYear 2003
Publisher INFORMS
Institute for Operations Research and the Management Sciences
Publisher_xml – name: INFORMS
– name: Institute for Operations Research and the Management Sciences
References B20
B21
B22
B23
B24
B25
B26
B27
B28
B29
B30
B31
B10
B32
B11
B33
B12
B34
B13
B35
B14
B36
B15
B37
B16
B17
B18
B19
B1
B2
B3
B4
B5
B6
B7
B8
B9
De Ghellinck G. (B12) 1960; 2
Zhang W. (B37) 1996; 8
Crites R. H. (B8) 1996; 8
Guestrin C. (B17) 2002
Bertsekas D. (B1) 1995
Rybko A. N. (B25) 1992; 28
Bertsekas D. (B2) 1996
Van Roy B. (B36) 2000
Bishop C. M. (B4) 1995
Schuurmans D. (B26) 2001; 14
Haykin S. (B18) 1994
Sutton R. S. (B29) 1998
de Farias D. P. (B11) 2001
References_xml – ident: B12
– ident: B9
– ident: B35
– ident: B14
– ident: B10
– ident: B3
– ident: B20
– ident: B1
– ident: B27
– ident: B7
– ident: B5
– ident: B29
– ident: B25
– ident: B23
– ident: B21
– ident: B18
– ident: B16
– ident: B31
– ident: B33
– ident: B37
– ident: B8
– ident: B36
– ident: B11
– ident: B13
– ident: B2
– ident: B26
– ident: B4
– ident: B28
– ident: B6
– ident: B24
– ident: B22
– ident: B17
– ident: B32
– ident: B15
– ident: B30
– ident: B34
– ident: B19
– ident: B27
  doi: 10.1016/0022-247X(85)90317-8
– ident: B6
  doi: 10.1023/A:1019182903300
– ident: B14
  doi: 10.1287/mnsc.10.1.98
– year: 2002
  ident: B17
  publication-title: J. Artificial Intelligence Res.
– ident: B5
  doi: 10.1007/BF00353877
– ident: B21
  doi: 10.1093/rfs/14.1.113
– volume-title: Reinforcement Learning: An Introduction
  year: 1998
  ident: B29
– volume: 8
  start-page: 1024
  volume-title: Advances in Neural Information Processing Systems
  year: 1996
  ident: B37
– volume: 14
  start-page: 1579
  volume-title: Advances in Neural Information Processing Systems
  year: 2001
  ident: B26
– volume-title: Neuro-Dynamic Programming
  year: 1996
  ident: B2
– ident: B3
  doi: 10.1214/aoap/1015345407
– volume: 2
  start-page: 161
  year: 1960
  ident: B12
  publication-title: Cahiers du Centre d'Etudes de Recherche Opérationnelle
– ident: B19
  doi: 10.1287/mnsc.25.4.352
– volume: 8
  start-page: 1017
  volume-title: Advances in Neural Information Processing Systems
  year: 1996
  ident: B8
– ident: B16
  doi: 10.1007/BF01586932
– ident: B32
  doi: 10.1017/S1365100597002095
– ident: B24
  doi: 10.1109/90.842140
– ident: B28
  doi: 10.1007/BF00115009
– ident: B34
  doi: 10.1109/72.935083
– volume: 28
  start-page: 3
  year: 1992
  ident: B25
  publication-title: Problemy Peredachi Informatsii
– ident: B20
  doi: 10.1109/9.50339
– ident: B33
  doi: 10.1109/9.580874
– volume-title: Dynamic Programming and Optimal Control
  year: 1995
  ident: B1
– ident: B13
  doi: 10.1287/mnsc.16.5.281
– ident: B22
  doi: 10.1287/mnsc.6.3.259
– ident: B23
  doi: 10.1023/A:1022638523391
– ident: B7
  doi: 10.1287/opre.47.1.38
– ident: B9
  doi: 10.1007/BF00992701
– volume-title: Markov Decision Processes: Models, Methods, Directions, and Open Problems
  year: 2000
  ident: B36
– ident: B10
  doi: 10.1023/A:1004641123405
– volume-title: Neural Networks: A Comprehensive Formulation
  year: 1994
  ident: B18
– volume-title: Neural Networks for Pattern Recognition
  year: 1995
  ident: B4
  doi: 10.1093/oso/9780198538493.001.0001
– year: 2001
  ident: B11
  publication-title: Math. Oper. Res.
– ident: B30
  doi: 10.1145/203330.203343
SSID ssj0009565
Score 2.3218565
Snippet The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of large-scale stochastic control...
SourceID proquest
gale
crossref
jstor
informs
highwire
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 850
SubjectTerms Algorithms
Approximation
Approximation theory
Average cost
Dynamic programming
Dynamic programming/optimal control: approximations/large-scale problems
Error bounds
Liapunov functions
Linear programming
Machine learning
Mathematical vectors
Methods
Operations research
Process controls
Queueing networks
Queues, algorithms: control of queueing networks
Queuing
Studies
Title The Linear Programming Approach to Approximate Dynamic Programming
URI http://or.journal.informs.org/cgi/content/abstract/51/6/850
https://www.jstor.org/stable/4132447
https://www.proquest.com/docview/219137150
Volume 51
WOSCitedRecordID wos000187176800002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: ABI/INFORM Collection
  customDbUrl:
  eissn: 1526-5463
  dateEnd: 20091130
  omitProxy: false
  ssIdentifier: ssj0009565
  issn: 0030-364X
  databaseCode: 7WY
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global
  customDbUrl:
  eissn: 1526-5463
  dateEnd: 20091130
  omitProxy: false
  ssIdentifier: ssj0009565
  issn: 0030-364X
  databaseCode: M0C
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1526-5463
  dateEnd: 20091130
  omitProxy: false
  ssIdentifier: ssj0009565
  issn: 0030-364X
  databaseCode: P5Z
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1526-5463
  dateEnd: 20091130
  omitProxy: false
  ssIdentifier: ssj0009565
  issn: 0030-364X
  databaseCode: K7-
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1526-5463
  dateEnd: 20091130
  omitProxy: false
  ssIdentifier: ssj0009565
  issn: 0030-364X
  databaseCode: M7S
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Health & Medical Collection
  customDbUrl:
  eissn: 1526-5463
  dateEnd: 20091130
  omitProxy: false
  ssIdentifier: ssj0009565
  issn: 0030-364X
  databaseCode: 7X7
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/healthcomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Military Database (ProQuest)
  customDbUrl:
  eissn: 1526-5463
  dateEnd: 20091130
  omitProxy: false
  ssIdentifier: ssj0009565
  issn: 0030-364X
  databaseCode: M1Q
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/military
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1526-5463
  dateEnd: 20091130
  omitProxy: false
  ssIdentifier: ssj0009565
  issn: 0030-364X
  databaseCode: BENPR
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Research Library
  customDbUrl:
  eissn: 1526-5463
  dateEnd: 20091130
  omitProxy: false
  ssIdentifier: ssj0009565
  issn: 0030-364X
  databaseCode: M2O
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/pqrl
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3db9MwED-xDSF4YKwMEQYlD4gPQbp82U6fUFaytWJNQyki48WKnRghoW4shb-fc-JUnUATEi-nJrnGae98_l1y-R3AMwQVlOIy5DBBPf2YkTgilMSpIip8yoSsVEPiesrSNMrzYWZqc2pTVtnFxCZQl-dS3yM_xJnlBQzhy9uLH45uGqUfrpoOGluwo0kSvKZy7-MG5y5tGxgEGGpomBvSIcwRDnWHkQHxBnQQEXegWfPIlYWpC88dZ3DzrpNGkXVXt_hH7G4WpOPd__wp9-CuQaJ23LrOHtyolj241RXC92C3a_hgm_nfgzsb7IU92DP7a_ulIa9-dR-OFuPEPp2kSTy3s_nsZB5Pp5P0xI4z3IpHY3sxaz_nk2m8SOx3Z2mMnrCpuw-fjpPFaOyYPg2OxGRy5ZQlAolh2HSirIKywAxRSqGCEtOlYUELhiihpKVUSkQqlIwMRRCpwlWVciu3EMED2F6eL6uHYLMikJKViokyCkPhF0XllkSJivhUEEUs8DsjcWlIzHUvje9cJzNoWa4ty4nHKUfL8sayFrxZf-mi5fC4Xv2Ftj7XBsdzy8K8qIBXqLmyeIzLA2apiBUteH5F82v7Z_9N8WnnSdz4UTNyvR7agtfdgX-6xP3GCde6CEUQpzELDjqP4yYW1Xztbo-uPXoAt9tCRX176TFsry5_Vk_gpvy1-lZf9mGLfT7TMmd92DlK0myOW--Zg3LqjrT0Pmjpz_rNLESZkS-_Ab49Ku0
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1bb9MwFD4aA3F5YKwMEQYsD1w10qVJbKcPCIWtW6u2WVUFqXsysWMjJNSNpYD4UfxHjpO46gSaeNkDb0l8EufynVtsfwfgGQYVlKIb8pigHTPMSDwRSeKpmIqAMiGVrkhcRyxN49msO1mDX3YtjJlWaW1iZaiLU2n-ke-hZnVChuHLu7OvnikaZQZXbQWNGhVD9fMHZmzl28EBft7nQXDYy_b7XlNUwJOY-Sy8okCv142qsokqLHJMZ6QUOiwwtu_mNGfo0gpaSK1FrCPJSFeEsc59rbSv_FyEeN1rcD0KY2bUasi8FY5fWhdMCNG00WjWkBxhTrJnKpq0SadN2zHx24alj1xwhNYdWI7iam2ViVpLO0_yD19ROcDDjf_s1d2Du02k7Sa1amzCmpq34Kad6N-CDVvQwm3sWwvurLAztmCzOV66rxpy7tf34X3W77mjQdpLpu5kenw0TcbjQXrkJhPcS_b7bnZcb88G4yTruQcnaYJIX5Xdgg9X8twPYH1-OlcPwWV5KCUrNBNFHEUiyHPlF0QLRQIqiCYOBBYUXDYk7aZWyBdukjVEEjdI4qTDKUck8QpJDrxZnnRWc5RcLv7SoI0bgOG1Zd4sxMA7NFxgPEH3h1k4xsIOvLgg-al-2X8T3LHI5Q1uq57LZdcO7NqGf7rFrQr0S1kMtTAOZQ5sW4TzxtaWfAnvR5e27sCtfjYecYTIcBtu15Myza-0x7C-OP-mnsAN-X3xuTx_Wmm1Cx-vWhd-A0RXgkc
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB6Vgio4UBpaEQrUB14VOHFs765zQMg0SRO1SaMoSKGXxbveRUgoLXUA8dP4d8zau1EqUMWlB25-jL1-fPOyZ78BeIpBBaXohnwmaMv8ZiS-iCXxVUJFSJmQSpckrsdsNEpms_Z4DX65uTCmrNLZxNJQ52fSfCNvoma1IobhS1Pbqohxp_f2_KtvGkiZH62um0aFkCP18wdmb8WbQQdf9bMw7HWnB33fNhjwJWZBCz_P0QO247KFooryDFMbKYWOcozz2xnNGLq3nOZSa5HoWDLSFlGis0ArHaggExGe9wbcZJhimmrCMTld4fulVfOECM0cjWeW8Ajzk6bpbtIgrQZtJCRoGMY-cskpOtfg-IrLeVYmgi1czeQffqN0hr3N__gx3oO7NgL30kpltmBNzWuw4SYA1GDTNbrwrN2rwZ0V1sYabNnthffSknbv34d3037XOx6MuunEG09ODifpcDgYHXrpGNfSg743PamWZ4NhOu16nQ-jFDVgVXYb3l_Lfe_A-vxsrh6Ax7JISpZrJvIkjkWYZSrIiRaKhFQQTeoQOoBwacnbTQ-RL9wkcYgqblDFSYtTjqjiJarq8Hp50HnFXXK1-AuDPG7AhueWmZ2ggVdoOMJ4im4Rs3OMkevw_JLkp-ph_01wz6GYWwyXIxfLoevwyu34p0vcLhVgKYshGManrA67Du3c2uCCL6H-8Mq9e7CBKsARIUe7cLuq1TRf2B7B-uLim3oMt-T3xefi4kmp4B58vG5V-A2y8Itr
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+Linear+Programming+Approach+to+Approximate+Dynamic+Programming&rft.jtitle=Operations+research&rft.au=de+Farias%2C+D.+P&rft.au=Van+Roy%2C+B&rft.date=2003-11-01&rft.eissn=1526-5463&rft.volume=51&rft.issue=6&rft.spage=850&rft_id=info:doi/10.1287%2Fopre.51.6.850.24925&rft.externalDBID=n%2Fa&rft.externalDocID=opres_51_6_850
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0030-364X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0030-364X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0030-364X&client=summon