A semi-infinite programming problem is a mathematical programming problem with a finite number of variables and infinitely many constraints. Duality theories and generalized convexity concepts are important research t...A semi-infinite programming problem is a mathematical programming problem with a finite number of variables and infinitely many constraints. Duality theories and generalized convexity concepts are important research topics in mathematical programming. In this paper, we discuss a fairly large number of paramet- ric duality results under various generalized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programming problem.展开更多
In this paper, we discuss a large number of sets of global parametric sufficient optimality conditions under various generalized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programming problem.
文摘A semi-infinite programming problem is a mathematical programming problem with a finite number of variables and infinitely many constraints. Duality theories and generalized convexity concepts are important research topics in mathematical programming. In this paper, we discuss a fairly large number of paramet- ric duality results under various generalized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programming problem.
文摘In this paper, we discuss a large number of sets of global parametric sufficient optimality conditions under various generalized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programming problem.