Skip to main content
SpringerLink
Log in

Sufficiency in multiobjective subset programming involving generalized type-I functions

  • Original Paper
  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In this paper, sufficient optimality conditions for a multiobjective subset programming problem are established under generalized \((\mathcal{F}, \alpha, \rho, d)\)-type-I functions.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bector C.R., Bhatia D. and Pandey S. (1994). Efficiency and duality for nonlinear multiobjective programs involving n-set functions. J. Math. Anal. Appl. 182: 486–500

    Article  Google Scholar 

  2. Bector C.R., Bhatia D. and Pandey S. (1994). Duality for multiobjective fractional programming involving n-set functions. J. Math. Anal. Appl. 186: 747–768

    Article  Google Scholar 

  3. Bector C.R. and Singh M. (1997). Duality for minmax b-vex programming involving n-set functions. J. Math. Anal. Appl. 215: 112–131

    Article  Google Scholar 

  4. Begis D. and Glowinski R. (1975). Application de la méthode des éléments fini á l’approximation d’une probléme de domaine optimal, Méthodes de résolution de problémes approchés. Appl. Math. Optim. 2: 130–169

    Article  Google Scholar 

  5. Bhatia D. and Kumar P. (1997). A note on fractional minmax programs containing n-set functions. J. Math. Anal. Appl. 215: 283–293

    Article  Google Scholar 

  6. Bhatia D. and Mehra A. (1999). Lagrange duality in multiobjective fractional programming problems with n-set functions. J. Math. Anal. Appl. 236: 300–311

    Article  Google Scholar 

  7. Cea J., Gioan A. and Michel J. (1973). Quelque résultats sur l’identification de domaines. Calcolo 10: 133–145

    Article  Google Scholar 

  8. Chou J.H., Hsia W.S. and Lee T.Y. (1985). On multiple objective programming problems with set functions. J. Math. Anal. Appl. 105: 383–394

    Article  Google Scholar 

  9. Corley H.W. (1987). Optimization theory for n-set functions. J. Math. Anal. Appl. 127: 193–205

    Article  Google Scholar 

  10. Corley H.W. and Roberts S.D. (1972). A partitioning problem with applicationas in regional design. Oper. Res. 20: 1010–1019

    Article  Google Scholar 

  11. Corley H.W. and Roberts S.D. (1972). Duality relationships for a partitioning problem. SIAM J. Appl. Math. 23: 490–494

    Article  Google Scholar 

  12. Dantzig G. and Wald A. (1951). On the fundamental lemma of Neyman and Pearson. Ann. Math. Stat. 22: 87–93

    Google Scholar 

  13. Geoffrion A.M. (1968). Proper efficiency and the theory of vector maximization. J. Math. Anal. Appl. 22: 618–630

    Article  Google Scholar 

  14. Hachimi M. and Aghezzaf B. (2004). Sufficiency and duality in differentiable multiobjective programming involving generalized type-I functions. J. Math. Anal. Appl. 296: 382–392

    Article  Google Scholar 

  15. Hanson M.A. and Mond B. (1987). Necessary and sufficient conditions in constrained optimization. Math. Program. 37: 51–58

    Article  Google Scholar 

  16. Jo C.L., Kim D.S. and Lee G.M. (1994). Duality for multiobjective fractional programming involving n-set functions. Optimization 29: 45–54

    Article  Google Scholar 

  17. Kaul R.N., Suneja S.K. and Srivastava M.K. (1994). Optimality criteria and duality in multiobjective optimization involving generalized invexity. J. Optim. Theory Appl. 80: 465–482

    Article  Google Scholar 

  18. Kim D.S., Jo C.L. and Lee G.M. (1998). Optimality and duality for multiobjective fractional programming involving n-set functions. J. Math. Anal. Appl. 224: 1–13

    Article  Google Scholar 

  19. Lai H.C. and Liu J.C. (1999). Duality for a minmax programming problem containing n-set functions. J. Math. Anal. Appl. 229: 587–604

    Article  Google Scholar 

  20. Liang Z.A., Huang H.X. and Pardalos P.M. (2001). Optimality conditions and duality for a class of nonlinear fractional programming problems. J. Optim. Theory Appl. 110(3): 611–619

    Article  Google Scholar 

  21. Liang Z.A., Huang H.X. and Pardalos P.M. (2003). Efficiency conditions and duality for a class of multiobjective fractional programming problems. J. Glob. Optim. 27: 447–471

    Article  Google Scholar 

  22. Lin L.J. (1990). Optimality of differentiable vector-valued n-set functions. J. Math. Anal. Appl. 149: 255–270

    Article  Google Scholar 

  23. Mishra S.K. (2006) Duality for multiple objective fractional subset programming with generalized \((\mathcal{F}, \rho, \sigma, \theta)\)-V-type-I functions. J. Glob. Optim. 36:499–516

    Google Scholar 

  24. Morris R.J.T. (1979). Optimal constrained selection of a measurable set. J. Math. Anal. Appl. 70: 546–562

    Article  Google Scholar 

  25. Neyman J. and Pearson E.S. (1933). On the problem of the most efficient tests of statistical hypotheses. Philos. Trans. R. Soc. Lond. Ser. A 231: 289–337

    Article  Google Scholar 

  26. Preda V. (1991). On minmax programming problems containing n-set functions. Optimization 22: 527–537

    Article  Google Scholar 

  27. Preda V., Stancu-Minasian I.M. and Koller E. (2003). On optimality and duality for multiobjective programming problems involving generalized d-type-I and related n-set functions. J. Math. Anal. Appl. 283: 114–128

    Article  Google Scholar 

  28. Wang, P.K.C.: On a class of optimization problems involving domain variations. In: Lecture Notes in Control and Information Sciences 2. Springer, Berlin (1977)

  29. Zalmai G.J. (1991). Optimality conditions and duality for multiobjective measurable subset selection problems. Optimization 22(2): 221–238

    Article  Google Scholar 

  30. Zalmai G.J. (1990). Sufficiency criteria and duality for nonlinear programs involving n-set functions. J. Math. Anal. Appl. 149: 322–338

    Article  Google Scholar 

  31. Zalmai G.J. (2002) Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \((\mathcal{F}, \alpha, \rho, \theta)\)-V-convex functions. Comput. Math. Appl. 43(12):1489–1520

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Aligarh Muslim University, Aligarh, UP, 202 002, India

    Izhar Ahmad & Sarita Sharma

Authors
  1. Izhar Ahmad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sarita Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Izhar Ahmad.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ahmad, I., Sharma, S. Sufficiency in multiobjective subset programming involving generalized type-I functions. J Glob Optim 39, 473–481 (2007). https://doi.org/10.1007/s10898-007-9150-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-007-9150-4

Keywords

Search

Navigation