We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
We consider the standard pooling problem with a single quality parameter, which is a polynomial global optimization problem occurring among other places in the oil industry. In this paper, we show that if the feasible set has a nonempty interior, the problem can be solved by a hierarchy of semidefinite relaxations in which the resulting sequences of their optimal values converge to the global optimum. For a fixed relaxation order, this technique provides tight lower bounds for the global objective function value. Based on the experiments, for low order relaxations, the lower bound provided by this method matches the true global optimum in several instances
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.