International Journal of Scientific & Technology Research

IJSTR@Facebook IJSTR@Twitter IJSTR@Linkedin
Home About Us Scope Editorial Board Blog/Latest News Contact Us

IJSTR >> Volume 3- Issue 5, May 2014 Edition

International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616

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

[Full Text]



Hamiden A. Khalifa, Ramadan A. ZeinEldin



Index Terms: Inverse problem; Nonlinear programming problem; Kuhn-Tucker conditions; Stability, Optimal solution.



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.



[1]. J.S. Bridle, “Probabilistic Interpretation of Feedforward Classification Network R. K. Ahuja and J. B. Orlin, "Inverse optimization, part 1: Linear Programming and General Problem," Working Paper, Sloan School of Management, MIT, Cambridge, MA, 1998.

[2]. D. Burton and Ph. L. Toint, "On an instance of the inverse shortest paths problem," Mathematical Programming, vol. 53, no. 1-3, pp. 45-61, 6 January 1992.

[3]. D. Burton, and Ph. L. Toint, "On the use of an inverse shortest paths algorithm for recovering linearly correlated costs," Mathematical Programming, vol. 63, no. 1-3, pp. 1-22, 6 January 1992.

[4]. D. Burton, B. Pulleyblank, and Ph. L. Toint, "The inverse shortest paths problem with upper bounds on shortest paths costs". In Network Optimization, edited by P. Pardalos, D. W. Hearn, and W. H. Hager, Lecture Notes in Economics and Mathematical Systems, vol. 450, pp. 156-171, 1997.

[5]. M. Cai, and X. Yang, "Inverse Shortest Path Problems," Technical Report, Institute of Systems Sciences, Academia Science, Beijing China, 1994.

[6]. H. Du, M, Cui, "Representation of the exact solution and a stability analysis on the Fredholm integral equation of the first kind in reproducing kernel space," Applied Mathematics and Computation, vol. 182, no. 2, pp. 1608-1614, 2006.

[7]. R. Farnoosh, M. Ebrahimi, "Monte Carlo simulation via a numerical algorithm for solving a nonlinear inverse problem," Communications in Nonlinear Science and Numerical Simulation, vol. 15, no. 9, pp. 2436-2444, Sep. 2010.

[8]. S. Huang, and Z. Liu, "On the inverse version of the minimum cost flow problem," Working Paper, Department of ISMT, School of Business and Management, Hong Kong University of Science and Technology, Hong Kong, 1995.

[9]. J. Huang, H. Huang, Z. Li, Y. Wei, "Stability analysis via condition number and effective condition number for the first kind boundary integral equations by advanced quadrature methods, a comparison," Engineering Analysis with Boundary Elements, vol. 35, no. 4, pp. 667-677, Apr. 2011.

[10]. W. Jiang, M. Cui, "The exact solution and stability analysis for integral equation of third or first kind with singular kernel," Applied Mathematics and Computation, vol. 202, no. 2, pp. 666-674, Aug. 2008.

[11]. K.M. Levere, H. Kunze, D. La Torre, "A collage-based approach to solving inverse problems for second-order nonlinear parabolic PDEs," Journal of Mathematical Analysis and Applications, vol. 406, no. 1, pp. 120-133, Oct. 2013.

[12]. L. Li, and W. Liu, (2014). "Runge–Kutta type total variation regularization for nonlinear inverse problems," Journal of Computational and Applied Mathematics, vol. 263, pp. 103-114, June 2014.

[13]. O. L. Mangasarian, Nonlinear Programming, Mc Graw-Hill, New York, 1969.

[14]. F. Ornelas-Tellez, E. N. Sanchez, A. G. Loukianov, J. J. Rico, "Robust inverse optimal control for discrete-time nonlinear system stabilization," European Journal of Control, vol. 20, no. 1, pp. 38-44, Jan. 2014.

[15]. M. Osman, "Qualitative analysis of basic notions in parametric convex programming, I (Parameter in the constraints)," Aplikace Mat., vol. 22, pp. 318-332, 1977.

[16]. M. Osman, "Qualitative analysis of basic notions in parametric programming, II (Parameters in the objective function)," Aplikace Mat., vol. 22, pp. 333-348, 1977.

[17]. S. Xu and J. Zhang, "An inverse problem of the weighted shortest path problem," Japanese Journal of Industrial and Applied Mathematics, vol. 12, pp. 47-59, 1995.

[18]. C. Yang, J. Zhang, and Z. Ma, "Inverse maximum flow and minimum cut problem," Optimization, vol. 40, pp. 147-170, 1997.

[19]. J. Zhang, and M. C. Cai, "Inverse problem of minimum cuts," Mathematical Methods of Operations Research, vol. 47, no. 1, 1998.

[20]. Q. Zou, Q. Zhang, J. Yang, A. Cloutier, E. Pena-Pitarch, "Nonlinear inverse optimization approach for determining the weights of objective function in standing reach tasks," Computers & Industrial Engineering, vol. 63, no. 4, pp. 791-801, Dec. 2012.