Content deleted Content added
m Various citation cleanup, replaced: |url=http://www.jstor.org/stable/3689647 → |jstor=3689647, |url=http://dx.doi.org/ → |doi= (7), typos fixed: an an → an using AWB |
→Other optimization problems with linear constraints: linear-complementarity problem with "sufficient matrices" (which generalize both [[positive definite matrix|positive-definite matrices] |
||
Line 38:
===Other optimization problems with linear constraints===
There are variants of the criss-cross algorithm for linear programming, for [[quadratic programming]], and for the [[linear complementarity problem|linear-complementarity problem]] with "[[sufficient matrix|sufficient matrices]]" (which generalize both [[positive definite matrix|positive-definite matrices]] and [[P-matrix|''P''-matrices]], which have all [[principal minor]]s positive).<ref name="FukudaTerlaky"/><ref name="FTNamiki"/><ref name="FukudaNamikiLCP" >{{harvtxt|Fukuda|Namiki|1994|}}</ref><ref name="OMBook" >{{cite book|last=Björner|first=Anders|last2=Las Vergnas|first2=Michel|last3=Sturmfels|first3=Bernd|authorlink3=Bernd Sturmfels|last4=White|first4=Neil|last5=Ziegler|first5=Günter|authorlink5=Günter M. Ziegler|title=Oriented Matroids|chapter=10 Linear programming|publisher=Cambridge University Press|year=1999|isbn=9780521777506|url=http://ebooks.cambridge.org/ebook.jsf?bid=CBO9780511586507|pages=417–479|doi=10.1017/CBO9780511586507|MR=1744046}}</ref><ref
url=http://www.cs.elte.hu/opres/orr/download/ORR03_1.pdf|format=pdf|url2=http://www.tandfonline.com/doi/abs/10.1080/10556780500095009|eprint=http://www.tandfonline.com/doi/pdf/10.1080/10556780500095009|mr=2195759|ref=harv}}</ref> The criss-cross algorithm has been adapted also for [[linear-fractional programming]].<ref name="LF99Hyperbolic"/><ref name="Bibl"/>
===Vertex enumeration===
| |||