Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized (F,ρ,θ)-convex functions

Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized (F,ρ,θ)-convex functions

0.00 Avg rating—0 Votes
Article ID: iaor2004729
Country: United Kingdom
Volume: 45
Issue: 10/11
Start Page Number: 1507
End Page Number: 1535
Publication Date: May 2003
Journal: Computers & Mathematics with Applications
Authors:
Keywords: optimization
Abstract:

In this paper, we present numerous sets of nonparametric sufficient optimality conditions and duality results under various generalized (F,ρ,θ)-convexity assumptions for a minmax fractional subset programming problem.

Reviews

Required fields are marked *. Your email address will not be published.