2006
DOI: 10.1007/s10957-006-9048-1
|View full text |Cite
|
Sign up to set email alerts
|

Optimality and Duality for a Class of Nondifferentiable Multiobjective Fractional Programming Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

1
23
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 34 publications
(24 citation statements)
references
References 15 publications
1
23
0
Order By: Relevance
“…Many authors have introduced various concepts of generalized convexity and have obtained optimality and duality results for optimization programming problem ( [1]- [4], [6]- [12]). Many practical problems encountered in economics, engineering design, and management science, and so forth can be described by nonsmooth functions.…”
Section: Introductionmentioning
confidence: 99%
“…Many authors have introduced various concepts of generalized convexity and have obtained optimality and duality results for optimization programming problem ( [1]- [4], [6]- [12]). Many practical problems encountered in economics, engineering design, and management science, and so forth can be described by nonsmooth functions.…”
Section: Introductionmentioning
confidence: 99%
“…in order to measure the efficiency or productivity of the system. Many economic, non-economic and indirect applications of fractional programming problem have also been given by Dinklebaeh (1967), Jagannathan (1973), Bector (1973), Bector and Chandra (1986), Craven (1998), Mond and Weir (1982), Stancu-Minasian (1997), Schaible and Ibaraki (1983), Ahmad and Sharma (2007), Gulati et al (2007), Kim et al (2006) and Ahmad et al (2011aAhmad et al ( , 2011b.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, many authors studied the efficiency and optimality conditions for multiobjective optimal control problems [1][2][3][4][5][6]. Other authors considered optimality and duality for fractional programming problems [7][8][9]. The Lagrange multipliers of multiobjective programming problems, and the saddle points of their vector-valued Lagrangian function, have been studied in [10][11][12][13][14].…”
Section: Introductionmentioning
confidence: 99%