Abstract
A pair of nondifferentiable mixed symmetric dual programming problems is introduced and duality theorems are proved. This unifies two existing formulations of symmetric dual problems appeared in the literature.
Similar content being viewed by others
References
I. Ahmad, Multiobjective mixed symmetric duality with invexity, New Zealand J. Math. 34 (2005), 1–9.
S. Chandra, I. Husain and Abha, On mixed symmetric duality in mathematical programming, Opsearch 36 (1999), 165–171.
S. Chandra, B. D. Craven and B. Mond, Generalized concavity and duality with a square root term, Optimization 16 (1985), 653–662.
S. Chandra and I. Husain, Nondifferentiable symmetric dual programs, Bull. Austral. Math. Soc. 24 (1981), 295–307.
B. Mond and T. Weir, Generalized concavity and duality, in: Generalized concavity and duality in optimization and economics, (S. Schaible and W. T. Ziemba, Editors) (Academic Press, New York, 1981), 263–279.
B. D. Craven and B. Mond, Sufficient Fritz John optimality conditions for nondifferentiable convex programming, J. Austral. Math. Soc. (Ser. B) 19 (1976), 462–468.
B. Mond, A class of nondifferentiable mathematical programming problems, J. Math. Anal. Appl. 46 (1974), 169–174.
M.S. Bazaraa and J.J. Goode, On symmetric duality in nonlinear programming, Oper. Res. 21 (1973), 1–9.
G.B. Dantzig, E. Eisenberg and R.W. Cottle, Symmetric dual nonlinear programs, Pacific J. Math. 15 (1965), 809–812.
B. Mond, A symmetric dual theorem for nonlinear programs, Quart. J. Appl. Math. 23 (1965), 265–269.
W.S. Dorn, A symmetric dual theorem for quadratic programs, J. Oper. Res. Soc. Japan 2 (1960), 93–97.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ahmad, I., Gulati, T.R. Mixed symmetric duality for nondifferentiable programming problems. OPSEARCH 43, 296–308 (2006). https://doi.org/10.1007/BF03398779
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03398779