Maximizing the ratio of two convex functions over a convex set
Year of publication: |
2006
|
---|---|
Authors: | Benson, Harold P. |
Published in: |
Naval research logistics : an international journal. - New York, NY : Wiley, ISSN 0894-069X, ZDB-ID 3924944. - Vol. 53.2006, 4, p. 309-317
|
Saved in:
Saved in favorites
Similar items by person
-
Branch-and-reduce algorithm for convex programs with additional multiplicative constraints
Benson, Harold P., (2009)
-
Benson, Harold P., (2010)
-
A branch-and-bound algorithm for the concave cost supply problem
Yenipazarli, Arda, (2016)
- More ...