Linear-fractional Programming
Linear-fractional programming (LFP) is a generalization of linear programming (LP). Where the objective function of linear programs are linear functions, the objective function of a linear-fractional program is a ratio of two linear functions. In other words, a linear program is a fractional-linear program in which the denominator is the constant function having the value one everywhere. A linear-fractional program can be solved by a variant of the simplex algorithm. They can be solved by the criss-cross algorithm, also.
Read more about this topic: Simplex Algorithm
Famous quotes containing the word programming:
“If there is a price to pay for the privilege of spending the early years of child rearing in the driver’s seat, it is our reluctance, our inability, to tolerate being demoted to the backseat. Spurred by our success in programming our children during the preschool years, we may find it difficult to forgo in later states the level of control that once afforded us so much satisfaction.”
—Melinda M. Marshall (20th century)