Sufficient Optimality Conditions For Semi-Infinite Fractional Programming Problems Involving Generalized E-Convex Functions

Posted on:2012-04-21

Degree:Master

Type:Thesis

Country:China

Candidate:C F Kang

Full Text:PDF

GTID:2210330362952476

Subject:Applied Mathematics

Abstract/Summary:

PDF Full Text Request

In this paper a new notion of E-convex function and a new notion of E-pseudoconvex functions and E-quasoconvex functions in (Banach) space are defined and their properties are studied. Moreover, we discuss a large number of sets of global sufficient optimality conditions under various generalized E-convexity assamptitions for a semi-infinite fractional programming problem.

Keywords/Search Tags:

E-convex functions, froctional programming, semi-infinite, suf-ficient optimality conditions

PDF Full Text Request

Related items

1	Parametric Duality Models For Semi-Infinite Fractional Programming Problems Involving Semi-E-Convex Functions
2	Generalized Semi-(E,F)-Convex Functions And Their Applications In Multi Objective Semi-infinite Programming
3	On The Use Of Augmented Lagrangians In The Generalized Semi-Infinite Programming
4	Study On Optimality Conditions For Semi-infinite Programming And Optimization Methods With Perturbations
5	A Logarithmic Lagrangian For Solving Semi-infinite Programming Problem
6	The Research On Optimality Conditions And Duality Theory Of Semi-Infinite Programming
7	The Research Of The Generalized E-convexity And Related Optimization Questions
8	The Optimality Conditions For Multiobjective Programming Problems
9	Two Classes Of Generalized Convex Functions And Their Applications To Optimization
10	E-Convex Sets, E-Convex Functions And E-Convex Programming In Linear Spaces