Duality in nondifferentiable minimax fractional programming with B-(p, r)-invexity

被引：38

作者：

Ahmad, Izhar ^{[1
,2
]}

Gupta, S. K. ^{[3
]}

Kailey, N. ^{[4
]}

Agarwal, Ravi P. ^{[1
,5
]}

机构：

[1] King Fahd Univ Petr & Minerals, Dept Math & Stat, Dhahran 31261, Saudi Arabia

[2] Aligarh Muslim Univ, Dept Math, Aligarh 202002, Uttar Pradesh, India

[3] Indian Inst Technol, Dept Math, Patna 800013, Bihar, India

[4] Thapar Univ, Sch Math & Comp Applicat, Patiala 147004, Punjab, India

[5] Texas A&M Univ, Dept Math, Kingsville, TX 78363 USA

来源：

JOURNAL OF INEQUALITIES AND APPLICATIONS | 2011年

关键词：

nondifferentiable fractional programming; optimality conditions; B-(p; r)-invex function; duality theorems; SUFFICIENT CONDITIONS; OPTIMIZATION; OPTIMALITY;

D O I：

10.1186/1029-242X-2011-75

中图分类号：

O29 [应用数学];

学科分类号：

070104 [应用数学];

摘要：

In this article, we are concerned with a nondifferentiable minimax fractional programming problem. We derive the sufficient condition for an optimal solution to the problem and then establish weak, strong, and strict converse duality theorems for the problem and its dual problem under B-(p, r)-invexity assumptions. Examples are given to show that B-(p, r)-invex functions are generalization of (p, r)-invex and convex functions

引用

页数：14

共 25 条

[1]

Optimality and Duality in Nonsmooth Multiobjective Optimization Involving V-Type I Invex Functions [J].