View Author

Terlaky, T.

( T. Terlaky)


solution interval theorem partition value value function problem function transition-point proof linearity interval linearity point curvy-linearity interval algorithm approach right result curvy-linearity vector section programming domain lemma sensitivity analysis corollary analysis linearity intervals di erentiable 2 1 solution x range element linearity interval 1 x 2 p perturbation chapter sensitivity price shadow xt qx value function g shadow prices point methods vector b partition approach di erent x 2 qp value function f x t c x t qx method erentiable dimension duality theorem vector c iteration basis number solution y erent curvy-linearity interval 1 2 domf nonnegative vectors b lemma 53 e cient frontier derivative nonextreme transition-point curvy-linearity intervals parameter limit state matrix subinterval example nite number theorem 40 shadow price 1 2




3 Most Recent Publications

Sensitivity Analysis in (Degenerate) Quadratic Programming (Research Paper)
Berkelaar, A.B. Jansen, B. Roos, K. Terlaky, T.
1996-01-01
Basis- and tripartition identification for quadratic programming and lineair complementary problems; From an interior solution to an optimal basis and viceversa (Research Paper)
Berkelaar, A.B. Jansen, B. Roos, K. Terlaky, T.
1996-01-01
The Optimal Set and Optimal Partition Approach to Linear and Quadratic Programming (Research Paper)
Berkelaar, A.B. Roos, K. Terlaky, T.
1996-01-01