2010•Chongqing Shifan Daxue xuebao. Ziran kexue banRequires access

Mond Weir Dual and Wolf Dual in a Class of Nonsmooth Programming Problems

Liping Tang

Abstract

In this paper duality in a class of nonsmooth B-(p,r)programming problem with equality and inequality constraints is considered.Weak duality,strong duality,converse duality and strict converse duality are researched in Mond Weir dual under strict B-(p,r) invexity of λf+∑mi=1μigi+∑pj=1vjhj.Weak duality and strong duality are researched in Wolf dual under B-(p,r) invexity of f+∑mi=1μigi+∑pj=1vjhj and restricted converse duality and strict converse duality are researched under strict B-(p,r) invexity.Some conrresponding duality theorems are proved without any constraints.Our results generalize and improve some known results.

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