A class of constrained multiobjective fractional programming problems is considered from a viewpoint of the generalized convexity. Some basic concepts about the generalized convexity of functions, including a unified formulation of generalized convexity, are presented. Based upon the concept of the generalized convexity, efficiency conditions and duality for a class of multiobjective fractional programming problems are obtained. For three types of duals of the multiobjective fractional programming problem, the corresponding duality theorems are also established.
机构:
Chongqing Technol & Business Univ, Coll Math & Stat, Chongqing 400067, Peoples R ChinaChongqing Technol & Business Univ, Coll Math & Stat, Chongqing 400067, Peoples R China
机构:
Indian Inst Technol Patna, Dept Math, Patna 801103, IndiaIndian Inst Technol Patna, Dept Math, Patna 801103, India
Upadhyay, Balendu Bhooshan
Stancu-Minasian, I. M.
论文数: 0引用数: 0
h-index: 0
机构:
Indian Inst Technol Patna, Dept Math, Patna 801103, India
Romanian Acad, Gheorghe Mihoc Caius Iacob Inst Math Stat & Appl M, Bucharest 050711, RomaniaIndian Inst Technol Patna, Dept Math, Patna 801103, India
Stancu-Minasian, I. M.
Stancu-Minasian, I. M.
论文数: 0引用数: 0
h-index: 0
机构:
Indian Inst Technol Patna, Dept Math, Patna 801103, India
Romanian Acad, Gheorghe Mihoc Caius Iacob Inst Math Stat & Appl M, Bucharest 050711, RomaniaIndian Inst Technol Patna, Dept Math, Patna 801103, India