Skip to main content
Have a personal or library account? Click to login
Karush-Kuhn-Tucker Necessary Optimality Conditions for (h, φ)ɛ-Multiobjective Optimization Problems Based on Pseudo-Avriel-Ben-Tal Algebraic Operations Cover

Karush-Kuhn-Tucker Necessary Optimality Conditions for (h, φ)ɛ-Multiobjective Optimization Problems Based on Pseudo-Avriel-Ben-Tal Algebraic Operations

Open Access
|May 2026

References

  1. B. Aghezzaf i M. Hachimi: Su ciency and duality in multiobjective programming involving generalized (F, ρ)-convexity, J. Math. Anal. Appl., 258 (2001), 617–628.
  2. J.P. Aubin i H. Frankowska: Set-Valued Analysis, Birkhäuser, Boston, 1990.
  3. M. Avriel: Nonlinear Programming: Analysis and Method, Prentice-Hall, Englewood Cli s, NJ, 1976.
  4. M.S. Bazaraa i C.M. Shetty: Nonlinear Programming: Theory and Algorithms, John Wiley & Sons, New York, 1979.
  5. A. Ben-Tal: On generalized means and generalized convex functions, J. Optim. Theory Appl., 21 (1977), 1–13.
  6. V. Cornaciu: Some optimality necessary conditions for optimization problems based on Pseudo-Avriel-Ben-Tal algebraic operations, Int. J. Risk Theory, 6(2) (2016), 19–36.
  7. V. Cornaciu i I. Ileana: The Avriel-Ben-Tal algebraic operations approach for a short version proof of the Karush-Kuhn-Tucker optimality conditions, An. t. Univ. Ovidius Constana Ser. Mat., 25(2) (2017).
  8. A. Fog: Chaotic Random Number Generators with Random Cycle Lengths, 2001, disponibil online la: http://www.agner.org/random/theory
  9. M.A. Hanson: Invexity and the Kuhn-Tucker theorem, J. Math. Anal. Appl., 236 (1999), 594–604.
  10. S.K. Mishra: On multiple-objective optimization with generalized uninvexity, J. Math. Anal. Appl., 224 (1998), 131–148.
  11. E. Pap i D. Vivona: Non-commutative and non-associative pseudo-analysis and its applications in nonlinear partial differential equations, J. Math. Anal. Appl., 246(2) (2000), 390–408.
  12. V. Preda, I.M. Stancu-Minasian i E. Koller: On optimality and duality for multiobjective programming problems involving generalized d-type-I and related n-set functions, J. Math. Anal. Appl., 283(1) (2003), 114–128.
  13. V. Preda, I. Stancu-Minasian, M. Beldiman i A.M. Stancu: Optimality and duality for multiobjective programming with generalized V-type I univexity and related n-set functions, Proc. Rom. Acad. Ser. A, 6(3) (2005), 183–191.
  14. V. Preda, I. Stancu-Minasian, M. Beldiman i A.M. Stancu: Generalized V-univexity type-I for multiobjective programming with n-set functions, J. Glob. Optim., 44(1) (2009), 131–148.
  15. V. Preda: On efficiency and duality for multi-objective programs, J. Math. Anal. Appl., 166(8) (1992), 365–377.
  16. V. Preda: Some optimality conditions for multiobjective programming problems with set functions, Rev. Roum. Math. Pures Appl., 39(3) (1994), 233–248.
  17. V. Preda i D.E. Stanciu: New sufficient conditions for B-preinvexity and some extensions, Proc. Rom. Acad. Ser. A, 12(3) (2011), 197–202.
  18. V. Preda i M. Beldiman: Optimality and duality for multiobjective programming involving n-set functions, Rev. Roum. Math. Pures Appl., 50(3) (2005), 301–314.
  19. V. Preda i S. Gramatovici: Some sufficient optimality conditions for a class of multiobjective variational problems, An. Univ. Bucureti, Mat.-Inform., 61(1) (2002), 33–43.
  20. V. Preda i A. Batatorescu: On duality for minmax generalized B-vex programming involving n-set functions, J. Convex Anal., 9(2) (2002), 609–623.
  21. V. Preda i I.M. Stancu-Minasian: Optimality and Wolfe duality for multiobjective programming problems involving n-set functions, în: Generalized Convexity and Generalized Monotonicity, Springer, 2001, 349–361.
  22. A. Rukhin et al.: A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications, NIST SP 800-22 Rev. 1a, National Institute of Standards and Technology, Gaithersburg, 2010, disponibil online la: https://csrc.nist.gov/publications/detail/sp/800-22/rev-1a/final
  23. P.H. Sach, G.M. Lee i D.S. Kim: E ciency and generalized convexity in vector optimization problems, ANZIAM J., 45 (2004), 523–546.
  24. P.H. Sach, S.D. Kim i G.M. Lee: Invexity as necessary optimality condition in nonsmooth programs, J. Korean Math. Soc., 43(2) (2006), 241–258.
  25. S.K. Suneja, S. Aggarwal i S. Davar: Generalized connected functions with respect to cones, J. Optim. Theory Appl., 106 (2000), 399–410.
  26. A. Taa: Optimality conditions for vector mathematical programming via a theorem of alternative, J. Math. Anal. Appl., 233 (1999), 233–245.
  27. L. Venkateswara Reddy i R.N. Mukherjee: Some results on mathematical programming with generalized ratio invexity, J. Math. Anal. Appl., 240 (1999), 299–310.
  28. Y. Xu i S. Liu: Kuhn-Tucker necessary conditions for (h, ϕ)-multiobjective optimization problems, J. Syst. Sci. Complex., 17(1) (2004), 122–134.
DOI: https://doi.org/10.2478/auom-2026-0003 | Journal eISSN: 1844-0835 | Journal ISSN: 1224-1784
Language: English
Page range: 53 - 76
Submitted on: Jun 17, 2025
Accepted on: Jul 8, 2025
Published on: May 15, 2026
In partnership with: Paradigm Publishing Services
Publication frequency: 3 issues per year

© 2026 Alexandru Bobe, Ciprian Răcuciu, Veronica Cornaciu, published by Ovidius University of Constanta
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.