finalresult — Gives minimizers (Lsol) at which Global Minimum (zcap) estimate will lie
[Lsol]=finalresult(D1,ex1,ex,zcap,LXsol)
Total Number of Bvermin (minimum value at vertices)
Tolerence on Bounds
Tolerence on Global Minimum Estimate
Global Minimum Estimate
All minimzers at which Global Minimum may lie
Final calculated minimzers at which Global Minimum will lie
// Gives minimizers (Lsol) at which Global Minimum (zcap) estimate will lie. [Lsol]=finalresult(D1,ex1,ex,zcap,LXsol) //Applying tolerance condition on list of LXsol and D1. This function returns Global Minimizers Lsol.
Mr. Dhiraj B. Magare |
IDP in Systems and Control Engineering |
Indian Institute of Technology Bombay |
Mr. Bhagyesh V. Patil |
IDP in Systems and Control Engineering |
Indian Institute of Technology Bombay |
Prof. P.S.V. Nataraj |
IDP in Systems and Control Engineering |
Indian Institute of Technology Bombay |
1. Shashwati Ray, P.S.V. Nataraj. An efficient algorithm for range computation of polynomials using the Bernstein form. Journal of Global Optimization, 45: 403-426,2009;
2. G. T. Cargo and O. Shisha. The Bernstein form of a polynomial. Jl. of research of NBS,70B:79-81,1966.
3. S. Ray, A new approach to range computation of polynomial problems using the Bernstein form. PhD thesis, Systems and Control Engineering, IIT Bombay, India, 2007.