2004•OptimizationRequires access

Optimality and Duality for Invex Nonsmooth Multiobjective programming problems

Do Sang Kim, Siegfried Schaible

Abstract

We consider nonsmooth multiobjective programming problems with inequality and equality constraints involving locally Lipschitz functions. Several sufficient optimality conditions under various (generalized) invexity assumptions and certain regularity conditions are presented. In addition, we introduce a Wolfe-type dual and Mond–Weir-type dual and establish duality relations under various (generalized) invexity and regularity conditions.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 56 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: Mathematics, Duality (order theory), Lipschitz continuity, Multiobjective programming, Dual (grammatical number), Mathematical optimization, Strong duality, Applied mathematics