1986•Journal of Information and Optimization SciencesRequires access

A Note on Strict Converse Duality in Nonlinear Programming

Terence Weir

Abstract

Strict converse duality theorems for some of the Mond-Weir duals for nonlinear programming problems have been given by several authors. All these results have depended on weak and strong duality for the primal and dual problems. In this note strict converse duality theorems are given under different convexity assumptions that do not require weak and strong duality.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 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

Key concepts: Converse, Wolfe duality, Dual polyhedron, Duality (order theory), Weak duality, Strong duality, Duality gap, Mathematics