Logistic Planning with Nonlinear Goal Programming Models in Spreadsheets

Logistic Planning with Nonlinear Goal Programming Models in Spreadsheets

Kenneth David Strang
Copyright: © 2012 |Pages: 14
DOI: 10.4018/jal.2012100101
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

This is a case study of a coal mining company to demonstrate how algebra principles and nonlinear goal programming can be applied for logistics planning using spreadsheet software. The paper asserts that mathematical programming techniques are not well-accepted by managers because the models are difficult to understand due to abstract notational conventions yet alternative commercial software is inflexible (and sometimes inaccurate). The relevant operations research literature was reviewed, highlighting techniques applicable for analyzing quantitative and qualitative logistics data. A practical supply-demand transportation logistics model was built which included determinist constraints and stochastic costing theories, while applying both linear and nonlinear calculus slope principles. The formulae were explained in algebraic standard form (citing corresponding spreadsheet functions). The logistics problem was optimized, illustrating how 6 mining sites could supply 4 countries with sufficient coal to meet different electricity demand levels, surpassing the break-even goal and projecting annual revenue of over $34 billion.
Article Preview
Top

Literature Review

There are numerous techniques in operations research to analyze coal supply logistical problems. A recent operations research-management science handbook documented 152 topics, including: Age Replacement, Ant Colony, Branch and Bound, Clustering, Consensus Building, Fuzzy Search, Genetic Algorithms, JIT, Linear Programming, Markov, MRP, Risk Analysis, Scenario Analysis, Percolation Theory, Simplex, Spanning Tree, Stakeholder Participation, Queuing, Wardrop Equilibria, Warrant Models, and many other techniques (Cochran et al., 2011). Some of these are procedures for qualitative data more so than techniques (e.g., consensus building), while the field of quantitative data approaches ranges from stochastic forecasting (using probability theory), deterministic linear programming (when constraints are known), to nonlinear goal or search heuristics where infinite or no solutions may be possible. The implications are that one or several of the available techniques may be necessary to solve a complex logistical dilemma.

Complete Article List

Search this Journal:
Reset
Volume 14: 1 Issue (2024): Forthcoming, Available for Pre-Order
Volume 13: 1 Issue (2023)
Volume 12: 2 Issues (2022): 1 Released, 1 Forthcoming
Volume 11: 2 Issues (2021)
Volume 10: 2 Issues (2020)
Volume 9: 2 Issues (2019)
Volume 8: 2 Issues (2018)
Volume 7: 2 Issues (2017)
Volume 6: 2 Issues (2016)
Volume 5: 2 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing