Computer Programming Language Solution to a Transportation Problem Involving a Concave Cost Function
Opara Jude, Ojekudo, Nathaniel Akpofure
Asian Research Journal of Mathematics · pp. 141–154 · Published 29 Dec 2022
10.9734/arjom/2022/v18i12633Abstract
The work is on computer programming language solution to a transportation problem involving a concave cost function. Two computer programming languages; Wolfram Mathematica and Anaconda Python programming tools were employed in this study to effectively solve four real life examples from published works. The results from the programming languages yielded an optimal value of N253,000 with an optimal solution as z12 = 13, z22 = 5, z23 = 8, z31 = 11 and z33 = 4 in the first example and the remaining three examples were successfully solved with optimal values of N377,000, GH¢ 236,000 and N509,000 respectively, and the results agreed with the results of existing Karush-Kuhn-Tucker (KKT) procedure of Modified Distribution Method.
Cited by 1
P. Senthil Kumar · Advances in Logistics, Operations, and Management Science · 2024
Related research
- Optimal Solution for the Intuitionistic Fuzzy Assignment Problem via Three Methods-IFRMM, IFOAM, IFAM — shares topic coverage
- Modelling and Allocation of Crops: Mathematical Programming Approach — shares topic coverage
- The Maximum Flow and Minimum Cost–Maximum Flow Problems: Computing and Applications — shares topic coverage
- The Out-of-Kilter Algorithm and Its Applications to Network Flow Problems — shares topic coverage
- A Comparative Study of Solving Methods of Transportation Problem in Linear Programming Problem — shares topic coverage
Article metrics
Real usage data collected on this platform.
31
Page views
0
PDF downloads
3
Outbound clicks
1
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.