Year: 2012
Type: article
Abstract: We define the primal and dual linear programming problems involving interval numbers as the way of traditional linear programming problems.We discuss the solution concepts of primal and dual linear programming problems involving interval numbers without converting them to classical linear programming problems.By introducing new arithmetic operations between interval numbers, we prove the weak and strong duality theorems.Complementary slackness theorem is also proved.A numerical example is provided to illustrate the theory developed in this paper.
Source: IOSR Journal of Mathematics
DOI: 10.9790/5728-0443947
Author: G. Ramesh, K. Ganesan
Institution: SRM Institute of Science and Technology
Language: English
Field: Decision Sciences
Domain: Social Sciences
Open Access status: bronze
OpenAlex ID: W2326947259
