Abstract

We consider a minmax programming problem involving several generalized B-vex n-set functions. Some optimality results and Wolfe type duality theorems are given. As a special case, an n-set generalized minmax fractional programming problem is considered

Author information

Contact details are reproduced from the original publication and may be historical.

Vasile Preda

Faculty of Mathematics, University of Bucharest, Str. Academiei nr. 14, 70109 Bucharest, Romania

Anton Bătătorescu

Faculty of Mathematics, University of Bucharest, Str. Academiei nr. 14, 70109 Bucharest, Romania

References

  1. C. R. Bector: Duality in nonlinear fractional programming, Z. Oper. Res. 17 (1973) 183–193.https://doi.org/10.1007/BF01951417Google Scholar
  2. C. R. Bector, S. Chandra, M. K. Bector: Generalized fractional programming duality: a parametric approach, J. Optim. Theory Appl. 60 (1989) 243–260.https://doi.org/10.1007/BF00940006Google Scholar
  3. C. R. Bector, C. Singh: B-vex functions, J. Optim. Theory Appl. 71 (1991) 237–253.https://doi.org/10.1007/BF00939919Google Scholar
  4. C. R. Bector, S. K. Suneja, C. S. Lalitha: Generalized B-vex functions and generalized B-vex programming, J. Optim. Theory Appl. 76 (1993) 561–576.https://doi.org/10.1007/BF00939383Google Scholar
  5. C. R. Bector, M. Singh: Nonlinear multiobjective duality involving B-vex n-set functions, J. Math. Anal. Appl. 202 (1996) 701–726.https://doi.org/10.1006/jmaa.1996.0343Google Scholar
  6. C. R. Bector: Duality in nondifferentiable generalized fractional programming involving n-set functions, Utilitas Math. 45 (1994) 91–96.Google Scholar
  7. C. R. Bector, M. Singh: Duality for minmax B-vex programming involving n-set functions, J. Math. Anal. Appl. 215 (1997) 112–131.https://doi.org/10.1006/jmaa.1997.5624Google Scholar
  8. C. R. Bector, D. Bhatia, S. Pandey: Duality for multiobjective fractional programming involving n-set functions, J. Math. Anal. Appl. 186 (1994) 747–768.https://doi.org/10.1006/jmaa.1994.1331Google Scholar
  9. D. Begis, R. Glowinski: Application de la méthode des elements fini a l’approximation d’un problème de domaine optimal. Méthodes de résolution de problèmes approchés, Applied Math. Optim. 2 (1975) 130–169.https://doi.org/10.1007/BF01447854Google Scholar
  10. S. Chandra, B. D. Craven, B. Mond: Generalized fractional programming duality: a ratio game approach, J. Austral. Math. Soc., Ser. B 28 (1986) 170–180.https://doi.org/10.1017/S0334270000005282Google Scholar
  11. S. Chandra, B. D. Craven, B. Mond: Vector-valued Lagrangian and multiobjective fractional programming duality, Numer. Funct. Anal. Optim. 11 (1990) 239–254.https://doi.org/10.1080/01630569008816373Google Scholar
  12. J. Cea, A. Gioan, J. Michel: Quelque resultats sur l’identification de domaines, Calcolo 10 (1973) 133–145.https://doi.org/10.1007/BF02575843Google Scholar
  13. J. H. Chou, W. S. Hsia, T. Y. Lee: On multiple objective programming problems with set functions, J. Math. Anal. Appl. 15 (1985) 333–394.https://doi.org/10.1016/0022-247X(85)90055-1Google Scholar
  14. H. W. Corley, S. D. Roberts: Duality relationships for a partitioning problem, SIAM J. Appl. Math. 23 (1972) 490–494.https://doi.org/10.1137/0123052Google Scholar
  15. H. W. Corley, S. D. Roberts: A partitioning problem with applications in regional design, Operations Res. 20 (1982) 1010–1019.https://doi.org/10.1287/opre.20.5.1010Google Scholar
  16. H. W. Corley: Optimization theory for n-set functions, J. Math. Anal. Appl. 127 (1987) 193–205.https://doi.org/10.1016/0022-247X(87)90151-XGoogle Scholar
  17. G. Dantzig: A. Wald, On the fundamental lemma of Neyman and Pearson, Ann. Math. Stat. 22 (1951) 87–93.https://doi.org/10.1214/aoms/1177729695Google Scholar
  18. V. Jeyakumar, B. Mond: On generalized convex mathematical programming, J. Austral. Math. Soc., Ser. B 34 (1992) 43–53.https://doi.org/10.1017/S0334270000007372Google Scholar
  19. H. C. Lai, S. S. Yang, G. R. Hwang: Duality in mathematical programming of set functions: on Fenchel duality theorem, J. Math. Anal. Appl. 95(1) (1983) 223–234.https://doi.org/10.1016/0022-247X(83)90145-2Google Scholar
  20. B. Lemaire, M. Volle: A general duality scheme for nonconvex minimization problems with a strict inequality constraint, J. Global Optimization 13 (1998) 317–327.https://doi.org/10.1023/A:1008285930026Google Scholar
  21. O. L. Mangasarian: Nonlinear Programming, McGraw-Hill, New York (1969).Google Scholar
  22. P. Mazzoleni: On constrained optimization for convex set functions, in: Survey of Mathematical Programming, Vol. 1, A. Prekopa (ed.), North-Holland, Amsterdam (1979) 273–290.Google Scholar
  23. R. J. T. Morris: Optimal constrained selection of a measurable subset, J. Math. Anal. Appl. 70 (1979) 546–562.https://doi.org/10.1016/0022-247X(79)90064-7Google Scholar
  24. J. Neyman, E. S. Pearson: On the problem of the most efficient tests of statistical hypotheses, Philos. Trans. Roy. Soc. London, Ser. A 231 (1933) 289–337.https://doi.org/10.1098/rsta.1933.0009Google Scholar
  25. V. Preda: Duality for multiobjective fractional programming problems involving n-set functions, in: Analysis and Topology, C. Andreian Cazacu, W. E. Lehto, T. M. Rassias (eds.) (1998) 569–583.https://doi.org/10.1142/9789812817297_0033Google Scholar
  26. V. Preda: Some optimality conditions for multiobjective programming problems with set functions, Rev. Roumaine Math. Pures Appl. 39(3) (1994) 233–247.Google Scholar
  27. V. Preda: On minmax programming problems containing n-set functions, Optimization 22(4) (1991) 527–537.https://doi.org/10.1080/02331939108843695Google Scholar
  28. V. Preda, I. M. Stancu-Minasian: On duality for multiobjective mathematical programming of n-set functions, Report no. 85, Pisa, Italy (1994).Google Scholar
  29. V. Preda: On duality of multiobjective fractional measurable subsets selection problems, J. Math. Anal. Appl. 196 (1995) 514–525.https://doi.org/10.1006/jmaa.1995.1423Google Scholar
  30. V. Preda: Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions, Optimization 36(3) (1996) 219–230.https://doi.org/10.1080/02331939608844179Google Scholar
  31. P. H. Sach, J. P. Penot: Characterizations of generalized convexities via generalized directional derivatives, Numer. Funct. Anal. Optimization 19(5-6) (1998) 615–634.https://doi.org/10.1080/01630569808816849Google Scholar
  32. P. K. C. Wang: On a class of optimization problems involving domain variations, in: Lecture Notes in Control and Information Sciences 2, Springer Verlag, Berlin (1977) 49–60.https://doi.org/10.1007/BFb0041105Google Scholar
  33. G. J. Zalmai: Sufficiency criteria and duality for nonlinear programs involving n-set functions, J. Math. Anal. Appl. 149 (1990) 322–338.https://doi.org/10.1016/0022-247X(90)90045-HGoogle Scholar

Suggested citation

V. Preda, A. Bătătorescu. “On Duality for Minmax Generalized B-vex Programming Involving n-Set Functions.” Journal of Convex Analysis 9 (2002), No. 2, 609–623. https://doi.org/10.68381/jca09036

Download BibTeXPublished by Heldermann Verlag.

Published by Heldermann Verlag, 2002. Rights now held by Banach Press LLC.