ScholarLens Back to search
2011•Journal of Qufu Normal UniversityRequires access

Duality Theorems of Single Objective Programming for Semi B-(E,F)-convex Functions

MA Xiao-na

Open publisher page 0 citations

Abstract

This paper presents the weak duality theorem,the strong duality theorem and the inverse duality theorem of singleobjective programming for semi B-(E,F)-convex function using properities of semi B-(E,F)-convex function.

About this research paper

What this paper is about

This paper presents the weak duality theorem,the strong duality theorem and the inverse duality theorem of singleobjective programming for semi B-(E,F)-convex function using properities of semi B-(E,F)-convex function.

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 strong duality theorem and the inverse duality theorem of singleobjective programming for semi B-(E,F)-convex function using properities of semi B-(E,F)-convex function.

Key concepts: Duality (order theory), Mathematics, Convex analysis, Convex optimization, Strong duality, Regular polygon, Combinatorics, Discrete mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Duality Theorems of Single Objective Programming for Semi B-(E,F)-convex Functions — Research Paper | ScholarLens