https://orcid.org/0000-0001-7736-2059
References
- Bernard JC, Ferland JA. Algorithms for generalized fractional programming. Math Program. 1991;52:191–207. doi: 10.1007/BF01582887
- Kuk H, Lee GM, Tanino T. Optimality and duality for nonsmooth multiobjective fractional programming with generalized invexity 1. J Math Anal Appl. 2001;262:365–375. doi: 10.1006/jmaa.2001.7586
- Niculescu C. Optimality and duality in multiobjective fractional programming involving ρ-semilocally type I-preinvex and related functions. J Math Anal Appl. 2007;335(1):7–19. doi: 10.1016/j.jmaa.2006.12.084
- Nobakhtian S. Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints. J Glob Optim. 2008;41(1):103–115. doi: 10.1007/s10898-007-9168-7
- Santos LB, Osuna-Gómez R, Rojas-Medar MA. Multiobjective fractional programming with generalized convexity. Rev Integr Esc Matemáticas Univ [Internet]. 2008;26(1):1–12. DOI:10.1007/BF02564830.
- Hanson MA. On sufficiency of the Kuhn-Tucker conditions. J Math Anal Appl. 1981;80:545–550. doi: 10.1016/0022-247X(81)90123-2
- Craven D. Invex functions and constrained local minima. Bull Austral Math Soc. 1981;24:357–356. doi: 10.1017/S0004972700004895
- Zangwill WI. Nonlinear programming via penalty functions. Manage Sci [Internet]. 1967;13(5):344–358. Available from: http://www.epjap.org/10.1051/epjap/2012110475.
- Eremin II. The penalty method in convex programming. Kibernetika. 1967;3(4):63–67.
- Antczak T. The L1 penalty function method for nonconvex differentiable optimization problems with inequality constraints. Asia-Pacific J Oper Res [Internet]. 2010;27(05):559–576. Available from: http://www.worldscientific.com/doi/abs/10.1142/S0217595910002855.
- Antczak T. A modified objective function method for solving nonlinear multiobjective fractional programming problems. J Math Anal Appl. 2006;322(2):971–989. doi: 10.1016/j.jmaa.2005.08.098
- Jayswal A, Choudhury S. Convergence of exponential penalty function method for multiobjective fractional programming problems. Ain Shams Eng J. 2014;5(4):1371–6. DOI:10.1016/j.asej.2014.07.008.
- Liu S, Feng E. The exponential penalty function method for multiobjective programming problems. Optim Methods Softw. 2010;25(5):667–675. doi: 10.1080/10556780903049959
- Hassan M, Baharum A. A new logarithmic penalty function approach for nonlinear constrained optimization problem. Decis Sci Lett [Internet]. 2019;8(3):353–362. DOI:10.5267/j.dsl.2018.8.004.
- Antczak T. Exact penalty functions method for mathematical programming problems involving invex functions. Eur J Oper Res. 2009;198(1):29–36. DOI:10.1016/j.ejor.2008.07.031.
- Antczak T. Penalty function methods and a duality gap for invex optimization problems. Nonlinear Anal Theory Methods Appl. 2009;71(7–8):3322–32. DOI:10.1016/j.na.2009.01.233.
- Goberna MA, Guerra-Vazquez F, Todorov MI. Constraint qualifications in convex vector semi-infinite optimization. Eur J Oper Res. 2016;249(1):32–40. DOI:10.1016/j.ejor.2015.08.062.