Duality in inexact fractional programming with set-inclusive constraints (Q1065723)
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 3924537
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Duality in inexact fractional programming with set-inclusive constraints |
scientific article; zbMATH DE number 3924537 |
Statements
Duality in inexact fractional programming with set-inclusive constraints (English)
0 references
1986
0 references
This paper extends the fractional programming problem with set-inclusive constraints studied earlier by replacing every coefficient vector in the objective function with a convex set. A dual is formulated, and well- known duality results are established. A numerical example illustrates the dual strategy to obtain the value of the initial problem.
0 references
set-inclusive constraints
0 references
duality results
0 references
0 references
0.825779914855957
0 references
0.8238248825073242
0 references
