Optimality Conditions and Duality for Nondifferentiable Multiobjective Fractional Programming Problems with (C,α,ρ,d)-convexity

The purpose of this paper is to consider a class of nondifferentiable multiobjective fractional programming problems in which every component of the objective function contains a term involving the support function of a compact convex set. Based on the ( C , α , ρ , d )-convexity, sufficient optimal...

Full description

Saved in:
Bibliographic Details
Published in:Journal of optimization theory and applications 2011, Vol.148 (1), p.197-208
Main Author: Long, X. J.
Format: Article
Language:English
Subjects:
Applications of Mathematics
Applied sciences
Calculus of Variations and Optimal Control
Optimization
Engineering
Euclidean space
Exact sciences and technology
Experimental design
Flows in networks. Combinatorial problems
Mathematical programming
Mathematics
Mathematics and Statistics
Operational research and scientific management
Operational research. Management science
Operations Research/Decision Theory
Optimization
Probability and statistics
Sciences and techniques of general use
Statistics
Studies
Theorems
Theory of Computation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The purpose of this paper is to consider a class of nondifferentiable multiobjective fractional programming problems in which every component of the objective function contains a term involving the support function of a compact convex set. Based on the ( C , α , ρ , d )-convexity, sufficient optimality conditions and duality results for weakly efficient solutions of the nondifferentiable multiobjective fractional programming problem are established. The results extend and improve the corresponding results in the literature.
ISSN:0022-3239
1573-2878
DOI:10.1007/s10957-010-9740-z