Abstract
In this paper, a logarithmic-exponential penalty function with two parameters for integer programming is discussed. We obtain the exact penalty properties and then establish the asymptotic strong nonlinear duality in the corresponding logarithmic-exponential dual formulation by using the obtained exact penalty properties. The discussion is based on the logarithmic-exponential nonlinear dual formulation proposed in [6].
Similar content being viewed by others
References
Li, D. Zero duality gap for a class of nonconvex optimization problem, J. Optim. Theory Appl., 85: 309–324 (1995)
Li, D. Zero duality gap in integer programming: pth power surrogate constraint method. Oper. Res. Lett., 25: 89–96 (1999)
Li, D., Sun, X.L. Success guarantee of dual search in integer programming: pth power Lagrangian method. Journal of Global Optimization, , 18: 235–254 (2000)
Sinclair, M. An exact penalty function approach for nonlinear integer programming problems. European J. Oper. Res., 27: 50–56 (1986)
Sun, X. L., Li, D. Value-estimation function method for constrained global optimization. J. Optim. Theory Appli., 102: 385–409 (1999)
Sun, X. L., Li, D. Asymptotic strong duality for bounded integer programming: a logarithmic-exponential dual formulation. Math. Oper. Res., 25(4): 625–644 (2000)
Author information
Authors and Affiliations
Corresponding author
Additional information
Partially supported by the National Science Foundation of China (No. 10271073)
Rights and permissions
About this article
Cite this article
Bai, Fs., Wu, Z.Y. & Zhang, L.S. Exact Penalty Function and Asymptotic Strong Nonlinear Duality in Integer Programming. Acta Mathematicae Applicatae Sinica, English Series 20, 45–52 (2004). https://doi.org/10.1007/s10255-004-0147-1
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s10255-004-0147-1