<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2 20190208//EN" "https://jats.nlm.nih.gov/publishing/1.2/JATS-journalpublishing1.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en">
<front> <journal-meta>
<journal-id journal-id-type="publisher-id">Journal of Economics, Entrepreneurship and Law</journal-id>
<journal-title-group>
<journal-title xml:lang="en">Journal of Economics, Entrepreneurship and Law</journal-title>
<trans-title-group xml:lang="ru">
<trans-title>Экономика, предпринимательство и право</trans-title>
</trans-title-group>
</journal-title-group>
<issn publication-format="electronic">2222-534X</issn>
<publisher>
<publisher-name xml:lang="en">BIBLIO-GLOBUS Publishing House</publisher-name>
</publisher>
</journal-meta><article-meta>
<article-id pub-id-type="publisher-id">120730</article-id>
<article-id pub-id-type="doi">10.18334/epp.14.4.120730</article-id>
<article-id custom-type="edn" pub-id-type="custom">TCYJIB</article-id>
<article-categories>
<subj-group subj-group-type="toc-heading" xml:lang="en">
<subject>Articles</subject>
</subj-group>
<subj-group subj-group-type="toc-heading" xml:lang="ru">
<subject>Статьи</subject>
</subj-group>
<subj-group subj-group-type="article-type">
<subject>Research Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title xml:lang="en">Dynamic and stochastic linear programming tasks in logistics and supply chain management</article-title>
<trans-title-group xml:lang="ru">
<trans-title>Динамические и стохастические задачи линейного программирования в логистике и управлении цепями поставок</trans-title>
</trans-title-group>
</title-group>
<contrib-group>
<contrib contrib-type="author">

<name-alternatives>
<name xml:lang="en">
<surname>Bochkarev</surname>
<given-names>Andrey Aleksandrovich</given-names>
</name>
<name xml:lang="ru">
<surname>Бочкарев</surname>
<given-names>Андрей Александрович</given-names>
</name>
</name-alternatives>
<bio xml:lang="ru">
<p>профессор кафедры логистики и управления цепями поставок, доктор экономических наук, доцент</p>
</bio>
<email>andreibochkarev4@gmail.com</email>
<xref ref-type="aff" rid="aff1"/>
</contrib>

<contrib contrib-type="author">

<name-alternatives>
<name xml:lang="en">
<surname>Nos</surname>
<given-names>Viktor Anatolevich</given-names>
</name>
<name xml:lang="ru">
<surname>Нос </surname>
<given-names>Виктор Анатольевич</given-names>
</name>
</name-alternatives>
<bio xml:lang="ru">
<p>профессор кафедры логистики и управления цепями поставок, доктор экономических наук, профессор</p>
</bio>
<email>hocvik@yandex.ru</email>
<xref ref-type="aff" rid="aff1"/>
</contrib>

<contrib contrib-type="author">

<name-alternatives>
<name xml:lang="en">
<surname>Goncharenko</surname>
<given-names>Elena Alekseevna</given-names>
</name>
<name xml:lang="ru">
<surname>Гончаренко </surname>
<given-names>Елена Алексеевна</given-names>
</name>
</name-alternatives>
<bio xml:lang="ru">
<p>студент группы М-2112</p>
</bio>
<email>lenagoncharenko2004@gmail.com</email>
<xref ref-type="aff" rid="aff1"/>
</contrib>
</contrib-group><aff-alternatives id="aff1">
<aff>
<institution xml:lang="en">Saint Petersburg State University of Economics</institution>
</aff>
<aff>
<institution xml:lang="ru">Санкт-Петербургский государственный экономический университет</institution>
</aff>
</aff-alternatives>        
        
<pub-date date-type="pub" iso-8601-date="2024-04-30" publication-format="electronic">
<day>30</day>
<month>04</month>
<year>2024</year>
</pub-date>
<volume>14</volume>
<issue>4</issue>
<issue-title xml:lang="en">VOL 14, NO4 (2024)</issue-title>
<issue-title xml:lang="ru">ТОМ 14, №4 (2024)</issue-title>
<fpage>1123</fpage>
<lpage>1148</lpage>
<history>
<date date-type="received" iso-8601-date="2024-03-01">
<day>01</day>
<month>03</month>
<year>2024</year>
</date>
<date date-type="accepted" iso-8601-date="2024-03-11">
<day>11</day>
<month>03</month>
<year>2024</year>
</date>
</history>

<permissions>
<copyright-statement xml:lang="en">Copyright ©; 2024, Bochkarev A.A., Nos V.A., Goncharenko E.A.</copyright-statement>
<copyright-statement xml:lang="ru">Copyright ©; 2024, Бочкарев А.А., Нос В.А., Гончаренко Е.А.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder xml:lang="en">Bochkarev A.A., Nos V.A., Goncharenko E.A.</copyright-holder>
<copyright-holder xml:lang="ru">Бочкарев А.А., Нос В.А., Гончаренко Е.А.</copyright-holder>
<ali:free_to_read xmlns:ali="http://www.niso.org/schemas/ali/1.0/" start_date="2024-04-30"/>
</permissions>



<self-uri xlink:href="https://1economic.ru/lib/120730">https://1economic.ru/lib/120730</self-uri>
<abstract xml:lang="en"><p>Applications of mathematical programming methods to logistics and supply chain management are continuously expanding. New practical problems require co-improvement of approaches to the mathematical formulation of problems and methods for solving them.
The article discusses dynamic and stochastic tasks of linear programming, which have found wide application in logistics, as well as methods of their recreation. The vast class of these tasks is represented by various types of mathematical models, commonly used in logistics. 
Thus, the following tasks can be considered as models of dynamic and stochastic linear programming: the task of the strategy of purchasing and selling goods in conditions of changing demand, the task of calculating the size of a batch and the choice of suppliers taking into account the area of warehouse facilities and budget constraints, etc. 
 
This article presents the stochastic task of optimization of container cargo shipment of MMK-METIZ OJSC to the container point of the railway station of the city of Magnitogorsk and considers an example of its numerical solution.</p>
</abstract>
<trans-abstract xml:lang="ru"><p>В статье рассматривается ряд динамических и стохастических задач линейного программирования и методы их решения. Обширный класс данных задач представлен различными видами математических моделей, нередко применяемых в логистике. Так, в качестве моделей динамического и стохастического линейного программирования могут быть рассмотрены задача о стратегии приобретения и продажи товаров в условиях изменяющегося спроса, задача расчета размера партии поставки и выбора поставщиков с учетом площади складских помещений и бюджетных ограничений, а также множество других задач, представленных в обзоре научной литературы.
В данной статье представлена стохастическая задача оптимизации отправки контейнерных грузов ОАО «ММК-МЕТИЗ» на контейнерный пункт железнодорожной товарной станции города Магнитогорска и рассмотрен пример ее численного решения</p>
</trans-abstract>
<kwd-group xml:lang="en">
<kwd>supply chains</kwd>
<kwd>linear programming</kwd>
<kwd>stochastic programming</kwd>
<kwd>container cargo shipment optimization</kwd>
<kwd>mathematical setting</kwd>
<kwd>optimality</kwd></kwd-group><kwd-group xml:lang="ru">
<kwd>Цепи поставок</kwd>
<kwd>линейное программирование</kwd>
<kwd>стохастическое программирование</kwd>
<kwd>оптимизации отправок контейнерных грузов</kwd>
<kwd>математическая постановка</kwd>
<kwd>оптимальность</kwd></kwd-group>
</article-meta>
</front>
<back> <ref-list>
<ref id="B1">
<label>1.</label>
<mixed-citation>1. Бочкарев А. А Оптимизация перевозок контейнерных грузов // Логистика и управление цепями поставок. – 2012. – № 1. – c. 43-55.</mixed-citation>
</ref>
<ref id="B2">
<label>2.</label>
<mixed-citation>2. Бочкарев А. А., Бочкарев П. А., Франюк Р. А. Динамическое программирование и планирование сценариев в задаче оптимизации перевозок контейнерных грузов // Аудит и финансовый анализ. – 2018. – № 5. – c. 61-73.</mixed-citation>
</ref>
<ref id="B3">
<label>3.</label>
<mixed-citation>3. Шапиро Дж. Моделирование цепи поставок. / пер. с англ. под ред. В.С. Лукинского. - СПб.: Питер, 2006. – 720 c.</mixed-citation>
</ref>
<ref id="B4">
<label>4.</label>
<mixed-citation>4. Юдин Д. Б., Гольштейн Е. Г. Задачи и методы линейного программирования: математические основы и практические задачи. / 3-е изд. - М. : ЛИБРОКОМ, 2010. – 320 c.</mixed-citation>
</ref>
<ref id="B5">
<label>5.</label>
<mixed-citation>5. Aghazadeh D., Ertogral K. An Improved Approximate Dynamic Programming Method for The Integrated Fleet Sizing and Replenishment Planning Problem with Predetermined Delivery Frequencies // IFAC-PapersOnLine. – 2022. – № 10. – p. 3034–3039.</mixed-citation>
</ref>
<ref id="B6">
<label>6.</label>
<mixed-citation>6. Beraldi P., Violi A., Carrozzino G. The optimal management of the prosumer’s resources via stochastic programming // Energy Reports. – 2020. – № 6. – p. 274–280.</mixed-citation>
</ref>
<ref id="B7">
<label>7.</label>
<mixed-citation>7. Blomvall J., Hagenbjork J. Reducing transaction costs for interest rate risk hedging with stochastic programming // Europe Journalof Operational Research. – 2022. – № 302. – p. 1282-1293.</mixed-citation>
</ref>
<ref id="B8">
<label>8.</label>
<mixed-citation>8. Carkovs J., Matvejevs A., Matvejevs A., Kubzdela A. Stochastic modeling for transport logistics // Procedia Computer Science. – 2019. – № 149. – p. 457–462.</mixed-citation>
</ref>
<ref id="B9">
<label>9.</label>
<mixed-citation>9. Czerniachowska K., Lutosławski K. Dynamic Programming approach for solving the retail shelf-space allocation problem // Procedia Computer Science. – 2021. – № 192. – p. 4320–4329.</mixed-citation>
</ref>
<ref id="B10">
<label>10.</label>
<mixed-citation>10. Eslamipoor R. A two-stage stochastic planning model for locating product collection centers in green logistics networks // Cleaner Logistics and Supply Chain. – 2023. – № 6. – p. 1-8.</mixed-citation>
</ref>
<ref id="B11">
<label>11.</label>
<mixed-citation>11. Galatsidas S., Petridis K., Arabatzis G., Kondos K. Forest production management and harvesting scheduling using dynamic Linear Programming (LP) models // Procedia Technology. – 2013. – № 8. – p. 349 – 354.</mixed-citation>
</ref>
<ref id="B12">
<label>12.</label>
<mixed-citation>12. Hsu P., Aurisicchio M., Angeloudis P. Optimal logistics planning for modular construction using multistage stochastic programming // Transportation Research Procedia. – 2019. – № 46. – p. 245–252.</mixed-citation>
</ref>
<ref id="B13">
<label>13.</label>
<mixed-citation>13. Huang D., Wang S. A two-stage stochastic programming model of coordinated electric bus charging scheduling for a hybrid charging scheme // Multimodal Transportation. – 2022. – № 1. – p. 1-11.</mixed-citation>
</ref>
<ref id="B14">
<label>14.</label>
<mixed-citation>14. Innis C., Chen P. Dynamic Programming-based Macroscopic Speed Planner for Electric Vehicle Platooning // IFAC-PapersOnLine. – 2022. – № 37. – p. 31–36.</mixed-citation>
</ref>
<ref id="B15">
<label>15.</label>
<mixed-citation>15. Maggioni F., Perboli G., Todei R. The Multi-Path Traveling Salesman Problem with Stochastic Travel Costs: Building Realistic Instances for City Logistics Applications // Transportation Research Procedia. – 2014. – № 3. – p. 528 – 536.</mixed-citation>
</ref>
<ref id="B16">
<label>16.</label>
<mixed-citation>16. Mirhassani S.A., Khaleghi A., Hooshmand F. Two-stage stochastic programming model to locate capacitated EV-charging stations in urban areas under demand uncertainty // EURO Journal on Transportation and Logistics. – 2020. – № 9. – p. 1-12.</mixed-citation>
</ref>
<ref id="B17">
<label>17.</label>
<mixed-citation>17. Moon Y., Nozarijouybari Z., Handler C. Optimal Spin-Up Motion of Wind Turbine using Deterministic Dynamic Programming // IFAC-PapersOnLine. – 2022. – № 55. – p. 770–775.</mixed-citation>
</ref>
<ref id="B18">
<label>18.</label>
<mixed-citation>18. Nayeem M.K., Alam S.T. A scenario-based stochastic programming model for multi-commodity distribution considering disruption in distribution network // Results in Control and Optimization. – 2022. – № 8. – p. 1-13.</mixed-citation>
</ref>
<ref id="B19">
<label>19.</label>
<mixed-citation>19. Nievas N., Pagès-Bernaus A., Bonada F., Echeverria L. A Dynamic Programming approach for bath cycle time optimization in hot meal forming // IFAC-PapersOnLine. – 2022. – № 55. – p. 2671–2676.</mixed-citation>
</ref>
<ref id="B20">
<label>20.</label>
<mixed-citation>20. Rimele A., Dimitrakopoulos R., Gamache M. A dynamic stochastic programming approach for open-pit mine planning with geological and commodity price uncertainty // Resources Policy. – 2020. – № 65. – p. 1-8.</mixed-citation>
</ref>
<ref id="B21">
<label>21.</label>
<mixed-citation>21. Schaffer L.E., Helseth A., Korpas M. A stochastic dynamic programming model for hydropower scheduling with state-dependent maximum discharge constraints // Renewable Energy. – 2021. – № 194. – p. 571-581.</mixed-citation>
</ref>
<ref id="B22">
<label>22.</label>
<mixed-citation>22. Schledorn A., Guericke D., Andersen A.N., Madsen H. Optimising block bids of district heating operators to the day-ahead electricity market using stochastic programming // Smart Energy. – 2021. – № 1. – p. 1-11.</mixed-citation>
</ref>
<ref id="B23">
<label>23.</label>
<mixed-citation>23. Sun J., Ozawa M., Zhang W.,Takahashi K. Electricity supply chain management considering environmental evaluation: A multi-period optimization stochastic programming model // Cleaner and Responsible Consumption. – 2022. – № 7. – p. 1-11.</mixed-citation>
</ref>
<ref id="B24">
<label>24.</label>
<mixed-citation>24. Wang J., Yang H., Zhu J. A Two-stage Stochastic Programming Model for Emergency Resources Storage Region Division // Systems Engineering Procedia. – 2012. – № 5. – p. 125 – 130.</mixed-citation>
</ref>
</ref-list>
</back>
</article>