2007•Journal of Henan Normal UniversityRequires access

Duality Theorems of Multiobjective Programming for Semi-(E,F)-Convexity Functions

Yunpeng Duan

Open publisher page 0 citations

Abstract

This paper presents the weak duality theorem,the direct duality theorem and the inverse duality theorem of multiobjective programming for semi-(E,F)-convexity functions through using properities of semi-(E,F)-convexity functions.

About this research paper

What this paper is about

This paper presents the weak duality theorem,the direct duality theorem and the inverse duality theorem of multiobjective programming for semi-(E,F)-convexity functions through using properities of semi-(E,F)-convexity functions.

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

This paper presents the weak duality theorem,the direct duality theorem and the inverse duality theorem of multiobjective programming for semi-(E,F)-convexity functions through using properities of semi-(E,F)-convexity functions.

Key concepts: Convexity, Multiobjective programming, Duality (order theory), Mathematics, Mathematical economics, Strong duality, Mathematical optimization, Multi-objective optimization

Related papers

Back to paper searchBrowse research topicsOriginal source
Duality Theorems of Multiobjective Programming for Semi-(E,F)-Convexity Functions — Research Paper | ScholarLens