Skip to main content

Advertisement

Log in

Generalized Fritz John optimality in nonlinear programming in the presence of equality and inequality constraints

  • Original Paper
  • Published:
Operational Research Aims and scope Submit manuscript

Abstract

In this paper, we study Fritz John type optimality conditions for constrained nonlinear programming in which equality and inequality constraints are together present. We introduce a generalized Fritz John condition which is necessary and sufficient for a feasible point to be an optimal solution under weak invexity. In particular, by combining the introduced generalized Fritz John condition with the invexity with respect to different functions, we obtain sufficient optimality conditions which extend and generalize various results in the literature, and their importance and usefulness are illustrated on examples .

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Ahmad I (2011) Efficiency and duality in nondifferentiable multiobjective programming involving directional derivative. Appl Math 2:452–460

    Article  Google Scholar 

  • Antczak T (2003) A class of \(B-(p, r)\)-invex functions and mathematical programming. J Math Anal Appl 286:187–206

    Article  Google Scholar 

  • Antczak T (2005) \(r\)-Preinvexity and \(r\)-invexity in mathematical programming. Comp Math Appl 50:551–566

    Article  Google Scholar 

  • Arana-Jiménez M, Ruiz-Garzón G, Osuna-Gómez R, Hernández-Jiménez B (2013) Duality and a characterization of pseudoinvexity for pareto and weak pareto solutions in nondifferentiable multiobjective programming. J Optim Theory Appl 156:266–277

    Article  Google Scholar 

  • Bazaraa MS, Sherali HD, Shetty CM (2006) Nonlinear programming: theory and algorithms, 3rd edn. Wiley, New York

    Book  Google Scholar 

  • Ben-Israel A, Mond B (1986) What is invexity? J Austral Math Soc Ser B 28:1–9

    Article  Google Scholar 

  • Bhatia D, Sharma A (2003) New-invexity type conditions with applications to constrained dynamic games. Eur J Oper Res 148:48–55

    Article  Google Scholar 

  • Bhatt SK, Misra SK (1975) Sufficient optimality criteria in non-linear programming in the presence of convex equality and inequality constraints. Z Oper Res 19:101–105

    Google Scholar 

  • Birbil SI, Frenk JBG, Still GJ (2007) An elementary proof of the Fritz-John and Karush–Kuhn–Tucker conditions in nonlinear programming. Eur J Oper Res 180:479–484

    Article  Google Scholar 

  • Cottle RW (1963) A theorem of Fritz John in mathematical programming. RAND Memorandum RM-3858-PR

  • Craven BD (1981) Invex functions and constrained local minima. Bull Austral Math Soc 24:357–366

    Article  Google Scholar 

  • Craven BD, Glover BM (1985) Invex functions and duality. J Austral Math Soc Ser A 39:1–20

    Article  Google Scholar 

  • Fiacco AV, McCormick GP (1968) Nonlinear programming: sequential unconstrained minimization techniques. Wiley, New York (reprinted. SIAM, Philadelphia, PA, 1990)

    Google Scholar 

  • Giorgi G (2011) Remarks on Fritz John conditions for problems with inequality and equality constraints. Int J Pure Appl Math 71(4):643–657

    Google Scholar 

  • Güler O (2010) Foundations of optimization. Graduate texts in mathematics, vol 258. Springer, Berlin. doi:10.1007/978-0-387-68407-9

  • Hanson MA (1981) On sufficiency of the Kuhn–Tuker conditions. J Math Anal Appl 80:445–550

    Article  Google Scholar 

  • Jeyakumar V, Mond B (1992) On generalized convex mathematical programming. J Austral Math Soc Ser B 34:43–53

    Article  Google Scholar 

  • John F (1948) Extremum problems with inequalities as side conditions. In: Friedrichs KO, Neugebauer OE, Stoker JJ (eds) Studies and essays, courant anniversary volume. Wiley, New York, pp 187–204

    Google Scholar 

  • Karush W (1939) Minima of functions of several variables with inequalities as side conditions. Dissertation, Department of Mathematics, University of Chicago

  • Kaul RN, Kaur S (1985) Optimality criteria in nonlinear programming involving nonconvex functions. J Math Anal Appl 105:104–112

    Article  Google Scholar 

  • Kaul RN, Suneja SK, Srivastava MK (1994) Optimality criteria and duality in multiple-objective optimization involving generalized invexity. J Optim Theory Appl 80(3):465–482

    Article  Google Scholar 

  • Kharbanda P, Agarwal D, Sinha D (2014) Nonsmooth multiobjective optimization involving generalized univex functions. OPSEARCH 51(1):130–147

    Article  Google Scholar 

  • Kharbanda P, Agarwal D, Sinha D (2014) Sufficiency and duality in nonsmooth multiobjective programming problem under generalized univex functions. ISRN Appl Math 2014(904640):11. doi:10.1155/2014/904640

    Google Scholar 

  • Kuhn HW, Tucker AW (1951) Nonlinear programming. In: Neyman J (ed) Proceedings of the second Berkeley symposium on mathematical statistics and probability. University of California Press, Berkeley, CA, pp 481–492

  • Mangasarian OL (1969) Nonlinear programming. McGraw-Hill, New York

    Google Scholar 

  • Mangasarian OL, Fromovitz S (1967) The Fritz John necessary optimality conditions in the presence of equality and inequality constraints. J Math Anal Appl 17:37–47

    Article  Google Scholar 

  • Martin DH (1985) The essence of invexity. J Optim Theory Appl 47:65–76

    Article  Google Scholar 

  • Martinez JM, Svaiter BF (2003) A practical optimality condition without constraint qualifications for nonlinear programming. J Optim Theory Appl 118(1):117–133

    Article  Google Scholar 

  • Martínez-Legaz JE (2009) What is invexity with respect to the same \(\eta\)? Taiwan J Math 13(2B):753–755

    Google Scholar 

  • Mishra SK, Giorgi G (2008) Invexity and optimization, nonconvex optimization and its applications, vol 88. Springer, Berlin

    Google Scholar 

  • Mishra SK, Pant RP, Rautela JS (2008) Duality in vector optimization under type I \(\alpha\)-invexity in banach spaces. Numer Funct Anal Optim 29:1128–1139

    Article  Google Scholar 

  • Mishra SK, Wang SY, Lai KK (2008) On non-smooth \(\alpha\)-invex functions and vector variational-like inequality. Opt Lett 02:91–98

    Article  Google Scholar 

  • Osuna-Gomez R, Beato-Morero A, Rufian-Lizana A (1999) Generalized convexity in multiobjective programming. J Math Anal Appl 233:205–220

    Article  Google Scholar 

  • Singh C (1977) Sufficient optimality criteria in nonlinear programming for generalized equality-inequality constraints. J Optim Theory Appl 22(4):631–635

    Article  Google Scholar 

  • Skarpness B, Sposito VA (1980) A modified Fritz John optimality criterion. J Optim Theory Appl 31(1):113–115

    Article  Google Scholar 

  • Slimani H, Mishra SK (2014) Multiobjective fractional programming involving generalized semilocally V-type I-preinvex and related functions. Int J Math Math Sci 2014(496149):12. doi:10.1155/2014/496149

    Google Scholar 

  • Slimani H, Radjef MS (2009) Duality for nonlinear programming under generalized Kuhn–Tucker condition. Int J Optim Theory Methods Appl 1(1):75–86

    Google Scholar 

  • Slimani H, Radjef MS (2010) Multiobjective programming under generalized invexity: optimality, duality, applications. LAP Lambert Academic Publishing, Saarbrücken

    Google Scholar 

  • Slimani H, Radjef MS (2010) Nondifferentiable multiobjective programming under generalized \(d_{{I}}\)-invexity. Eur J Oper Res 202:32–41

    Article  Google Scholar 

  • Slimani H, Radjef MS (2011) Fonctions invexes généralisées et optimisation vectorielle: optimalité, caractérisations, dualité et applications. Editions Universitaires Européennes, Saarbrücken

  • Slimani H, Radjef MS (2015) Fritz John type optimality and duality in nonlinear programming under weak pseudo-invexity. RAIRO Oper Res 49:451–472. doi:10.1051/ro/2014046

    Article  Google Scholar 

  • Stancu-Minasian IM (2006) Optimality and duality in nonlinear programming involving semilocally \(B\)-preinvex and related functions. Eur J Oper Res 173:47–58

    Article  Google Scholar 

  • Still G, Streng M (1996) Optimality conditions in smooth nonlinear programming. J Optim Theory Appl 90:483–515

    Article  Google Scholar 

  • Suneja SK, Khurana S, Vani (2008) Generalized nonsmooth invexity over cones in vector optimization. Eur J Oper Res 186:28–40

    Article  Google Scholar 

  • Zeng R, Caron RJ (2006) Generalized Motzkin theorems of the alternative and vector optimization problems. J Optim Theory Appl 131(2):281–299

    Article  Google Scholar 

Download references

Acknowledgments

The authors are grateful to the editor and to the anonymous referees for their valuable suggestions and comments which have helped to improve the quality of this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hachem Slimani.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Slimani, H., Radjef, MS. Generalized Fritz John optimality in nonlinear programming in the presence of equality and inequality constraints. Oper Res Int J 16, 349–364 (2016). https://doi.org/10.1007/s12351-015-0206-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12351-015-0206-9

Keywords

Mathematics Subject Classification

Navigation