Robust optimization for the pooling problem

J Wiebe, I Cecılio, R Misener - Industrial & Engineering Chemistry …, 2019 - ACS Publications
The pooling problem has applications, for example, in petrochemical refining, water
networks, and supply chains and is widely studied in global optimization. To date, it has …

Robust tracking commitment

A Bitlislioğlu, TT Gorecki… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
Many engineering problems that involve hierarchical control applications, such as demand-
side ancillary service provision to the power grid, can be posed as a robust tracking …

Algorithms, analysis and software for the global optimization of two-stage stochastic programs

R Kannan - 2018 - dspace.mit.edu
Optimization models in the chemical process industries often include uncertain model
parameters due to uncertainties in market forces and the environment, use of reduced-order …

How to solve a design centering problem

SM Harwood, PI Barton - Mathematical Methods of Operations Research, 2017 - Springer
This work considers the problem of design centering. Geometrically, this can be thought of
as inscribing one shape in another. Theoretical approaches and reformulations from the …

Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints

J Fu, F Tian - Automatica, 2021 - Elsevier
An algorithm is proposed for locating an optimal solution satisfying the KKT conditions to a
specified tolerance to inequality-path-constrained dynamic optimization (PCDO) problem …

Polynomial Optimization Relaxations for Generalized Semi-Infinite Programs

X Hu, J Nie - arXiv preprint arXiv:2303.14308, 2023 - arxiv.org
This paper studies generalized semi-infinite programs (GSIPs) given by polynomials. We
propose a hierarchy of polynomial optimization relaxations to solve them. They are based on …

Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming

S Harwood, F Trespalacios, D Papageorgiou… - Computational …, 2024 - Springer
Methods for finding pure Nash equilibria have been dominated by variational inequalities
and complementarity problems. Since these approaches fundamentally rely on the …

An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition

A Aboussoror, S Adly, S Salim - Optimization, 2020 - Taylor & Francis
We present an extended conjugate duality for a generalized semi-infinite programming
problem (P). The extended duality is defined in the context of the absence of convexity of …