2010•Journal of Sichuan University of Science & EngineeringRequires access

Semi B-(E,F)-convex Constrained Single-objective Programming of Optimal Conditions

MA Xiao-na

Abstract

Convexity and generalized in the convexity of mathematical programming optimization theory,optimization control and many other areas of mathematics plays an important role,but the limitations of convexity are also very obvious.This paper generalized two kinds of convex functions:B-convex function and semi-(E,F)-convex function are researched furtherly.A new kind of generalized convexity:semi-B-(E,F)-convexity is introduced,semi-B-(E,F)-convex function and its generalized convexity are introduced,this paper presents the optimal conditions of single-objective programming for semiB-(E,F)-convexity functions using properities of semiB-(E,F)-convexity functions.

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: Convexity, Mathematics, Convex optimization, Convex function, Regular polygon, Convex analysis, Function (biology), Mathematical optimization