Name

finalresult — Gives minimizers (Lsol) at which Global Minimum (zcap) estimate will lie

Calling Sequence

[Lsol]=finalresult(D1,ex1,ex,zcap,LXsol)

Parameters

D1 :

Total Number of Bvermin (minimum value at vertices)

ex1 :

Tolerence on Bounds

ex :

Tolerence on Global Minimum Estimate

zcap:

Global Minimum Estimate

LXsol :

All minimzers at which Global Minimum may lie

Lsol :

Final calculated minimzers at which Global Minimum will lie

Description

Finding out the global minimum and minimizers (bounds) for given polynomial function.

See also

vertex, store

Authors

Mr. Dhiraj B. Magare
IDP in System and Control Engineering
Indian Institute of Technology Bombay
Mr. Bhagyesh V. Patil
IDP in System and Control Engineering
Indian Institute of Technology Bombay
Prof. P.S.V. Nataraj
IDP in System and Control Engineering
Indian Institute of Technology Bombay

Bibliography

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.