Skip to main content
SpringerLink
Log in

Constrained ∈-Vector Valued Games and Generalized Multi-Valued ∈-Minmax, ∈-Maxmin Programming

  • Theoretical Papers
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

In the present work we have studied the relationship between ∈-equili-brium point of a vector valued game and a ∈-saddle point of associated multiobjective programming problem. In the analysis, which follows, the technique of Liu for treating ∈-Pareto optimality for multiobjective programming problems has been exploited. The results obtained extend the work of Singh and Rueda in the context of vector-valued games.

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. CHANDRA, S. and DURGA PRASAD, M.V.: Constrained vector valued games and multiobjective programming, Opsearch, 29 (1992), 1–10.

    Google Scholar 

  2. CORELY, H.W.: Games with vector Payoffs. Jr. of Opti. Theory and Appl. 47 (1985), 891–1498.

    Google Scholar 

  3. COTTLE, R.W.: An infinite game with convex-concave Payoff Kernel (1963), Research Report No. ORC 63-19 (RN-2), Operations Research Center, University of California, Berkeley.

    Google Scholar 

  4. JAIN and BHATIA, D. Generalized saddle points in multiobjective bilinear programming, opsearch 23 (1986) 142–150.

    Google Scholar 

  5. KANNIAPPAN, P.: Necessary conditions for optimality of nondifferentiable convex multiobjective programming. Jr. of Opti. Theory and Appl. 40 (1983), 167–174.

    Article  Google Scholar 

  6. LIU, J.C.: e-Pareto optimality for nondifferentiable multiobjective programming via penalty function, Jr. of Math. Anal. Appl. 198 (1986), 248–261.

    Article  Google Scholar 

  7. KAWAGUCHI, T. and MAR U YAM A, Y.: A note on minimax (max-min) Programming, Management Science, 22 (1976), 670–676.

    Google Scholar 

  8. MOND, B. and CHANDRA, S. and DURGA PRASAD, M.V.: Constrained games and symmetric duality, Oppsearch 24 (1987), 69–77.

    Google Scholar 

  9. RODDER, W.: A generalized saddle point theory, European Jr. of Oeara. Research, 1 (1977), 55–59.

    Article  Google Scholar 

  10. SCHECHTER, M.: More on subgradient duality, Jr. of Math. Anal, and Appl. 71 (1979), 251–262.

    Article  Google Scholar 

  11. SINGH, C.: Optimality conditions in multiobjective differentiable programming, Jr. Op Optimi. Theory and Appl. 53 (1987), 115–123.

    Article  Google Scholar 

  12. SINGH, C. and RUEDA, N.: Constrained vector valued games and generalized multi-objective min max programming, OPSEARCH, 31 (2) (1994), 144–154.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of applied Mathematics, Institute of Technology Banaras Hindu University, Varanasi, 221 005, India

    L. V. Reddy & R. N. Mukerjee

Authors
  1. L. V. Reddy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. N. Mukerjee
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Reddy, L.V., Mukerjee, R.N. Constrained ∈-Vector Valued Games and Generalized Multi-Valued ∈-Minmax, ∈-Maxmin Programming. OPSEARCH 36, 124–136 (1999). https://doi.org/10.1007/BF03398568

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03398568

Search

Navigation