OPTIMIZING TRANSPORT COST | Neuroquantology

Volume 20 No 7 (2022)

OPTIMIZING TRANSPORT COST

Shailaja Uke, Vaishnavi Shivakumar, Atharva Abhay Vanjari, Vaishnavi SKangralkar, Nitesh Chunilal Valavi, Prasad Suresh Varnekar

DOI: 10.14704/nq.2022.20.7.NQ33200

Abstract

In this paper, we propose a linear programming problem (LPP) to minimize the transportation cost by using the simplex method. Simplex method is a linear programming method for transportation problems. The aim is to minimize transport costs. Transport costs need to be minimized to increase sales margins. In this document, we examine three cases that are smaller, larger, and equal to the company's budget. The results of our work show that using the simplex method is a very effective way to reduce transportation costs.

Keywords

simplex method, linear programming, costoptimization, cases, reduced row echelon form

Copyright © Neuroquantology

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Articles published in the Neuroquantology are available under Creative Commons Attribution Non-Commercial No Derivatives Licence (CC BY-NC-ND 4.0). Authors retain copyright in their work and grant IJECSE right of first publication under CC BY-NC-ND 4.0. Users have the right to read, download, copy, distribute, print, search, or link to the full texts of articles in this journal, and to use them for any other lawful purpose.