2003•Journal of Hainan Normal UniversityRequires access

Mond - Weir duality for generalized convex and nonsmooth programming

Yao Yuan

Abstract

In this paper,two Mond - Weir dual forms for nonsmoth Lipschitz programming are established, and then by means of the generalized convexity conditions for Lipscitz's function defined by Clarke generalized gradient .their duality theorems with the weak duality theorem,strong duality tehorem, strict converse duality theorem are proved.The results cover the known duality theorems concerned.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

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: Duality (order theory), Wolfe duality, Strong duality, Perturbation function, Fenchel's duality theorem, Mathematics, Weak duality, Duality gap