Terlaky Tamas

Tamas Terlaky

Information about the author Tamas Terlaky will soon be added to the site.
Found 7 papers in total
Polynomial interior point algorithms for general linear complementarity problems
Polynomial interior point algorithms for general linear complementarity problems
2010
Linear Complementarity Problems (LCPs) belong to the class of NP-complete problems....
The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming
The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming
2000
This paper shows that managerial questions are not answered satisfactorily with the...
Finding optimal nuclear reactor core reload patterns using nonlinear optimization and search heuristics
Finding optimal nuclear reactor core reload patterns using nonlinear optimization and search heuristics
1999
A simplified but still quite realistic model of the nuclear reactor fuel management...
Basis- and partition identification for quadratic programming and linear complementarity problems
Basis- and partition identification for quadratic programming and linear complementarity problems
1999
Optimal solutions of interior point algorithms for linear and quadratic programming...
Method of approximate centers for semi-definite programming
Method of approximate centers for semi-definite programming
1997
The success of interior point algorithms for large-scale linear programming has...
Copositive relaxation for general quadratic programming
Copositive relaxation for general quadratic programming
1998
We consider general, typically nonconvex, Quadratic Programming Problems. The...
Linear complementarity and oriented matroids
Linear complementarity and oriented matroids
1992
A combinatorial abstraction of the linear complementarity theory in the setting of...
Papers per page: