Skip to main content
SpringerLink
Log in

Optimality conditions for multiple objective fractional subset programming with (ρ,σ,θ)-type-I and related non-convex functions

  • Published:
Calcolo Aims and scope Submit manuscript

Abstract

In this paper, we introduce a class of generalized invex n-set functions, called (ρ,σ,θ)-type-I and related non-convex functions, and then establish a number of parametric and semi-parametric sufficient optimality conditions for the primal problem under the aforesaid assumptions. This work partially extends an earlier work of Mishra et al. (Math. Methods Oper. Res. 67, 493–504, 2008) to a wider class of 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. Chou, J.H., Hsia, W.S., Lee, T.Y.: On multiple objective programming problems with set functions. J. Math. Anal. Appl. 105, 383–394 (1985)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Craven, B.D.: Invex functions and constrained local minima. Bull. Aust. Math. Soc. 24, 357–366 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  4. Dinkelbach, W.: On nonlinear fractional programming. Manag. Sci. 13, 492–498 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  5. Hanson, M.A.: On sufficiency of the Kuhn-Tucker conditions. J. Math. Anal. Appl. 80, 545–550 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hanson, M.A., Mond, B.: Further generalization of convexity in mathematical programming. J. Inf. Optim. Sci. 3, 25–32 (1982)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Hanson, M.A., Pini, R., Singh, C.: Multiobjective programming under generalized type I invexity. J. Math. Anal. Appl. 261, 562–577 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hsia, W.S., Lee, Y.T.: Proper D-solutions of multiobjective programming problems with set functions. J. Optim. Theory Appl. 53, 247–258 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hsia, W.S., Lee, Y.T.: Lagrangian function and duality theory in multiobjective programming with set functions. J. Optim. Theory Appl. 57, 239–251 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hsia, W.S., Lee, Y.T., Lee, J.Y.: Lagrange multiplier theorem of multiobjective programming problems with set functions. J. Optim. Theory Appl. 70, 137–155 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  12. Jeyakumar, V.: Strong and weak invexity in mathematical programming. Math. Methods Oper. Res. 55, 109–125 (1985)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  16. Kim, D.S., Lee, G.M., Jo, C.L.: Duality theorems for multiobjective fractional minimization problems involving set functions. SEA Bull. Math. 20, 65–72 (1996)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  18. Lai, H.C., Lin, L.J.: Optimality for set functions with values in ordered vector spaces. J. Optim. Theory Appl. 63, 371–389 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  19. Lai, H.C., Huang, T.Y.: Minimax fractional programming for n-set functions and mixed-type duality under generalized invexity. J. Optim. Theory Appl. 139, 295–313 (2008)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  21. Lin, L.J.: Duality theorems of vector-valued n-set functions. Comput. Math. Appl. 21, 165–175 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  22. Lin, L.J.: On the optimality conditions of vector-valued n-set functions. J. Math. Anal. Appl. 161, 367–387 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  23. Lin, L.J.: On the optimality of differentiable nonconvex n-set functions. J. Math. Anal. Appl. 168, 351–366 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  24. Mazzoleni, P.: On constrained optimization for convex set functions. In: Prekop, A. (ed.) Survey of Mathematical Programming, vol. 1, pp. 273–290. North-Holland, Amsterdam (1979)

    Google Scholar 

  25. Mishra, S.K.: V-invex functions and applications to multiobjective programming, Ph.D. thesis, Institute of Technology, Banaras Hindu University, Varanasi, India (1995)

  26. Mishra, S.K.: On multiple-objective optimization with generalized univexity. J. Math. Anal. Appl. 224, 131–148 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  27. Mishra, S.K., Wang, S.Y., Lai, K.K.: Optimality conditions for multiple objective fractional subset programming with (F, ρ, σ, θ)-V-type-I and related non-convex functions. Math. Comput. Model. 48, 1201–1212 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  28. Mishra, S.K., Wang, S.Y., Lai, K.K.: Optimality and duality for a nonsmooth multiobjective optimization involving generalized type I functions. Math. Methods Oper. Res. 67, 493–504 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  29. Mishra, S.K., Jaiswal, M., Pankaj: Optimality conditions for multiple objective fractional subset programming with invex and related non-convex functions. Commun. Appl. Nonlinear Anal. 17(3), 89–101 (2010)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  31. Pini, R., Singh, C.: A survey of recent [1985–1995] advances in generalized convexity with applications to duality theory and optimality conditions. Optimization 39, 311–360 (1997)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  33. Preda, V.: On duality of multiobjective fractional measurable subset selection problems. J. Math. Anal. Appl. 196, 514–525 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  34. Preda, V., Stancu-Minasian, I.M.: Mond-Weir duality for multiobjective mathematical programming with n-set functions. An. Univ. Bucur., Mat.-Inform. 46, 89–97 (1997)

    MathSciNet  Google Scholar 

  35. Preda, V., Stancu-Minasian, I.M.: Mond-Weir duality for multiobjective mathematical programming with n-set functions. Rev. Roum. Math. Pures Appl. 44, 629–644 (1999)

    MathSciNet  MATH  Google Scholar 

  36. Preda, V., Stancu-Minasian, I.M.: Optimality and Wolfe duality for multiobjective programming problems involving n-set functions. In: Hadjisavvas, N., Martinez-Legaz, J.-E., Penot, J.-P. (eds.) Generalized Convexity and Generalized Monotonicity, pp. 349–361. Springer, Berlin (2001)

    Chapter  Google Scholar 

  37. Rosenmuller, J., Weidner, H.G.: Extreme convex set functions with finite carries: general theory. Discrete Math. 10, 343–382 (1974)

    Article  MathSciNet  Google Scholar 

  38. Tanaka, K., Maruyama, Y.: The multiobjective optimization problems of set functions. J. Inf. Optim. Sci. 5, 293–306 (1984)

    MathSciNet  MATH  Google Scholar 

  39. Ye, Y.L.: D-invexity and optimality conditions. J. Math. Anal. Appl. 162, 242–249 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  40. Zalmai, G.J.: Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions. Optimization 20, 377–395 (1989)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  42. Zalmai, G.J.: Semiparametric sufficient efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized (F, ρ, θ)-convex functions. SEA Bull. Math. 25, 529–563 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  43. Zalmai, G.J.: Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized (F, α, ρ, θ)-V-convex functions. Comput. Math. Appl. 43, 1489–1520 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors are thankful to the referees for many valuable comments and helpful suggestions that helped to improve the paper in its present form.

Author information

Authors and Affiliations

  1. DST-Centre for Interdisciplinary Mathematical Sciences, Department of Mathematics, Faculty of Science, Banaras Hindu University, Varanasi, India

    S. K. Mishra & M. Jaiswal

  2. Mahila Maha Vidhyalaya, Banaras Hindu University, Varanasi, India

    Pankaj

Authors
  1. S. K. Mishra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Jaiswal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pankaj
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. K. Mishra.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mishra, S.K., Jaiswal, M. & Pankaj Optimality conditions for multiple objective fractional subset programming with (ρ,σ,θ)-type-I and related non-convex functions. Calcolo 49, 177–192 (2012). https://doi.org/10.1007/s10092-011-0050-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10092-011-0050-0

Keywords

Mathematics Subject Classification (2000)

Search

Navigation