Optimality and second order duality for a class of quasi-differentiable multiobjective optimization problem

Authors

  • Rishi R. Sahay Department of Operational Research, University of Delhi, India
  • Guneet Bhatia Department of Mathematics, University of Delhi, India

DOI:

https://doi.org/10.2298/YJOR130119024S

Keywords:

higher order η - bonvexity, strict minimizers, second order duality

Abstract

A second order Mond-Weir type dual is presented for a non-differentiable multiobjective optimization problem with square root terms in the objective as well as in the constraints. Optimality and duality results are presented. Classes of generalized higher order η - bonvex and related functions are introduced to study the optimality and duality results. A fractional case is presented at the end.

References

Ahmad, I., and Husain, Z., “Second order (F, α, ρ, d) – convexity and duality in multiobjective programming,” Inform. Sci., 176 (2006) 3094-3103.

Ahmad, I., Husain, Z., and Al-Homidan, S., “Second order duality in nondifferentiable fractional programming,” Nonlinear Anal. Real World Appl., 12 (2011) 1103-1110.

Bazaraa, M. S., Sherali, H. D., and Shetty, C. M., Nonlinear Programming: Theory and Algorithms, John Wiley and Sons, New York, 1993.

Bector, C. R., and Chandra, S., “Generalized convexity and higher order duality for fractional programming,” Opsearch, 24 (1987) 143-154.

Bector, C. R., Suneja, S. K., and Gupta, S., “Univex functions and univex nonlinear programming,” Proceedings of the Administrative Sciences Association of Canada, (1992) 115-124.

Bhatia, D., “A note on duality theorem for nonlinear programming problem,” Management Sci., 16 (1970) 604-606.

Chandra, S., Craven, B. D., and Mond, B., “Generalized concavity and duality with a square root term,” Optimization, 16 (5) (1985) 653-662.

Chinchuluun, A., and Pardalos, P. M., “A survey of multiobjective optimization,” Ann. Oper. Res., 154 (2007) 29-50.

Craven, B. D., and Mond, B., “Sufficient Fritz-John optimization conditions for nondifferentiable convex programming,” J. Aust. Math. Soc., Series B, 19 (1976) 462-468.

Craven, B. D., “On quasidifferentiable optimization,” J. Aust. Math. Soc., Series A, 41 (1986) 64-78.

Eisenberg, E., “Support of a convex function,” Bull. Amer. Math. Soc., 68 (1962) 192-195.

Hanson, M. A., “On sufficiency of Kuhn-Tucker conditions,” J. Math. Anal. Appl., 80 (1981) 545-550.

Hanson, M. A., “Second order invexity and duality in mathematical programming,” Opsearch, 30 (1993) 313-320.

Jayswal, A., Kumar, D., and Kumar, R., “Second order duality for nondifferentiable multiobjective programming problem involving (F, α, ρ, d) – V – type I functions,” Optim. Lett., 4 (2) (2010) 211-226.

Mangasarian, O. L., “Second and higher order duality in nonlinear programming,” J. Math. Anal. Appl., 51 (1975) 607-620.

Mond, B., Husain, I., and Prasad, M. V. D., “Duality for a class of nondifferentiable multiple objective programming problems,” J. Inf. Opt. Sciences, 9 (3) (1988) 331-341.

Schechter, M., “More on subgradient duality,” J. Math. Anal. Appl., 71 (1979) 251-262.

Sinha, S. M., “A duality theorem for nonlinear programming,” Management Sci., 12 (1966) 385-390.

Zhang, J., and Mond, B., “Duality for a nondifferentiable programming problem,” Bull. Aust. Math. Soc., 55 (1997) 29-44.

Downloads

Published

2013-06-01

Issue

Section

Research Articles