Acta Marisiensis.
Seria Technologica



ISSN 2668-4217
ISSN-L 2668-4217
(Online)


English

Prima paginăColegiul editorialTrimite lucrareEtica publicațieiContactIndexare
Anul 2024
Volum 21 (XXXVIII), nr 1
Volum 21 (XXXVIII), nr 2

Anul 2023
Volum 20 (XXXVII), nr 1
Volum 20 (XXXVII), nr 2

Anul 2022
Volum 19 (XXXVI), nr 1
Volum 19 (XXXVI), nr 2

Anul 2021
Volum 18 (XXXV), nr 1
Volum 18 (XXXV), nr 2

Anul 2020
Volum 17 (XXXIV), nr 1
Volum 17 (XXXIV), nr 2

Anul 2019
Volum 16 (XXXIII), nr 1
Volum 16 (XXXIII), nr 2

Anul 2018
Volum 15 (XXXII), nr 1
Volum 15 (XXXII), nr 2

Anul 2017
Volum 14 (XXXI), nr 1
Volum 14 (XXXI), nr 2

Anul 2016
Volum 13 (XXX), nr 1
Volum 13 (XXX), nr 2

Anul 2015
Volum 12 (XXIX), nr 1
Volum 12 (XXIX), nr 2

Anul 2014
Volum 11 (XXVIII), nr 1
Volum 11 (XXVIII), nr 2

Anul 2013
Volum 10 (XXVII), nr 1
Volum 10 (XXVII), nr 2

Anul 2012
Volum 9 (XXVI), nr 1
Volum 9 (XXVI), nr 2

Anul 2011
Volum 8 (XXV), nr 1
Volum 8 (XXV), nr 2

Anul 2010
Volum 7 (XXIV), nr 1
Volum 7 (XXIV), nr 2

Anul 2009
Volum 6 (XXIII)

2023, Volume 20 (XXXVII), no 1

Mathematical Models Used in the Optimizations of Supply Chains

Author(s):
Stefan NAGY-BOTA, Liviu MOLDOVAN, Monica-Cristina NAGY-BOTA, Iulia E. VARGA, “George Emil Palade” University of Medicine, Pharmacy, Science and Technology of Targu Mures, Romania

Abstract:
This paper provides a synthesis of the concept of supply chain optimization. The aim of the research is to identify a supply chain optimization process, the key aspects in carrying out this process, and at the same time to emphasize the advantages that the optimization of companies' processes brings through the mathematical modeling of logistic processes that can be useful in the optimization of supply chains. In the research methodology it is used the Simplex transport algorithm. In a practical situation of a company with 3 warehouses and 4 clients, it allowed optimizing the transport routes and getting a minimal total cost for logistical delivery.

DOI: https://doi.org/10.2478/amset-2023-0005

Pages: 27-31

Cite as: download info as bibtex

View full article
Update: 18-Dec-2024 © Published by University Press