Fractional programming by lower subdifferentiability techniques (Q911479)
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 4141817
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fractional programming by lower subdifferentiability techniques |
scientific article; zbMATH DE number 4141817 |
Statements
Fractional programming by lower subdifferentiability techniques (English)
0 references
1991
0 references
The notion of lower subdifferentiability is applied to the analysis of convex fractional programming problems. In particular, duality results and optimality conditions are presented, and the applicability of a cutting-plane algorithm using lower subgradients is discussed. These methods are useful also in generalized fractional programming, where, in the linear case, the performance of the cutting-plane algorithm is compared with that of the most efficient version of the Dinkelbach method, which is based on the solution of a parametric linear programming problem.
0 references
lower subdifferentiability
0 references
convex fractional programming
0 references
duality results
0 references
optimality conditions
0 references
cutting-plane algorithm
0 references
lower subgradients
0 references
Dinkelbach method
0 references
parametric linear programming
0 references
0 references
0.8548146486282349
0 references
0.8103514313697815
0 references
0.7984969615936279
0 references
0.7886157035827637
0 references
0.7886156439781189
0 references
