Skip to main content

Vector Invex N-set Functions and Minmax Programming

  • Chapter
Generalized Convexity and Generalized Monotonicity

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 502))

Abstract

Vector invexity and generalized vector invexity for n-set functions is introduced which is then utilized to establish sufficient optimality and duality results for a class of minmax programming problems involving n-set functions. Applications of these results to fractional programming problems are also presented.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.J. Ashton and D.R. Atkins, ‘Multicriteria programming for financial Planning’, J. Op. Res. Soc., 30 (1979) 259–270.

    Google Scholar 

  2. I. Barrodale, ‘Best Rational Approximation and Strict Qusiinvexity’, SIAM J. Numer. Anal., 10 (1973), 8–12.

    Article  Google Scholar 

  3. I. Barrodale, M.J.D. Powell and F.D.K. Roberts, ‘The Differential Correction Algorithm for Rational l ∞ Approximation’, SIAM J. Numer. Anal. 9 (1972), 493–504.

    Article  Google Scholar 

  4. C.R. Bector, and S. Chandra, ‘Duality for Pseudolinear Minmax Programs’, Asia Pacific J. Op.Res., Vol.3, (1993) pp. 86–94.

    Google Scholar 

  5. C.R. Bector, S. Chandra and V. Kumar, ‘Duality for Minmax Programming Involving V-invex Functions’, Optimization, (Vol.30), (1994) pp. 93–103.

    Article  Google Scholar 

  6. D. Bhatia and P. Kumar, ‘A Note on Fractional Minmax Programs Containing n-Set Functions’, J. Math. Anal. Appl., Vol.215, (1997) pp. 283–292.

    Article  Google Scholar 

  7. A. Charnes and W.W. Cooper, Goal Programming and Multiobjective Optimization, European J. Op. Res. 1 (1977) 39–54.

    Article  Google Scholar 

  8. J.H. Chou, W.S. Hsia and T.Y. Lee, ‘On Multiple Objective Programming Problems with Set Functions’, J. Math. Anal. Appl. 105 (1985) 383–394.

    Article  Google Scholar 

  9. H.W. Corley, ‘Optimization Theory for n-set Functions’, J. Math. Anal. Appl., 127 (1987), 193–205.

    Article  Google Scholar 

  10. V.F. Damyanov and V.N. Malozemov, Introduction to Minmax Programming, Wiley, New York (1974).

    Google Scholar 

  11. W.S. Hsia and T.Y. Lee, Proper D Solution of Multi-objective Programming Problems with Set Functions, J. Opt. Th. Appl. 53 (1987) 247–258.

    Article  Google Scholar 

  12. V. Jeyakumar and B. Mond, ‘On Generalized Convex Mathematical Programming’, J. Aust. Math. Soc. (Ser.B), Vol.34, (1992) pp. 43–53.

    Article  Google Scholar 

  13. J.S.H. Korubluth, ‘A Survey of Goal Programming’, Omega 1 (1973) 193–205.

    Article  Google Scholar 

  14. H.C. Lai, S.S. Yang and G.R. Hwang, Duality in Mathematical Programming of Set Functions: On Fenchel Duality Theorem, J. Math. Anal. Appl., 95 (1983) 223–234.

    Article  Google Scholar 

  15. P. Mazzolenni, On Constrained Optimization for convex set Functions In: A PREKOPA (Ed.) Survey of Mathematical Programming, Vol.1, North Holland, Amsterdam, New York, 1979, 273–290.

    Google Scholar 

  16. B. Mond and T. Weir, Generalized Concavity and Duality, in Generalized Cin-cavity in Optimization and Economics (Eds.) S. Schiable and W. Ziemba, Academic Press, New Delhi (1981).

    Google Scholar 

  17. R.J.T. Morris, ‘Optimal Constrained Selection of a Measurable Subset’, J. Math. Anal. Appl. 70 (1979) 546–562.

    Article  Google Scholar 

  18. J. Rosenmuller, ‘Some Properties of Convex Set Functions’, Arch. Math. 22 (1971) 420–430.

    Article  Google Scholar 

  19. J. Rosenmuller and H.G. Weidner, ‘Extreme Convex Set Functions with finite Carries: General Theory’, Discrete Math. 10 (1974) 343–382.

    Article  Google Scholar 

  20. K. Tanaka and Y. Maruyama, ‘The Multiobjective optimization Problem of Set Functions’, J. Inform. Opt. Sci. 5 (1984) 293–306.

    Google Scholar 

  21. J. Von Neumann, ‘A Model of General Economics Equilibrium’,. Rev. Econ. Studies 13(1945) 1–9.

    Article  Google Scholar 

  22. T. Weir and B. Mond, ‘Sufficient Optimality Conditions and Duality for Pseudolinear Minmax Programs’, Cahiers du C.E.R.O., (1991), Vol.33, pp. 123–128.

    Google Scholar 

  23. G.J. Zalmai, ‘Optimality Conditions and Duality for Constrained Measurable Subset Selection Problem with Minmax Objective Functions’, Optimization, Vol.20, pp. 377–395 (1989).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bhatia, D., Kumar, P. (2001). Vector Invex N-set Functions and Minmax Programming. In: Hadjisavvas, N., Martínez-Legaz, J.E., Penot, JP. (eds) Generalized Convexity and Generalized Monotonicity. Lecture Notes in Economics and Mathematical Systems, vol 502. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56645-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-56645-5_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41806-1

  • Online ISBN: 978-3-642-56645-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics