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|
|Contact details of provider:|| Postal: Via Cosimo Ridolfi, 10 - 56124 PISA|
Phone: +39 050 22 16 466
Fax: +39 050 22 16 384
Web page: http://www.ec.unipi.it
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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.