ScholarLens Back to search
1985•ANZIAM JournalOpen access

Strong pseudo-convexity and symmetric duality in nonlinear programming

M.S. Mishra, Sudarsan Nanda, Dipendra Raj Acharya

Open full text 5 citations

Abstract

Abstract 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.

Open-access reader

About this research paper

What this paper is about

Abstract 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.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract 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.

Key concepts: Convexity, Duality (order theory), Mathematics, Strong duality, Nonlinear system, Nonlinear programming, Regular polygon, Fenchel's duality theorem

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Strong pseudo-convexity and symmetric duality in nonlinear programming — Research Paper | ScholarLens