Abstract
In this chapter, we consider several special problems which appear in linear fractional programming. Thus, in Section 8.1, we consider a problem of linear fractional programming in which the variables of the objective function appear in absolute-value, and the constraints lack the condition for non-negativity. We show that, under certain conditions, it is possible to apply the Simplex algorithm developed for the standard linear fractional problem. In Section 8.2, we consider the separable linear fractional programming problem, and we reduce it to the solution of a sequence of quadratic programming problems. In Section 8.3, we study the linear fractional programming problem with disjunctive constraints for which we present a solution method and we construct the Dual problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Kluwer Academic Publishers
About this chapter
Cite this chapter
Stancu-Minasian, I.M. (1997). Special Linear Fractional Programming Problems. In: Fractional Programming. Mathematics and Its Applications, vol 409. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-0035-6_9
Download citation
DOI: https://doi.org/10.1007/978-94-009-0035-6_9
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-6504-7
Online ISBN: 978-94-009-0035-6
eBook Packages: Springer Book Archive