Hostname: page-component-76c49bb84f-887v8 Total loading time: 0 Render date: 2025-07-12T00:23:21.468Z Has data issue: false hasContentIssue false
  • English
  • Français

Strong pseudo-convexity and symmetric duality in nonlinear programming

Published online by Cambridge University Press:  17 February 2009

M.S. Mishra ,
S. Nanda  and
D. Acharya
M.S. Mishra
Affiliation:
Indian Institute of Technology, Kharagpur-721302, India.
S. Nanda
Affiliation:
Indian Institute of Technology, Kharagpur-721302, India.
D. Acharya
Affiliation:
Indian Institute of Technology, Kharagpur-721302, India.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this note, the weak duality theorem of symmetric duality in nonlinear programming and some related results are established under weaker (strongly Pseudo-convex/strongly Pseudo-concave) assumptions. These results were obtained by Bazaraa and Goode [1] under (stronger) convex/concave assumptions on the function.

Information

Type
Research Article
Information
The ANZIAM Journal , Volume 27 , Issue 2 , October 1985 , pp. 238 - 244
Copyright
Copyright © Australian Mathematical Society 1985

References

[1]Bazaraa, M. S. and Goode, J. J., “On symmetric duality in nonlinear programming’, Oper. Res. 21 (1973), 1–9.CrossRefGoogle Scholar
[2]Chandra, Suresh, “Strong Pseudo-convex programming’, Indian J. Pure Appl. Math. 3 (1972), 278–282.Google Scholar
[3]Dom, W. S., “Duality in quadratic programming’, Quart. Appl. Math. 18 (1960), 155–162.Google Scholar
[4]Dantzig, G. B., Eisenberg, E., Cottle, R. W., “Symmetric duality in nonlinear programming’, Pacific J. Math. 15 (1965), 809–812.Google Scholar
[5]Manjulata, , “Strong Pseudo-convex programming in Banach space’, Indian J. Pure Appl. Math. (1976), 45–78.Google Scholar
[6]Mishra, M. S., Nanda, S. and Acharya, D., “Pseudo-convexity and symmetric duality in nonlinear programming’, Report, Department of Mathematics, Indian Institute of Technology, Kharagpur, 1984.Google Scholar
[7]Mond, B., “Generalised convexity in mathematical programming’, Bull. Austral. Math. Soc. 27 (1983), 185–202.CrossRefGoogle Scholar