Inverse feasible problem

Subject Areas : Mathematical Optimization

GH.R Amin ¹ ( Postgraduate Engineering Center, Islamic Azad University, Tehran South Branch, Tehran, Iran )

Received: 2015-05-19 Accepted : 2015-05-19 Published : 2005-09-01

Keywords: Inverse feasible problem, Polyhedron,

Abstract :

In many infeasible linear programs it is important to construct it to a feasible problem with a minimum pa-rameters changing corresponding to a given nonnegative vector. This paper defines a new inverse problem, called “inverse feasible problem”. For a given infeasible polyhedron and an n-vector a minimum perturba-tion on the parameters can be applied and then a feasible polyhedron is concluded.