Online citations, reference lists, and bibliographies.

Special Linear Fractional Programming Problems

Ioan M. Stancu-Minasian
Published 1997 · Computer Science

Cite This
Download PDF
Analyze on Scholarcy
Share
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.



Semantic Scholar Logo Some data provided by SemanticScholar