Affiliation:
1. School of Mathematics and Statistics, Yulin University, Yulin 719000, China
Abstract
Minimax fractional semi-infinite programming is an important research direction for semi-infinite programming, and has a wide range of applications, such as military allocation problems, economic theory, cooperative games, and other fields. Convexity theory plays a key role in many aspects of mathematical programming and is the foundation of mathematical programming research. The relevant theories of semi-infinite programming based on different types of convex functions have their own applicable scope and limitations. It is of great value to study semi-infinite programming on the basis of more generalized convex functions and obtain more general results. In this paper, we defined a new type of generalized convex function, based on the concept of the K−directional derivative, that is, uniform (BK,ρ)−invex, strictly uniform (BK,ρ)−invex, uniform (BK,ρ)−pseudoinvex, strictly uniform (BK,ρ)−pseudoinvex, uniform (BK,ρ)−quasiinvex and weakly uniform (BK,ρ)−quasiinvex function. Then, we studied a class of non-smooth minimax fractional semi-infinite programming problems involving this generalized convexity and obtained sufficient optimality conditions.
Funder
the scientific research fund of Shaanxi Province Education Department
Yulin City Science and Technology Bureau
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference31 articles.
1. Uber Lineare Ungleichungen;Haar;Acta Math. Szeged.,1924
2. John, F. (1948). Extremum Problem with Inequalities as Subsidiary Conditions, Studies and Essays, Courant Anniversary Volume, Interscience Publisher.
3. Duality, Haar Programming and Finite Sequence Spaces;Charnes;Proc. Natl. Acad. Sci. USA,1962
4. Optimal parametrization of curves for robot trajectory design;Marin;IEEE Trans. Autom. Control.,1988
5. Semi-Infinite Programming: Theory, Methods, and Applications;Hettich;SIAM Rev.,1993