Generalized \((\mathcal{F},b,\phi,\rho,\theta)\)-univex \(n\)-set functions and global parametric sufficient optimality conditions in minmax fractional subset programming (Q2575930)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2236240
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalized \((\mathcal{F},b,\phi,\rho,\theta)\)-univex \(n\)-set functions and global parametric sufficient optimality conditions in minmax fractional subset programming |
scientific article; zbMATH DE number 2236240 |
Statements
Generalized \((\mathcal{F},b,\phi,\rho,\theta)\)-univex \(n\)-set functions and global parametric sufficient optimality conditions in minmax fractional subset programming (English)
0 references
7 December 2005
0 references
Summary: We first define a new class of generalized convex \(n\)-set functions, called \((\mathcal{F},b,\phi,\rho,\theta)\)-univex functions, and then establish a fairly large number of global parametric sufficient optimality conditions under a variety of generalized \((\mathcal{F},b,\phi,\rho,\theta)\)-univexity assumptions for a discrete minmax fractional subset programming problem.
0 references
discrete minmax fractional subset programming problem
0 references
0.9193892478942872
0 references
0.9013458490371704
0 references
0.8981411457061768
0 references
0.891549825668335
0 references
