Duality Theorems of Multiobjective Programming for Semi-(E,F)-Convexity Functions
Yunpeng Duan
Abstract
Yunpeng Duan
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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