Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지
DOI QR코드

DOI QR Code

OPTIMIZATION PROBLEMS WITH DIFFERENCE OF SET-VALUED MAPS UNDER GENERALIZED CONE CONVEXITY

  • DAS, K. (Department of Mathematics, Indian Institute of Technology Kharagpur) ;
  • NAHAK, C. (Department of Mathematics, Indian Institute of Technology Kharagpur)
  • Received : 2016.01.11
  • Accepted : 2016.10.17
  • Published : 2017.01.30
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we establish the necessary and sufficient Karush-Kuhn-Tucker (KKT) conditions for an optimization problem with difference of set-valued maps under generalized cone convexity assumptions. We also study the duality results of Mond-Weir (MW D), Wolfe (W D) and mixed (Mix D) types for the weak solutions of the problem (P).

Keywords

References

  1. J. Baier and J. Jahn, On subdifferentials of set-valued maps, J. Optim. Theory Appl. Vol. 100 (1999), 233-240. https://doi.org/10.1023/A:1021733402240
  2. J. Borwein, Multivalued convexity and optimization: a unified approach to inequality and equality constraints, Math. Program. 13 (1977), 183-199. https://doi.org/10.1007/BF01584336
  3. J.M. Borwein, A lagrange multiplier theorem and a sandwich theorem for convex relations, Math. Scand. 48 (1981), 189-204. https://doi.org/10.7146/math.scand.a-11911
  4. K. Das and C. Nahak, Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity, Rend. Circ. Mat. Palermo (1952-) 63 (2014), 329-345. https://doi.org/10.1007/s12215-014-0163-9
  5. K. Das and C. Nahak, Sufficiency and duality of set-valued optimization problems via higher-order contingent derivative, J. Adv. Math. Stud. 8 (2015), 137-151.
  6. K. Das and C. Nahak, Set-valued fractional programming problems under generalized cone convexity, Opsearch 53 (2016), 157-177. https://doi.org/10.1007/s12597-015-0222-9
  7. F. Flores-Bazan and W. Oettli, Simplified optimality conditions for minimizing the difference of vector-valued functions, J. Optim. Theory Appl. 108 (2001), 571-586. https://doi.org/10.1023/A:1017535424813
  8. N. Gadhi, Optimality conditions for the difference of convex set-valued mappings, Positivity 9 (2005), 687-703. https://doi.org/10.1007/s11117-005-2786-8
  9. N. Gadhi, M. Laghdir and A. Metrane, Optimality conditions for D:C: vector optimization problems under reverse convex constraints, J. Glob. Optim. 33 (2005), 527-540. https://doi.org/10.1007/s10898-004-8318-4
  10. N. Gadhi, A. Metrane, Sufficient optimality condition for vector optimization problems under dc data, J. Glob. Optim. 28 (2004), 55-66. https://doi.org/10.1023/B:JOGO.0000006715.69153.8b
  11. X.L. Guo, S.J. Li and K.L. Teo, Subdifferential and optimality conditions for the difference of set-valued mappings, Positivity 16 (2012), 321-337. https://doi.org/10.1007/s11117-011-0128-6
  12. J.B. Hiriart-Urruty, From convex optimization to nonconvex optimization, in: Clarke, F.H., Demyanov, V.F., Giannessi, F. (eds.) Nonsmooth Optimization and Related Topics, Plenum, New York, 1989, pp. 219-239.
  13. L.Lahoussine, A. A. Elhilali and N. Gadhi, Set-valued mapping monotonicity as characterization of D:C: functions, Positivity 13 (2009), 399-405. https://doi.org/10.1007/s11117-008-2189-8
  14. A. Taa, Optimality conditions for vector optimization problems of a difference of convex mappings, J. Glob. Optim. 31 (2005), 421-436. https://doi.org/10.1007/s10898-004-6874-2
  15. T. Tanino and Y. Sawaragi, Conjugate maps and duality in multiobjective optimization, J. Optim. Theory Appl. 31 (1980), 473-499. https://doi.org/10.1007/BF00934473