Linear fractional programming and duality
This paper presents a dual of a general linear fractional functionals programming problem. Dual is shown to be a linear programming problem. Along with other duality theorems, complementary slackness theorem is also proved. A simple numerical example illustrates the result. Copyright Springer-Verlag 2007
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 15 (2007)
Issue (Month): 2 (June)
|Contact details of provider:|| Web page: http://www.springer.com/business/operations+research/journal/10100|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:cejnor:v:15:y:2007:i:2:p:119-125. 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: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.