An Improved Decomposition Approach and its Computational Technique for Analyzing Primal-Dual Relationship in LP & LFP Problems

Authors

  • HK Das Department of Mathematics and Statistics, Concordia University, Montr'eal, Quebec, H3G 1M8
  • M Babul Hasan Department of Mathematics, University of Dhaka, Dhaka-1000,

DOI:

https://doi.org/10.3329/ganit.v33i0.17660

Keywords:

LP, LFP, Primal-Dual, Decomposition and Computer Algebra

Abstract

In this paper, we study the methodology of primal dual solutions in Linear Programming (LP) & Linear Fractional Programming (LFP) problems. A comparative study is also made on different duals of LP & LFP. We then develop an improved decomposition approach for showing the relationship of primal and dual approach of LP & LFP problems by giving algorithm. Numerical examples are given to demonstrate our method. A computer programming code is also developed for showing primal and dual decomposition approach of LP & LFP with proper instructions using AMPL. Finally, we have drawn a conclusion stating the privilege of our method of computation.

GANIT J. Bangladesh Math. Soc. Vol. 33 (2013) 65-75

DOI: http://dx.doi.org/10.3329/ganit.v33i0.17660

Downloads

Download data is not yet available.
Abstract
180
PDF
134

Downloads

Published

2014-01-13

How to Cite

Das, H., & Hasan, M. B. (2014). An Improved Decomposition Approach and its Computational Technique for Analyzing Primal-Dual Relationship in LP & LFP Problems. GANIT: Journal of Bangladesh Mathematical Society, 33, 65–75. https://doi.org/10.3329/ganit.v33i0.17660

Issue

Vol. 33 (2013)

Section

Articles

License

The copyright of GANIT: Journal of Bangladesh Mathematical Society is reserved by Bangladesh Mathematical Society (web: https://bdmathsociety.org/)