Simplex-like sequential methods for a class of generalized fractional programs
We deal with a class of generalized fractional programming problems having a polyhedral feasible region and as objective the ratio of an affine function and the power p > 0 of an affine one. We aim to propose simplex-like sequential methods for finding the global maximum points. As the objective function may have local maximum points not global, we analyze the theoretical properties of the problem; in particular, we study the maximal domains of the pseudoconcavity of the function. Depending on whether or not the objective is pseudoconcave on the feasible set, we suggest different algorithms.
|Date of creation:||16 Jul 2013|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: +39 050 22 16 466
Fax: +39 050 22 16 384
Web page: http://www.ec.unipi.itEmail:
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:pie:dsedps:2013/168. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
If references are entirely missing, you can add them using this form.