Asian Journal of Information Technology
ISSN: Online 1993-5994ISSN: Print 1682-3915
Abstract
Linear Programming Problems are mathematical models used to represent real life situations in the form of linear objective function and constraints various methods are available to solve linear programming problems. When formulating an LP model, systems analysts and researchers often include all possible constraints although some of them may not be binding at the optimal solution. The presence of redundant constraints does not alter the optimum solution(s), but may consume extra computational effort. Redundant constraints identification methods are applied for reducing computational effort in LP problems. But accuracy of the LP problems goes down due to this reduction of loops and constraints. To achieve optimality in accuracy and also in computational effort, we propose an algorithm, called, hybrid algorithm, it trains the constraint and parameter before applying the formal methodology.
How to cite this article:
B. Palaniappan and L.R. Arvind Babu . Hybrid Algorithmic Structure for Linear Programming Problems.
DOI: https://doi.org/10.36478/ajit.2008.69.73
URL: https://www.makhillpublications.co/view-article/1682-3915/ajit.2008.69.73