A Computer Technique for Solving LP Problems with Bounded Variables

Authors

  • S. M. Atiqur Rahman Chowdhury Department of Mathematics; University of Dhaka, Dhaka
  • Sanwar Uddin Ahmad Department of Mathematics; University of Dhaka, Dhaka

DOI:

https://doi.org/10.3329/dujs.v60i2.11487

Keywords:

LPP, bounded simplex method, bounded variable, computer program, restrictions

Abstract

Linear Programming problem (LPP)s with upper bounded variables can be solved using the Bounded Simplex method (BSM),without the explicit consideration of the upper bounded constraints. The upper bounded constraints are considered implicitly in this method which reduced the size of the basis matrix significantly. In this paper, we have developed MATHEMATICA codes for solving such problems. A complete algorithm of the program with the help of a numerical example has been provided. Finally a comparison with the built-in code has been made for showing the efficiency of the developed code.

DOI: http://dx.doi.org/10.3329/dujs.v60i2.11487

Dhaka Univ. J. Sci. 60(2): 163-168, 2012 (July)

Downloads

Download data is not yet available.
Abstract
356
PDF
855

Downloads

Published

2012-07-31

How to Cite

Chowdhury, S. M. A. R., & Ahmad, S. U. (2012). A Computer Technique for Solving LP Problems with Bounded Variables. Dhaka University Journal of Science, 60(2), 163–168. https://doi.org/10.3329/dujs.v60i2.11487

Issue

Vol. 60 No. 2 (2012)

Section

Articles