Inverse feasible problem

Journal of Industrial Engineering International

مقاله 7، دوره 1، شماره 1، آذر 2005، صفحه 48-49   

نویسنده

GH.R Amin^*

Postgraduate Engineering Center, Islamic Azad University, Tehran South Branch, Tehran, Iran

چکیده

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.

کلیدواژه‌ها

Inverse feasible problem؛ Polyhedron