Inverse feasible problem

محورهای موضوعی : Mathematical Optimization

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

تاریخ دریافت : 1394/02/29 تاریخ پذیرش : 1394/02/29 تاریخ انتشار : 1384/06/10

کلید واژه: Inverse feasible problem, Polyhedron,

چکیده مقاله :

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.