A Robust Optimization Approach to Inventory Theory
We propose a general methodology based on robust optimization to address the problem of optimally controlling a supply chain subject to stochastic demand in discrete time. This problem has been studied in the past using dynamic programming, which suffers from dimensionality problems and assumes full...
Uložené v:
| Vydané v: | Operations research Ročník 54; číslo 1; s. 150 - 168 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Linthicum, MD
INFORMS
01.01.2006
Institute for Operations Research and the Management Sciences |
| Predmet: | |
| ISSN: | 0030-364X, 1526-5463 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We propose a general methodology based on robust optimization to address the problem of optimally controlling a supply chain subject to stochastic demand in discrete time. This problem has been studied in the past using dynamic programming, which suffers from dimensionality problems and assumes full knowledge of the demand distribution. The proposed approach takes into account the uncertainty of the demand in the supply chain without assuming a specific distribution, while remaining highly tractable and providing insight into the corresponding optimal policy. It also allows adjustment of the level of robustness of the solution to trade off performance and protection against uncertainty. An attractive feature of the proposed approach is its numerical tractability, especially when compared to multidimensional dynamic programming problems in complex supply chains, as the robust problem is of the same difficulty as the nominal problem, that is, a linear programming problem when there are no fixed costs, and a mixed-integer programming problem when fixed costs are present. Furthermore, we show that the optimal policy obtained in the robust approach is identical to the optimal policy obtained in the nominal case for a modified and explicitly computable demand sequence. In this way, we show that the structure of the optimal robust policy is of the same base-stock character as the optimal stochastic policy for a wide range of inventory problems in single installations, series systems, and general supply chains. Preliminary computational results are very promising. |
|---|---|
| AbstractList | We propose a general methodology based on robust optimization to address the problem of optimally controlling a supply chain subject to stochastic demand in discrete time. This problem has been studied in the past using dynamic programming, which suffers from dimensionality problems and assumes full knowledge of the demand distribution. The proposed approach takes into account the uncertainty of the demand in the supply chain without assuming a specific distribution, while remaining highly tractable and providing insight into the corresponding optimal policy. It also allows adjustment of the level of robustness of the solution to trade off performance and protection against uncertainty. An attractive feature of the proposed approach is its numerical tractability, especially when compared to multidimensional dynamic programming problems in complex supply chains, as the robust problem is of the same difficulty as the nominal problem, that is, a linear programming problem when there are no fixed costs, and a mixed-integer programming problem when fixed costs are present. Furthermore, we show that the optimal policy obtained in the robust approach is identical to the optimal policy obtained in the nominal case for a modified and explicitly computable demand sequence. In this way, we show that the structure of the optimal robust policy is of the same base-stock character as the optimal stochastic policy for a wide range of inventory problems in single installations, series systems, and general supply chains. Preliminary computational results are very promising. We propose a general methodology based on robust optimization to address the problem of optimally controlling a supply chain subject to stochastic demand in discrete time. This problem has been studied in the past using dynamic programming, which suffers from dimensionality problems and assumes full knowledge of the demand distribution. The proposed approach takes into account the uncertainty of the demand in the supply chain without assuming a specific distribution, while remaining highly tractable and providing insight into the corresponding optimal policy. It also allows adjustment of the level of robustness of the solution to trade off performance and protection against uncertainty. An attractive feature of the proposed approach is its numerical tractability, especially when compared to multidimensional dynamic programming problems in complex supply chains, as the robust problem is of the same difficulty as the nominal problem, that is, a linear programming problem when there are no fixed costs, and a mixed-integer programming problem when fixed costs are present. Furthermore, we show that the optimal policy obtained in the robust approach is identical to the optimal policy obtained in the nominal case for a modified and explicitly computable demand sequence. In this way, we show that the structure of the optimal robust policy is of the same base-stock character as the optimal stochastic policy for a wide range of inventory problems in single installations, series systems, and general supply chains. Preliminary computational results are very promising. [PUBLICATION ABSTRACT] |
| Audience | Trade |
| Author | Thiele, Aurelie Bertsimas, Dimitris |
| Author_xml | – sequence: 1 fullname: Bertsimas, Dimitris – sequence: 2 fullname: Thiele, Aurelie |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17460903$$DView record in Pascal Francis |
| BookMark | eNqFkc1rGzEQxUVJoM7HNbfAEmhv644-13s0IW0CgUBJoTehVSRbZi1tJLkl-eurzYYaSkKlw4D4vZnRe0fowAdvEDrDMMdk0XwJQzRzDBzmQOjiA5phTkTNmaAHaAZAoaaC_fyIjlLaAEDLBZ8hsqy-h26XcnU3ZLd1zyq74KvlMMSg9LrKobrxv4zPIT5V92tTygk6tKpP5vS1HqMfX6_uL6_r27tvN5fL21pzCrlWlmrzAK0BIQTTXOOm0xa3uLNgmeps1zBNMIHO8rYjC1uObjtFaGEUbugxupj6llUedyZluQm76MtISQrCBGYjVE_QSvVGOm9DjkqvjDdR9cUf68rzEjMKDW8FKfz8Db7cB7N1-k3Bp9ctVNKqt1F57ZIcotuq-CRxwwS0QPeNdQwpRWP3CMgxHznmI8d85JhPEbB_BNrlF_fLRq5_X3Y-yTapZPJ3COHFkJazvSHj3-I2_X-NzxO_dqv1bxcnU0bhCCbJmcQSc6B_AC55u4E |
| CODEN | OPREAI |
| CitedBy_id | crossref_primary_10_1007_s10479_018_2908_x crossref_primary_10_1177_1748006X17692203 crossref_primary_10_1016_j_jclepro_2024_142621 crossref_primary_10_1155_2019_3754367 crossref_primary_10_1002_cpe_5049 crossref_primary_10_1109_TEM_2017_2691404 crossref_primary_10_1016_j_eneco_2018_03_014 crossref_primary_10_1287_mnsc_2020_3719 crossref_primary_10_1515_math_2024_0010 crossref_primary_10_1049_iet_rpg_2019_1127 crossref_primary_10_1016_j_cie_2019_06_047 crossref_primary_10_1016_j_trc_2018_01_020 crossref_primary_10_1287_trsc_2015_0657 crossref_primary_10_1371_journal_pone_0254893 crossref_primary_10_1007_s10957_019_01611_x crossref_primary_10_1016_j_omega_2021_102494 crossref_primary_10_1111_poms_12887 crossref_primary_10_1080_00207543_2014_937509 crossref_primary_10_1371_journal_pone_0284971 crossref_primary_10_1109_JSYST_2019_2911011 crossref_primary_10_1016_j_omega_2022_102776 crossref_primary_10_1016_j_omega_2022_102775 crossref_primary_10_1142_S2196888822500166 crossref_primary_10_1287_mnsc_2013_1753 crossref_primary_10_1007_s10957_025_02818_x crossref_primary_10_1007_s10458_011_9172_7 crossref_primary_10_1016_j_ress_2017_11_026 crossref_primary_10_1080_00207543_2020_1828640 crossref_primary_10_1016_j_ijpe_2023_109096 crossref_primary_10_1155_2013_848312 crossref_primary_10_1016_j_cie_2021_107497 crossref_primary_10_1371_journal_pone_0184103 crossref_primary_10_1016_j_ejor_2011_08_017 crossref_primary_10_1142_S0219622015500157 crossref_primary_10_1007_s10696_021_09420_z crossref_primary_10_1016_j_tre_2021_102553 crossref_primary_10_1287_mnsc_2020_3603 crossref_primary_10_1016_j_ejor_2022_08_024 crossref_primary_10_1016_j_ijepes_2015_05_046 crossref_primary_10_1016_j_ejor_2012_03_023 crossref_primary_10_1155_2016_4751528 crossref_primary_10_1016_j_tre_2024_103812 crossref_primary_10_7737_MSFE_2014_20_2_001 crossref_primary_10_1016_j_asoc_2014_07_001 crossref_primary_10_1016_j_ejor_2020_12_023 crossref_primary_10_1016_j_apenergy_2021_118022 crossref_primary_10_1109_TPWRS_2014_2331560 crossref_primary_10_1016_j_eswa_2023_120510 crossref_primary_10_1016_j_ijpe_2013_11_028 crossref_primary_10_1016_j_ejor_2018_07_048 crossref_primary_10_1016_j_jclepro_2016_05_133 crossref_primary_10_1287_mnsc_2015_2391 crossref_primary_10_1016_j_apm_2015_01_007 crossref_primary_10_1016_j_cor_2017_11_013 crossref_primary_10_3390_su122310210 crossref_primary_10_1016_j_compind_2013_04_010 crossref_primary_10_1080_01605682_2018_1507424 crossref_primary_10_1287_mnsc_2017_2969 crossref_primary_10_1007_s40092_018_0271_9 crossref_primary_10_3390_pr9010102 crossref_primary_10_1371_journal_pone_0125939 crossref_primary_10_1007_s10100_023_00872_2 crossref_primary_10_1016_j_automatica_2016_09_016 crossref_primary_10_1002_aic_14730 crossref_primary_10_1016_j_ejor_2012_10_007 crossref_primary_10_1287_msom_2020_0926 crossref_primary_10_1016_j_tre_2023_103193 crossref_primary_10_1007_s11590_015_0853_z crossref_primary_10_1007_s10107_023_02049_w crossref_primary_10_1016_j_cie_2011_01_007 crossref_primary_10_1155_2011_497014 crossref_primary_10_1016_j_ijpe_2017_10_011 crossref_primary_10_1016_j_ijpe_2024_109379 crossref_primary_10_1287_msom_2018_0731 crossref_primary_10_1287_ijoo_2023_0007 crossref_primary_10_1016_j_tre_2016_01_009 crossref_primary_10_2139_ssrn_4732158 crossref_primary_10_1137_080734510 crossref_primary_10_1016_j_jclepro_2017_08_180 crossref_primary_10_1016_j_dam_2025_08_051 crossref_primary_10_1007_s10479_017_2750_6 crossref_primary_10_1007_s10479_014_1756_6 crossref_primary_10_1111_poms_13868 crossref_primary_10_1016_j_cie_2020_106411 crossref_primary_10_1016_j_ifacol_2019_11_223 crossref_primary_10_1002_nav_22147 crossref_primary_10_1287_opre_1090_0718 crossref_primary_10_1515_fcds_2017_0004 crossref_primary_10_1007_s40430_020_02633_7 crossref_primary_10_1016_j_eswa_2011_05_047 crossref_primary_10_1016_j_automatica_2019_02_009 crossref_primary_10_1080_00207543_2017_1353157 crossref_primary_10_1287_opre_1080_0650 crossref_primary_10_1287_opre_1090_0746 crossref_primary_10_1109_TSTE_2018_2878230 crossref_primary_10_1016_j_apenergy_2022_120559 crossref_primary_10_1016_j_trb_2023_102805 crossref_primary_10_1016_j_ejor_2017_10_026 crossref_primary_10_1287_opre_1070_0441 crossref_primary_10_1287_mnsc_2013_1822 crossref_primary_10_1016_j_ejor_2017_02_027 crossref_primary_10_1016_j_cie_2018_08_015 crossref_primary_10_1007_s10479_019_03264_5 crossref_primary_10_1111_poms_13143 crossref_primary_10_1016_j_tre_2024_103466 crossref_primary_10_1016_j_cie_2016_05_042 crossref_primary_10_1287_moor_2021_1213 crossref_primary_10_1016_j_tre_2023_103293 crossref_primary_10_1080_23302674_2025_2472965 crossref_primary_10_1007_s00521_021_06129_w crossref_primary_10_1016_j_cie_2020_106521 crossref_primary_10_1016_j_cor_2020_105081 crossref_primary_10_1016_j_cor_2025_107261 crossref_primary_10_1139_X08_175 crossref_primary_10_1080_00207543_2017_1413257 crossref_primary_10_1287_mnsc_2013_1839 crossref_primary_10_1016_j_omega_2019_102170 crossref_primary_10_1016_j_ejor_2015_04_043 crossref_primary_10_1007_s10878_017_0147_8 crossref_primary_10_1007_s00500_023_07825_6 crossref_primary_10_1287_msom_2021_0135 crossref_primary_10_1007_s11590_022_01875_9 crossref_primary_10_1016_j_ejor_2022_02_054 crossref_primary_10_1007_s10479_010_0706_1 crossref_primary_10_1287_moor_2014_0693 crossref_primary_10_1111_poms_13920 crossref_primary_10_1016_j_apenergy_2019_114480 crossref_primary_10_1007_s10957_017_1067_6 crossref_primary_10_1016_j_ejor_2021_12_046 crossref_primary_10_1016_j_jii_2025_100843 crossref_primary_10_1007_s10951_013_0330_4 crossref_primary_10_1287_opre_1100_0906 crossref_primary_10_1007_s00291_024_00772_0 crossref_primary_10_1007_s00500_022_07148_y crossref_primary_10_1007_s10287_016_0250_9 crossref_primary_10_1137_090769533 crossref_primary_10_1287_msom_1100_0316 crossref_primary_10_1016_j_procs_2021_12_264 crossref_primary_10_7737_MSFE_2015_21_2_001 crossref_primary_10_1016_j_ejor_2024_01_025 crossref_primary_10_1057_jors_2012_139 crossref_primary_10_1016_j_apm_2017_07_039 crossref_primary_10_1061__ASCE_EE_1943_7870_0000469 crossref_primary_10_1007_s11301_024_00463_8 crossref_primary_10_1016_j_enconman_2012_09_001 crossref_primary_10_1287_opre_1070_0428 crossref_primary_10_1016_j_eswa_2021_116346 crossref_primary_10_1016_j_trc_2023_104244 crossref_primary_10_1051_smdo_2013015 crossref_primary_10_1109_TEM_2024_3411149 crossref_primary_10_1016_j_ijpe_2016_06_013 crossref_primary_10_1080_00207543_2017_1351635 crossref_primary_10_1016_j_ijpe_2018_04_002 crossref_primary_10_1287_trsc_1110_0387 crossref_primary_10_1007_s10342_018_1153_9 crossref_primary_10_1287_mnsc_2016_2565 crossref_primary_10_1007_s10342_010_0393_0 crossref_primary_10_1016_j_automatica_2022_110661 crossref_primary_10_1111_itor_13150 crossref_primary_10_1016_j_cie_2024_110823 crossref_primary_10_1111_deci_12429 crossref_primary_10_1016_j_ejor_2022_02_035 crossref_primary_10_1007_s10479_014_1573_y crossref_primary_10_1080_00207543_2016_1213915 crossref_primary_10_1016_j_jmsy_2015_11_004 crossref_primary_10_1016_j_tre_2022_102671 crossref_primary_10_1080_02331934_2010_537338 crossref_primary_10_1080_00207543_2014_935514 crossref_primary_10_1016_j_agwat_2011_05_013 crossref_primary_10_1287_ijoc_2022_0330 crossref_primary_10_1111_poms_12854 crossref_primary_10_1016_j_ejor_2021_11_024 crossref_primary_10_1287_opre_2022_0129 crossref_primary_10_1016_j_tre_2019_03_022 crossref_primary_10_1287_ijoo_2018_0007 crossref_primary_10_1016_j_apenergy_2023_121603 crossref_primary_10_1007_s00291_024_00807_6 crossref_primary_10_1016_j_autcon_2023_105190 crossref_primary_10_1016_j_ifacol_2022_09_492 crossref_primary_10_1016_j_cie_2015_07_004 crossref_primary_10_1016_j_energy_2020_119536 crossref_primary_10_1016_j_trb_2023_102849 crossref_primary_10_1016_j_ijpe_2014_03_021 crossref_primary_10_1016_j_automatica_2015_10_046 crossref_primary_10_1016_j_ijpe_2010_03_022 crossref_primary_10_1016_j_omega_2021_102537 crossref_primary_10_4028_www_scientific_net_AMM_591_27 crossref_primary_10_1287_trsc_1090_0292 crossref_primary_10_1007_s11269_013_0482_1 crossref_primary_10_1016_j_ejor_2025_08_032 crossref_primary_10_1007_s00170_009_2503_z crossref_primary_10_1016_j_ejor_2023_08_036 crossref_primary_10_1016_j_ejor_2020_06_016 crossref_primary_10_1109_TSG_2013_2257893 crossref_primary_10_1016_j_ejor_2020_03_052 crossref_primary_10_1111_poms_13339 crossref_primary_10_1007_s10479_013_1467_4 crossref_primary_10_1016_j_apm_2016_04_005 crossref_primary_10_3390_math12192978 crossref_primary_10_1287_moor_1070_0272 crossref_primary_10_1109_TAC_2009_2034204 crossref_primary_10_1016_j_trc_2021_103255 crossref_primary_10_1016_j_ejor_2024_09_002 crossref_primary_10_1007_s00291_018_0511_9 crossref_primary_10_1287_msom_2022_1168 crossref_primary_10_1007_s10479_022_04855_5 crossref_primary_10_1007_s11750_022_00638_0 crossref_primary_10_1007_s12351_020_00591_5 crossref_primary_10_1080_00207540701528776 crossref_primary_10_1007_s10589_012_9520_9 crossref_primary_10_1007_s10878_023_01079_6 crossref_primary_10_1111_j_1937_5956_2010_01194_x crossref_primary_10_1287_trsc_2017_0814 crossref_primary_10_1002_net_21497 crossref_primary_10_1016_j_cie_2023_109836 crossref_primary_10_2139_ssrn_3803777 crossref_primary_10_1016_j_cor_2022_106025 crossref_primary_10_1111_j_1937_5956_2012_01420_x crossref_primary_10_1287_ijoc_2022_1243 crossref_primary_10_1016_j_orl_2011_01_001 crossref_primary_10_1287_msom_2016_0577 crossref_primary_10_1016_j_cie_2025_111233 crossref_primary_10_1016_j_asoc_2023_110964 crossref_primary_10_1016_j_ins_2021_03_018 crossref_primary_10_1016_j_energy_2025_134791 crossref_primary_10_1016_j_ijpe_2009_11_008 crossref_primary_10_1049_iet_gtd_2015_0232 crossref_primary_10_1287_opre_2016_1546 crossref_primary_10_1016_j_automatica_2008_02_001 crossref_primary_10_1016_j_ejor_2018_01_005 crossref_primary_10_1016_j_jairtraman_2020_101979 crossref_primary_10_1287_msom_2017_0639 crossref_primary_10_1287_trsc_2019_0935 crossref_primary_10_1016_j_ejor_2020_07_041 crossref_primary_10_1287_mnsc_2022_4446 crossref_primary_10_1002_nav_70013 crossref_primary_10_1287_ijoc_2022_1229 crossref_primary_10_1016_j_orp_2025_100333 crossref_primary_10_1080_24725854_2024_2381713 crossref_primary_10_1287_opre_2017_1634 crossref_primary_10_1109_TTE_2020_2971825 crossref_primary_10_1007_s40092_014_0096_0 crossref_primary_10_1111_poms_13239 crossref_primary_10_1287_ijoo_2019_0023 crossref_primary_10_1016_j_apm_2013_03_008 crossref_primary_10_1016_j_ijpe_2018_06_013 crossref_primary_10_1111_j_1937_5956_2011_01261_x crossref_primary_10_1016_j_cie_2020_106388 crossref_primary_10_1287_ijoo_2021_0066 crossref_primary_10_1016_j_ejor_2019_09_007 crossref_primary_10_1007_s11590_023_01994_x crossref_primary_10_1287_ijoo_2021_0069 crossref_primary_10_1029_2011WR010596 crossref_primary_10_1080_01605682_2018_1468861 crossref_primary_10_1111_j_1475_3995_2009_00737_x crossref_primary_10_1016_j_sysconle_2013_10_013 crossref_primary_10_1287_opre_1090_0795 crossref_primary_10_1287_ijoc_2020_0978 crossref_primary_10_1287_msom_2023_0372 crossref_primary_10_4018_ijoris_2014070101 crossref_primary_10_1080_00207543_2016_1181284 crossref_primary_10_1287_opre_1090_0791 crossref_primary_10_1016_j_cie_2022_107937 crossref_primary_10_1080_00207179_2010_491131 crossref_primary_10_1016_j_omega_2008_11_004 crossref_primary_10_1080_24725854_2024_2381727 crossref_primary_10_1016_j_ejor_2021_03_001 crossref_primary_10_1287_moor_1100_0468 crossref_primary_10_1016_j_ejor_2021_12_027 crossref_primary_10_1109_ACCESS_2019_2899404 crossref_primary_10_1016_j_autcon_2024_105847 crossref_primary_10_1016_j_ejor_2022_03_029 crossref_primary_10_1287_opre_2020_2043 crossref_primary_10_1007_s10287_019_00356_2 crossref_primary_10_1016_j_ejor_2011_07_007 crossref_primary_10_1287_ijoc_2023_0126 crossref_primary_10_1111_poms_14071 crossref_primary_10_1007_s00291_017_0476_0 crossref_primary_10_1007_s10479_023_05660_4 crossref_primary_10_1016_j_ejor_2014_10_027 crossref_primary_10_1016_j_tre_2020_102004 crossref_primary_10_1080_0951192X_2014_1002811 crossref_primary_10_1287_opre_2016_1483 crossref_primary_10_1016_j_compchemeng_2017_11_017 crossref_primary_10_1016_j_cor_2011_02_022 crossref_primary_10_1007_s10479_025_06545_4 crossref_primary_10_1016_j_tre_2020_102005 crossref_primary_10_1088_1742_6596_2182_1_012043 crossref_primary_10_1002_nav_21748 crossref_primary_10_1016_j_ejor_2018_07_014 crossref_primary_10_1016_j_cor_2024_106851 crossref_primary_10_1080_00036846_2020_1826400 crossref_primary_10_1108_JM2_10_2023_0246 crossref_primary_10_1080_19427867_2025_2454075 crossref_primary_10_1287_ijoc_2020_1041 crossref_primary_10_1007_s10696_015_9211_9 crossref_primary_10_1016_j_ejor_2017_05_008 crossref_primary_10_1080_01605682_2019_1581406 crossref_primary_10_3390_math13091380 crossref_primary_10_1016_j_trc_2022_103903 crossref_primary_10_1111_j_1539_6924_2011_01702_x crossref_primary_10_1287_mnsc_2017_2952 crossref_primary_10_1016_j_cor_2015_11_002 crossref_primary_10_1007_s10107_006_0092_2 crossref_primary_10_1007_s10107_012_0592_1 crossref_primary_10_1080_00207540903176697 crossref_primary_10_1016_j_ijpe_2011_10_027 crossref_primary_10_1016_j_disopt_2006_12_002 crossref_primary_10_1016_j_ejor_2013_02_010 crossref_primary_10_1111_poms_14069 crossref_primary_10_1016_j_cie_2025_111151 crossref_primary_10_1111_deci_12170 crossref_primary_10_1088_1757_899X_300_1_012013 crossref_primary_10_1016_j_ejor_2019_04_043 crossref_primary_10_1007_s10479_021_04237_3 crossref_primary_10_1007_s10479_025_06790_7 crossref_primary_10_1016_j_eswa_2017_09_043 crossref_primary_10_1016_j_ijdrr_2016_08_011 crossref_primary_10_1016_j_compag_2014_05_016 crossref_primary_10_1016_j_energy_2025_137466 crossref_primary_10_1016_j_ijpe_2013_04_039 crossref_primary_10_1016_j_ejor_2021_07_040 crossref_primary_10_1016_j_ijpe_2019_04_035 crossref_primary_10_1007_s10479_015_2084_1 crossref_primary_10_2139_ssrn_5191873 crossref_primary_10_1016_j_ejor_2011_01_053 crossref_primary_10_1016_j_ejor_2023_05_015 crossref_primary_10_1016_j_rcim_2019_04_001 crossref_primary_10_1016_j_jclepro_2018_02_255 crossref_primary_10_1007_s11067_023_09589_w crossref_primary_10_3390_su16093821 crossref_primary_10_1016_j_cie_2019_106112 crossref_primary_10_1016_j_tre_2020_101932 crossref_primary_10_1007_s11750_021_00621_1 crossref_primary_10_1287_opre_2019_1846 crossref_primary_10_1007_s10479_018_3015_8 crossref_primary_10_1108_00251741111126512 crossref_primary_10_1016_j_automatica_2013_03_029 crossref_primary_10_1016_j_enbuild_2014_09_009 crossref_primary_10_1080_00207543_2023_2248279 crossref_primary_10_1080_00207543_2019_1616846 crossref_primary_10_1287_msom_1080_0252 crossref_primary_10_1016_j_apm_2013_07_028 crossref_primary_10_1287_opre_2017_1669 crossref_primary_10_1016_j_ijpe_2014_04_004 crossref_primary_10_1287_mnsc_1120_1543 crossref_primary_10_1016_j_simpat_2010_02_001 crossref_primary_10_1007_s10729_020_09528_y crossref_primary_10_1016_j_ijpe_2011_09_026 crossref_primary_10_1016_j_ejor_2021_07_016 crossref_primary_10_1287_mnsc_2015_2183 crossref_primary_10_1007_s10287_015_0240_3 crossref_primary_10_1080_00207543_2022_2136279 crossref_primary_10_1287_opre_2022_0091 crossref_primary_10_1016_j_spc_2021_12_028 crossref_primary_10_1007_s10957_009_9593_5 crossref_primary_10_1016_j_tre_2022_102712 crossref_primary_10_1016_j_jclepro_2020_125230 crossref_primary_10_1080_01605682_2018_1452536 crossref_primary_10_1016_j_cor_2017_08_004 crossref_primary_10_1109_TAC_2014_2331415 crossref_primary_10_1016_j_ecoleng_2014_04_003 crossref_primary_10_2139_ssrn_5368371 crossref_primary_10_1016_j_ijpe_2020_107840 crossref_primary_10_1109_TAES_2019_2947978 crossref_primary_10_1016_j_sbspro_2012_09_1142 crossref_primary_10_1016_j_egyr_2023_07_022 crossref_primary_10_1080_00207721_2013_860637 crossref_primary_10_1155_2014_238357 crossref_primary_10_1111_itor_12909 crossref_primary_10_1016_j_cor_2015_09_007 crossref_primary_10_1016_j_ijpe_2011_04_017 crossref_primary_10_1016_j_omega_2024_103112 crossref_primary_10_1007_s00498_009_0038_3 crossref_primary_10_1007_s10479_021_04292_w crossref_primary_10_1016_j_jclepro_2015_06_117 crossref_primary_10_1155_2021_1709363 |
| Cites_doi | 10.1137/S0895479896298130 10.1287/mnsc.41.2.263 10.1287/opre.42.2.351 10.1287/moor.23.4.769 10.1287/opre.50.2.358.424 10.1007/s10107-003-0396-4 10.1287/opre.1030.0065 10.1057/jors.1994.103 10.1007/978-1-4615-4024-3 10.1007/978-1-4684-9352-8 10.1016/0304-405X(87)90010-9 10.1016/S0167-6377(99)00016-4 10.1287/mnsc.6.4.475 10.1137/S1052623496305717 10.1007/978-1-4615-4949-9_2 10.1287/opre.21.5.1154 10.1007/PL00011380 10.1080/07408170108936879 10.1057/jors.1993.141 |
| ContentType | Journal Article |
| Copyright | Copyright 2006 INFORMS 2006 INIST-CNRS COPYRIGHT 2006 Institute for Operations Research and the Management Sciences Copyright Institute for Operations Research and the Management Sciences Jan/Feb 2006 |
| Copyright_xml | – notice: Copyright 2006 INFORMS – notice: 2006 INIST-CNRS – notice: COPYRIGHT 2006 Institute for Operations Research and the Management Sciences – notice: Copyright Institute for Operations Research and the Management Sciences Jan/Feb 2006 |
| DBID | AAYXX CITATION IQODW 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.1050.0238 |
| DatabaseName | CrossRef Pascal-Francis ProQuest Central (Corporate) ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest 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 ProQuest Central (New) Business Premium Collection Technology Collection ProQuest One Community College ProQuest Central 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 (ProQuest) 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) ProQuest One Health & Nursing ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest 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 | CrossRef ProQuest Business Collection (Alumni Edition) |
| 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 Applied Sciences |
| EISSN | 1526-5463 |
| EndPage | 168 |
| ExternalDocumentID | 996946501 A143075962 17460903 10_1287_opre_1050_0238 25146954 opre.1050.0238 opres_54_1_150 |
| Genre | Original Articles Feature |
| GeographicLocations | United States |
| GeographicLocations_xml | – name: United States |
| 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 YNT YZZ ZCG AETEA HGD Y99 YHZ ZY4 -DZ -~X 18M AAAZS AAWTO AAXLS AAYOK ABAWQ ABDPE ABKVW ABLWH ABXSQ ABYYQ ACGFO ACHJO ACSVP ACXJH ADEPB ADMHC 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 AFFHD CITATION PJZUB PPXIY PQGLB YYP IQODW 7XB 8FK JQ2 K9. L.- PKEHL PRINS Q9U |
| ID | FETCH-LOGICAL-c530t-af3ced09e06664c5c17bcf191bf0f4abfb74c2120bf59b28ffffc9ba23191a173 |
| IEDL.DBID | K7- |
| ISICitedReferencesCount | 432 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000235596200012&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 | Mon Oct 06 17:30:02 EDT 2025 Sat Nov 29 12:46:16 EST 2025 Sat Nov 29 11:06:35 EST 2025 Mon Jul 21 09:11:48 EDT 2025 Sat Nov 29 06:35:29 EST 2025 Tue Nov 18 22:35:02 EST 2025 Thu Jun 19 16:02:47 EDT 2025 Tue Jan 05 23:29:21 EST 2021 Fri Jan 15 03:35:26 EST 2021 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Uncertainty Fixed cost Optimal policy Financial management Linear programming Mixed integer programming integer Optimization Trade Base stock Inventory control production: uncertainty Robustness Dynamic programming Complex programming programming: linear stochastic; inventory |
| Language | English |
| License | CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c530t-af3ced09e06664c5c17bcf191bf0f4abfb74c2120bf59b28ffffc9ba23191a173 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| PQID | 219146147 |
| PQPubID | 37962 |
| PageCount | 19 |
| ParticipantIDs | proquest_journals_219146147 gale_infotracacademiconefile_A143075962 crossref_citationtrail_10_1287_opre_1050_0238 highwire_informs_opres_54_1_150 jstor_primary_25146954 gale_infotracgeneralonefile_A143075962 pascalfrancis_primary_17460903 crossref_primary_10_1287_opre_1050_0238 informs_primary_10_1287_opre_1050_0238 |
| ProviderPackageCode | Y99 RPU NIEAY |
| PublicationCentury | 2000 |
| PublicationDate | 2006-01-01 |
| PublicationDateYYYYMMDD | 2006-01-01 |
| PublicationDate_xml | – month: 01 year: 2006 text: 2006-01-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | Linthicum, MD |
| PublicationPlace_xml | – name: Linthicum, MD – name: Linthicum |
| PublicationTitle | Operations research |
| PublicationYear | 2006 |
| 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 B10 B21 B11 B22 B12 B23 B13 B24 B14 B15 B16 B17 B18 B19 B1 B2 B3 B4 B5 B6 B7 B8 B9 Scarf H. (B22) 1958 Bertsekas D. (B5) 1996 Zipkin P. (B24) 2000 Bertsekas D. (B4) 1995; 1 Glasserman P. (B14) 1991 |
| References_xml | – ident: B8 – ident: B12 – ident: B9 – ident: B11 – ident: B13 – ident: B14 – ident: B10 – ident: B3 – ident: B2 – ident: B20 – ident: B1 – ident: B4 – ident: B7 – ident: B5 – ident: B6 – ident: B24 – ident: B22 – ident: B23 – ident: B21 – ident: B17 – ident: B18 – ident: B16 – ident: B15 – ident: B19 – volume-title: Gradient Estimation via Perturbation Analysis year: 1991 ident: B14 – ident: B10 doi: 10.1137/S0895479896298130 – ident: B15 doi: 10.1287/mnsc.41.2.263 – ident: B12 doi: 10.1287/opre.42.2.351 – ident: B1 doi: 10.1287/moor.23.4.769 – ident: B6 doi: 10.1287/opre.50.2.358.424 – ident: B7 doi: 10.1007/s10107-003-0396-4 – ident: B8 doi: 10.1287/opre.1030.0065 – ident: B21 doi: 10.1057/jors.1994.103 – ident: B16 doi: 10.1007/978-1-4615-4024-3 – ident: B18 doi: 10.1007/978-1-4684-9352-8 – ident: B19 doi: 10.1016/0304-405X(87)90010-9 – ident: B2 doi: 10.1016/S0167-6377(99)00016-4 – ident: B9 doi: 10.1287/mnsc.6.4.475 – ident: B11 doi: 10.1137/S1052623496305717 – start-page: 201 volume-title: Studies in the Mathematical Theory of Inventory and Production year: 1958 ident: B22 – ident: B17 doi: 10.1007/978-1-4615-4949-9_2 – volume-title: Foundations of Inventory Management year: 2000 ident: B24 – volume-title: Neuro-Dynamic Programming year: 1996 ident: B5 – ident: B23 doi: 10.1287/opre.21.5.1154 – ident: B3 doi: 10.1007/PL00011380 – volume: 1 volume-title: Dynamic Programming and Optimal Control year: 1995 ident: B4 – ident: B13 doi: 10.1080/07408170108936879 – ident: B20 doi: 10.1057/jors.1993.141 |
| SSID | ssj0009565 |
| Score | 2.387218 |
| Snippet | We propose a general methodology based on robust optimization to address the problem of optimally controlling a supply chain subject to stochastic demand in... |
| SourceID | proquest gale pascalfrancis crossref jstor informs highwire |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 150 |
| SubjectTerms | Analysis Applied sciences Approximation Carrying costs Cost efficiency Cost functions Dynamic programming Exact sciences and technology Fixed costs integer Integer programming inventory Inventory control Inventory control, production control. Distribution Inventory management linear Linear programming Logistics Mathematical models Mathematical programming Operational research and scientific management Operational research. Management science Operations research Optimal policy Optimization production programming Robust optimization Robust statistics stochastic Studies Supply chain management Supply chains uncertainty |
| Title | A Robust Optimization Approach to Inventory Theory |
| URI | http://or.journal.informs.org/cgi/content/abstract/54/1/150 https://www.jstor.org/stable/25146954 https://www.proquest.com/docview/219146147 |
| Volume | 54 |
| WOSCitedRecordID | wos000235596200012&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: 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: ProQuest 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: 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/eLvHCXMwpV1Lb9QwEB7RFqFyoHShIhSWHBCPQ6iTOHF9QkvVCgRslwJl6cVynBghwaZsUiT-PTOJve2K14Ec5pCMHCczmYcz_gbgfllaWbFCR5WJ04iXkiBvmYg4t4ZlTGvR7eI_fiXG493pVE5cbU7jyiq9TewMdVkbWiPfSQiIDH2JeHr6LaKmUfRz1XXQWIG1OEliUvOXIrqAuZv3DQxSNDU5nzrMRswRdqjDCLW4ZU_IZy35JG-ZPVxwt82JAsjGlyxS_aRu8BXavvfFL2a8800HG__5VNfhmgtKw1GvRZtwqZoN4IqviR_Ahu_9EDpTMICrF4AMB7DpzjfhI4dj_fgGJKPwqC7OmjY8RLv01W34DEcOxTxs6_BFV_Jez3-EPUbATXh_sP9u73nkWjREJktZG2mbmqpkKG5Mg7jJTCwKY_GhCsss14UtBDfoHVlhM1kkuxYPIwuNUaWMdSzSLVid1bPqFoSZrDB9MRmzouC6woxfiFyWGGHkFStTE0DkhaSMwy-nNhpfFOUxKFRFQlUkVEVCDeDhgv-0R-74MyfJXJGYcUSj3c4EnBeBY6kRxpQYWck8CeDBEuen_pX-jvGe1x_ltKe7aaMyrmKFUTgO5S_8a3ZbndYt2DAi5bnMeADDJTU8H0fwnJbfAtj2SqecZWrUQuNu__XqNqyfLzbdgdV2flbdhcvme_u5mQ9hRXz4SHQqhrD2bH88ORp23x7S12yPaPyGaHJIVLxFOslOfgLjBzZn |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB6VgngcKA1UhEK7B54H07W99tYHhCKgatQ0PNSi3BbvehchQVLiFNQfxX9kxt5NG_E69UCO8Wiytr-dx2bmG4D7VeUKy3UZWROnkagKorzlMhLCGZ7xspRNF__7gRwOt0ej4s0S_Ai9MFRWGWxiY6iriaEz8q2EiMjQl8jnR18jGhpFf66GCRotKvbsyXfM2Opn_Zf4eh8kyc6rgxe7kR8qEJks5bOodKmxFccFYuAuTGZiqY1D5dpxJ0rttBQG7TnXLit0su3wYwpdYhxUxGUsU9R7AS4KDHRoQ-3Hb89w_ObtwIQUTVsuRp4jEnOSLZpoQiN1-VPykQs-MHiCQE_ctFVRwFqHEkmq1yxrfGWunbXxi9tofOHOyn_2FG_AdR90s167S1ZhyY47cDnU_HdgJcy2YN7UdeDaGaLGDqz672v22PN0P7kJSY-9m-jjesZeo9394htaWc-ztLPZhPWbkv7J9IS1HAi34PBc7nMNlseTsb0NLCsspmcm405qUVqrEynzosIIKre8Sk0XogAKZTw_O40J-awoT0MQKQKRIhApAlEXHs3lj1pmkj9LEsYUwQo1mtJ3XuC6iPxL9TBmxsixyJMuPFyQ_Ng-0t8Jbga8Ko_W5kdrlQkVK8wyUFW48K_VrTUon4thxC3yIhNd2FiA_akeKXI6XuzCegC58pa3VnOE3_nr1U24snuwP1CD_nBvHa6eHqzdheXZ9Njeg0vm2-xTPd1o9jiDD-e9HX4Cb36OLQ |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB6Vgio4UBqoCIV2DzwPJmt77a0PCEWUiChVqBCg3BbvehchQVLiFNSfxr9jxt5NG_E69UCO8Wi9sb95bWa-AbhfVa6wXJeRNXEaiaogylsuIyGc4RkvS9l08b8_lOPx_mRSHK3Bj9ALQ2WVwSY2hrqaGToj7yVERIa-RPacr4o4Ohg8P_4a0QAp-qM1TNNoETKyp98xe6ufDQ_wVT9IksHLty9eRX7AQGSylC-i0qXGVhw3i0G8MJmJpTYOb6Qdd6LUTkth0LZz7bJCJ_sOP6bQJcZERVzGMsV1L8FldMIZqdhIRuf4fvN2eEKKZi4XE88XiflJj6ab0Hhd_pT85Yo_DF4hUBU3LVYUvNahXJJqN8saX59r52784kIavzjY_I-f6A247oNx1m-1ZwvW7LQDG6EXoAObYeYF8yawA9fOETh2YMt_X7PHnr_7yU1I-uzNTJ_UC_Ya7fEX3-jK-p69nS1mbNiU-s_mp6zlRrgF7y7kd27D-nQ2tbeBZYXFtM1k3EktSmt1ImVeVBhZ5ZZXqelCFACijOdtp_EhnxXlbwgoRYBSBChFgOrCo6X8cctY8mdJwpsiiOGKpvQdGbgvIgVTfYylMaIs8qQLD1ckP7aP9HeCewG7yiO3uWmtMqFihdkHLhUu_Gt32w3il2IYiYu8yEQXdldU4GwdKXI6duzCTgC88ha5Vku03_nr1T3YQC1Qh8PxaAeunp233YX1xfzE3oMr5tviUz3fbdSdwYeL1oaf496Wrg |
| 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=A+Robust+Optimization+Approach+to+Inventory+Theory&rft.jtitle=Operations+research&rft.au=Bertsimas%2C+Dimitris&rft.au=Thiele%2C+Aur%C3%A9lie&rft.date=2006-01-01&rft.pub=Institute+for+Operations+Research+and+the+Management+Sciences&rft.issn=0030-364X&rft.eissn=1526-5463&rft.volume=54&rft.issue=1&rft.spage=150&rft.epage=168&rft_id=info:doi/10.1287%2Fopre.1050.0238&rft.externalDocID=25146954 |
| 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 |