Work

A Decomposable Computer Oriented Method for Solving Interval LP Problems

Year: 2013

Type: article

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.

Source: Pure and Applied Mathematics Journal

DOI: 10.11648/j.pamj.20130205.13

Author: Sharmin Afroz

Institution: University of Dhaka

Language: English

Topic: Optimization and Mathematical Programming

Subfield: Management Science and Operations Research

Field: Decision Sciences

Domain: Social Sciences

Open Access status: bronze

OpenAlex ID: W2115122266

FWCI:

Cites: 12

Cited by:

Related to: 10