Fractional programming. Theory, methods and applications (Q4368736)
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 1095224
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fractional programming. Theory, methods and applications |
scientific article; zbMATH DE number 1095224 |
Statements
8 December 1997
0 references
constraints with cones
0 references
duality
0 references
0.8384669423103333
0 references
0.8194976449012756
0 references
Fractional programming. Theory, methods and applications (English)
0 references
This book is the third book published on fractional programming. It is a large detailed compilation of many results, from 1089 cited references. The scope is indicated by the chapter headings: 1. Fractional programming applications; 2. Convex, quasiconvex, pseudoconvex, logarithmic convex, \(\alpha m\)-convex, and invex functions; 3. Methods for solving linear fractional programming problems; 4. Nonlinear fractional programming; 5. Duality in fractional programming; 6. Fractional programming with multiple objective functions; 7. Fractional programming in the complex space; 8. Special linear fractional programming problems; 9. Integer and mixed integer linear fractional programming; 10. Fractional transportation problem. Some 24 applications of fractional programming are given, mostly in management and planning areas, for example cutting stock, transportation problems, investment, inventory, but also applications to graph theory, Markov chains, and others. The main emphasis of the book, as also in the literature, is on theoretical developments, notably duality properties for linear and nonlinear fractional programs, also multiobjective optimization. Some specialized aspects are briefly mentioned. Such as constraints with cones. Generalized convex properties of fractional functions are discussed, but only a little is said about their application to duality. Various algorithms are also discussed in detail, including simplex, gradient, and parametric methods, and some methods for mixed-integer fractional problems. A number of numerical examples are presented.
0 references