Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5398
Full metadata record
DC FieldValueLanguage
dc.creatorBitran, Gabriel R.-
dc.creatorMagnanti, Thomas L.-
dc.date2004-05-28T19:37:38Z-
dc.date2004-05-28T19:37:38Z-
dc.date1975-04-
dc.date.accessioned2013-10-09T02:39:33Z-
dc.date.available2013-10-09T02:39:33Z-
dc.date.issued2013-10-09-
dc.identifierhttp://hdl.handle.net/1721.1/5398-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1721-
dc.descriptionIn this paper, we consider algorithms, duality and sensitivity analysis for optimization problems, called fractional, whose objective function is the ratio of two real valued functions. We discuss a procedure suggested by Dinkelbach for solving the problem, its relationship to certain approaches via variable transformations, and a variant of the procedure which has convenient convergence properties. The duality correspondences that are developed do not require either differentiability or the existence of optimal solution. The sensitivity analysis applies to linear fractional problems, even when they "solve" at an extreme ray, and includes a primal-dual algorithm for parametric right-hand-side analysis.-
dc.descriptionSupported in part by the U.S. Army Research Office (Durham) under Contract No. DAHC04-73-C-0032 and Grant-In-Aid from Coca-Cola, U.S.A. administered at M.I.T. as OSP 27857-
dc.format1746 bytes-
dc.format1987882 bytes-
dc.formatapplication/pdf-
dc.languageen_US-
dc.publisherMassachusetts Institute of Technology, Operations Research Center-
dc.relationOperations Research Center Working Paper ; OR 042-75-
dc.titleDuality and Sensitivity Analysis for Fractional Programs (REVISED)-
dc.typeWorking Paper-
Appears in Collections:MIT Items

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.