Content deleted Content added
Fractional-linear programs are convex minimization problems with a special property, pseudoconvexity. In some cases, for example in some scheduling algorithms, FLPs can be solved by a variant of t |
References ]]).<ref> {{cite article | last1=Kruk | first1=Serge|last2=Wolkowicz|first2=Henry|title=Pseudolinear programming | url=http://www.jstor.org/stable/2653207 |journal=SIAM Review|volume=41 |
||
Line 5:
For example, if in the frame of LP we maximize '''profit = income − cost''' and obtain maximal profit of 100 units (= $1100 of income − 1000$ of cost), then using LFP we can obtain only $10 of profit which requires only $50 of investment. Thus, in LP we have efficiency $100/$1000 = 0.1, at the same time LFP provides efficiency equal to $10/$50 = 0.2.
Fractional-linear programs are [[convex minimization]] problems with a special property, pseudoconvexity. In some cases, for example in some scheduling algorithms, FLPs can be solved by a variant of the [[simplex algorithm]] (of [[George
</ref><ref> {{cite article | last1=Mathis|first1=Frank H.|last2=Mathis|first2=Lenora Jane|title=A nonlinear programming algorithm for hospital management |url=http://www.jstor.org/stable/2132826|journal=[[SIAM Review]]|volume=37 |year=1995 |number=2 |pages=230-234|id={{MR|1343214}}.{{jstor|2132826}}.{{doi|DOI:10.1137/1037046}}|}}
</ref>
== References ==
| |||