A Decomposable Computer Oriented Method for Solving Interval LP Problems

Abstract

Abstract:The purpose of this paper is to develop a computer oriented decomposition program for solving Interval Linear Programming (ILP) Problems. For this, we first analyze the existing methods for solving ILP problems. We also discuss the main stricter of Decomposable Interval programming (DIP) problems. Then a decomposable algorithm is analyzed for solving DIP problems. Using "Mathematica", we develop a computer oriented program for solving such problems. We present step by step illustration of a numerical example to demonstrate our technique.