Duality in disjunctive linear fractional programming (Q1059557)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Duality in disjunctive linear fractional programming |
scientific article; zbMATH DE number 3904359
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Duality in disjunctive linear fractional programming |
scientific article; zbMATH DE number 3904359 |
Statements
Duality in disjunctive linear fractional programming (English)
0 references
1985
0 references
A dual problem is formulated for a given class of disjunctive linear fractional programming problems. This result generalizes to fractional programming the duality theorem of disjunctive linear programming originated by \textit{E. Balas} [Ann. Discrete Math. 5, 3-51 (1979; Zbl 0409.90061)]. Two examples are given to illustrate the result.
0 references
disjunctive constraints
0 references
duality theory
0 references
dual problem
0 references
disjunctive linear fractional programming
0 references
0.9578929
0 references
0.94440293
0 references
0 references
0.93974787
0 references
