A Computer Technique for Solving LP Problems with Bounded Variables

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 s...

Full description

Saved in:
Bibliographic Details
Published inThe Dhaka University journal of science Vol. 60; no. 2; pp. 163 - 168
Main Authors Chowdhury, S. M. Atiqur Rahman, Ahmad, Sanwar Uddin
Format Journal Article
LanguageEnglish
Published 31.07.2012
Online AccessGet full text

Cover

More Information
Summary: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)
ISSN:1022-2502
2408-8528
DOI:10.3329/dujs.v60i2.11487