Content deleted Content added
RjwilmsiBot (talk | contribs) m →References: fixing page range dashes using AWB (7560) |
* {{cite journal|title=The finite criss-cross method for hyperbolic programming|journal=European Journal of Operational Research|volume=114|number=1| pages=198–214|year=1999|issn=0377-2217|doi=10.1016/S0377-2217(98)00049-6|url=http://www.sciencedir |
||
Line 8:
Chapter five: {{cite book| last=Craven|first=B. D.|title=Fractional programming|series=Sigma Series in Applied Mathematics|volume=4|publisher=Heldermann Verlag|___location=Berlin|year=1988|pages=145|isbn=3-88538-404-3 |id={{MR|949209}}| }}</ref><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 |year=1999 |number=4 |pages=795-805 |id={{MR|1723002}}.{{jstor|2653207}}.{{doi|DOI:10.1137/S0036144598335259}}| }}
</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> FLP problems can also be solved by the [[criss-cross algorithm]], which is a "purely combinatorial" [[exchange algorithm|basis-exchange algorithm]].<ref>{{cite journal|title=The finite criss-cross method for hyperbolic programming|journal=European Journal of Operational Research|volume=114|number=1|
pages=198–214|year=1999|issn=0377-2217|doi=10.1016/S0377-2217(98)00049-6|url=http://www.sciencedirect.com/science/article/B6VCT-3W3DFHB-M/2/4b0e2fcfc2a71e8c14c61640b32e805a|first1=Tibor|last1=Illés|first2=Ákos|last2=Szirmai|first3=Tamás|last3=Terlaky|ref=harv}}</ref>
== References ==
| |||