A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Generalized (𝔉,b,ϕ,ρ,θ)-univex n-set functions and global parametric sufficient optimality conditions in minmax fractional subset programming

2005
*
International Journal of Mathematics and Mathematical Sciences
*

We first define a new class of generalized convex n-set functions, called (Ᏺ,b,φ,ρ,θ)univex functions, and then establish a fairly large number of global parametric sufficient optimality conditions under a variety of generalized (Ᏺ,b,φ,ρ,θ)-univexity assumptions for a discrete minmax fractional subset programming problem. where A n is the n-fold product of the σ-algebra A of subsets of a given set X, F i , G i , i ∈ p ≡ {1, 2,..., p}, and H j , j ∈ q, are real-valued functions defined on A n ,

doi:10.1155/ijmms.2005.1253
fatcat:dj32s6env5b5lg5hyvnb3jpyue