Utilization Of The Stability Set Of The First Kind For Solving Inverse Nonlinear Programming Problems

Abstract In this paper we study inverse nonlinear programming INLP problem under the norm where we adjust the cost coefficients of the given nonlinear programming NLP problem as less as possible such that a known feasible solution becomes the optimal one. Here we utilize of the basic notions of stability the solvability set and the stability set of the first kind. A solution procedure to solve the INLP problem is given. A numerical example is presented in the sake of this paper to clarify the obtained results.