Skip to main content
SpringerLink
Log in

ε-Mixed type duality for nonconvex multiobjective programs with an infinite number of constraints

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

Abstract

Using a scalarization method, approximate optimality conditions of a multiobjective nonconvex optimization problem which has an infinite number of constraints are established. Approximate duality theorems for mixed duality are given. Results on approximate duality in Wolfe type and Mond-Weir type are also derived. Approximate saddle point theorems of an approximate vector Lagrangian function are investigated.

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. Beldiman M., Panaitescu E., Dogaru L.: Approximate quasi efficient solutions in multiobjective optimization. Bull. Math. Soc. Sci. Math. Roumanie 51, 109–121 (2008)

    Google Scholar 

  2. Clarke F.H.: Optimization and Nonsmooth Analysis. Willey, New York (1983)

    Google Scholar 

  3. Clarke F.H., Stern J.S., Wolenski P.R.: Nonsmooth Analysis and Control Theory. Spinger, Berlin (1998)

    Google Scholar 

  4. Dinh N., Goberna M.A., Lopez M.A.: From linear to convex systems: consistency, Farkas lemma and applications. J. Convex Anal. 13, 113–133 (2006)

    Google Scholar 

  5. Dinh N., Goberna M.A., Lopez M.A., Son T.Q.: New Farkas-type constraint qualifications in convex infinite programming. ESAIM: Control Optim. Cal. Var. 13, 580–597 (2007)

    Article  Google Scholar 

  6. Dinh N., Mordukhovich B., Nghia T.T.A.: Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs. Math. Program. 123, 101–138 (2008)

    Article  Google Scholar 

  7. Dinh N., Mordukhovich B., Nghia T.T.A.: Qualification and optimality conditions for convex and DC programs with infinite constraints. Acta Math. Vietnam. 34, 125–155 (2009)

    Google Scholar 

  8. Dutta J.: Necessary optimality conditions and saddle points for approximate optimization in Banach spaces. TOP 13, 127–143 (2005)

    Article  Google Scholar 

  9. Engau A., Wiecek M.M.: Exact generation of \({\epsilon}\) -efficient solutions in multiobjective programming. OR Spectrum 29, 335–350 (2007)

    Article  Google Scholar 

  10. Engau A., Wiecek M.M.: Cone characterization of approximate solutions in real vector optimization. J. Optim. Theory Appl. 134, 499–513 (2007)

    Article  Google Scholar 

  11. Giorgi G., Guerraggio A., Thierfelder J.: Mathematics of Optimization: Smooth and Nonsmooth Case. Elsevier, Amsterdam (2004)

    Google Scholar 

  12. Govil M.G., Mehra A.: \({\epsilon}\) -Optimality for multiobjective programming on a Banach space. Eur. J. Oper. Res. 157, 106–112 (2004)

    Article  Google Scholar 

  13. Gupta P., Shiraishi S., Yokoyama K.: \({\epsilon}\) -Optimality without constraint qualification for multiobjective fractional programs. J. Nonlinear Convex Anal. 6, 347–357 (2005)

    Google Scholar 

  14. Gutiérrez C., Jiménez B., Novo V.: Optimality conditions for metrically consistent approximate solutions in vector optimization. J. Optim. Theory Appl. 133, 49–64 (2007)

    Article  Google Scholar 

  15. Gutiérrez C., Jiménez B., Novo V.: On approximate solutions in vector optimization problems via scalarization. Comput. Optim. Appl. 35, 305–324 (2006)

    Article  Google Scholar 

  16. Hamel A.: An \({\epsilon}\) -Lagrange multiplier rule for a mathematical programming problem on Banach space. Optimization 49, 137–149 (2001)

    Article  Google Scholar 

  17. Jeyakumar V., Lee G.M., Dinh N.: New sequence Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs. SIAM J. Optim. 14, 534–547 (2003)

    Article  Google Scholar 

  18. Kim, D.S., Son, T.Q.: ε-Optimality conditions for nonconvex semi-infinite programs involving support functions. Fixed Point Theory Appl. (2011), article ID 17532. doi:10.1155/2011/175327

  19. Kim D.S., Son T.Q.: Characterizations of solution sets of a class of nonconvex semi-infinite programming problems. J. Nonlinear Convex Anal. 12, 429–440 (2011)

    Google Scholar 

  20. Kutateladze S.S.: Convex \({\epsilon}\) -programming. Soviet Math. Doklady 20, 391–393 (1979)

    Google Scholar 

  21. Li Z., Wang S.: \({\epsilon}\) -Approximate solutions in multiobjective optimization. Optimization 44, 161–174 (1998)

    Article  Google Scholar 

  22. Liu J.C.: \({\epsilon}\) -Duality theorem of nondifferentiable nonconvex multiobjective programming. J. Optim. Theory Appl. 69, 153–167 (1991)

    Article  Google Scholar 

  23. Loridan P.: \({\epsilon}\) -Solutions in vector minimization problems. J. Optim. Theory Appl. 43, 255–257 (1984)

    Article  Google Scholar 

  24. Loridan P.: Necessary conditions for ε-optimality. Math. Program. Stud. 19, 140–152 (1982)

    Article  Google Scholar 

  25. Mifflin R.: Semismooth and semiconvex functions in constrained optimization. SIAM J. Control Optim. 15, 959–972 (1977)

    Article  Google Scholar 

  26. Son T.Q., Dinh N.: Characterizations of optimal solution sets of convex infinite programs. TOP 16, 147–163 (2008)

    Article  Google Scholar 

  27. Son T.Q., Strodiot J.J., Nguyen V.H.: ε-Optimality and ε-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints. J. Optim. Theory Appl. 141, 389–409 (2009)

    Article  Google Scholar 

  28. Son T.Q., Kim D.S., Tam N.N.: Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian. J. Global Optim. 53, 165–184 (2012)

    Article  Google Scholar 

  29. Tanaka, T.: A new approach to approximate solutions in vector optimization problems. Prod. APORS, pp. 497–504. World Scientific, Singapore (1995)

  30. Vályi I.: Approximate saddle-point theorems in vector optimization. J. Optim. Theory Appl. 55, 435–448 (1987)

    Article  Google Scholar 

  31. White D.J.: Epsilon efficiency. J. Optim. Theory Appl. 49, 319–337 (1986)

    Article  Google Scholar 

  32. Yao J.-C.: Variational inequalities with generalized monotone operations. Math. Oper. Res. 19, 691–705 (1994)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Natural Sciences, Nha Trang College of Education, Nha Trang, Vietnam

    T. Q. Son

  2. Department of Applied Mathematics, Pukyong National University, Busan, Korea

    D. S. Kim

Authors
  1. T. Q. Son
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. S. Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to D. S. Kim.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Son, T.Q., Kim, D.S. ε-Mixed type duality for nonconvex multiobjective programs with an infinite number of constraints. J Glob Optim 57, 447–465 (2013). https://doi.org/10.1007/s10898-012-9994-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-012-9994-0

Keywords

Mathematics Subject Classification

Search

Navigation