LAPSE:2025.0385
Published Article

LAPSE:2025.0385
Flexibility Assessment via Affine Bounds Evaluation
June 27, 2025
Abstract
Process design deals with the problem of finding the best process set-up, subject to a set of constraints defining the design space (DSp). This selection is guided primarily by economic considerations. Flexibility may also play an important factor in process design, since it embodies how far from the design spaces bounds are the candidate optimal designs, which in some cases may lead to off-spec products. This work proposes a novel approach for flexibility assessment. In design problems where the design space is constrained by a set of affine bounds, flexibility may be expressed either as the minimum or the maximum distance with respect to the feasible (design) space bounds. For any point in the DSp, the minimum distance provides a good indicator on the minimum flexibility, as the direction that represents the highest risk of violating the constraints. An analogous conclusion can be drawn between the maximum distance and maximum flexibility. These distances can be computed exactly via geometrical approaches, enabling the calculation of a minimum-based and maximum-based flexibility metrics for all points in the DSp. This class of problems are in fact multiparametric programming problems as the goal is to obtain comprehensive flexibility maps, rather than investigating unique points in the DSp. In the case of minimum flexibility, their solutions comprise: (i) a set of critical regions defining a convex hull within the DSp (each associated with a unique nearest bound of the feasible space), (ii) the corresponding optimizer functions (projection at nearest bound), and (iii) objective functions (minimum distance). A novel framework is under development for this class of problems. It enables a new paradigm for flexibility assessment, which can be applied to design problems of any dimension. Complexity is significantly reduced in comparison with the classic multiparametric programming approaches, since only a limited number of active sets need to be considered during solution calculation.
Process design deals with the problem of finding the best process set-up, subject to a set of constraints defining the design space (DSp). This selection is guided primarily by economic considerations. Flexibility may also play an important factor in process design, since it embodies how far from the design spaces bounds are the candidate optimal designs, which in some cases may lead to off-spec products. This work proposes a novel approach for flexibility assessment. In design problems where the design space is constrained by a set of affine bounds, flexibility may be expressed either as the minimum or the maximum distance with respect to the feasible (design) space bounds. For any point in the DSp, the minimum distance provides a good indicator on the minimum flexibility, as the direction that represents the highest risk of violating the constraints. An analogous conclusion can be drawn between the maximum distance and maximum flexibility. These distances can be computed exactly via geometrical approaches, enabling the calculation of a minimum-based and maximum-based flexibility metrics for all points in the DSp. This class of problems are in fact multiparametric programming problems as the goal is to obtain comprehensive flexibility maps, rather than investigating unique points in the DSp. In the case of minimum flexibility, their solutions comprise: (i) a set of critical regions defining a convex hull within the DSp (each associated with a unique nearest bound of the feasible space), (ii) the corresponding optimizer functions (projection at nearest bound), and (iii) objective functions (minimum distance). A novel framework is under development for this class of problems. It enables a new paradigm for flexibility assessment, which can be applied to design problems of any dimension. Complexity is significantly reduced in comparison with the classic multiparametric programming approaches, since only a limited number of active sets need to be considered during solution calculation.
Record ID
Keywords
Flexibility, Multiparametric Programming, Process Design
Subject
Suggested Citation
Narciso DAC, Sachio S, Papathanasiou MM. Flexibility Assessment via Affine Bounds Evaluation. Systems and Control Transactions 4:1450-1455 (2025) https://doi.org/10.69997/sct.121782
Author Affiliations
Narciso DAC: Centro de Recursos Naturais e Ambiente, Department of Chemical Engineering, Instituto Superior Técnico, University of Lisbon, 1049-001 Lisboa, Portugal
Sachio S: The Sargent Centre for Process Systems Engineering, Imperial College London, London SW7 2AZ, UK; Department of Chemical Engineering, Imperial College London, London SW7 2AZ, UK
Papathanasiou MM: The Sargent Centre for Process Systems Engineering, Imperial College London, London SW7 2AZ, UK; Department of Chemical Engineering, Imperial College London, London SW7 2AZ, UK
Sachio S: The Sargent Centre for Process Systems Engineering, Imperial College London, London SW7 2AZ, UK; Department of Chemical Engineering, Imperial College London, London SW7 2AZ, UK
Papathanasiou MM: The Sargent Centre for Process Systems Engineering, Imperial College London, London SW7 2AZ, UK; Department of Chemical Engineering, Imperial College London, London SW7 2AZ, UK
Journal Name
Systems and Control Transactions
Volume
4
First Page
1450
Last Page
1455
Year
2025
Publication Date
2025-07-01
Version Comments
Original Submission
Other Meta
PII: 1450-1455-1418-SCT-4-2025, Publication Type: Journal Article
Record Map
Published Article

LAPSE:2025.0385
This Record
External Link

https://doi.org/10.69997/sct.121782
Article DOI
Download
Meta
Record Statistics
Record Views
753
Version History
[v1] (Original Submission)
Jun 27, 2025
Verified by curator on
Jun 27, 2025
This Version Number
v1
Citations
Most Recent
This Version
URL Here
https://psecommunity.org/LAPSE:2025.0385
Record Owner
PSE Press
Links to Related Works
References Cited
- Grossmann IE, Calfa BA, Garcia-Herreros P. Evolution of concepts and models for quantifying resiliency and flexibility of chemical processes. Comput. Aided Chem. Eng. 70:22-34 (2014) doi.org/10.1016/j.compchemeng.2013.12.013 https://doi.org/10.1016/j.compchemeng.2013.12.013
- Swaney RE, Grossmann IE. An index for operational flexibility in chemical process design. Part I: Formulation and theory. AIChE Journal 31:621-630 (1985) doi.org/10.1002/aic.690310412 https://doi.org/10.1002/aic.690310412
- Pistikopoulos EN, Mazzuchi TA. A novel flexibility analysis approach for processes with stochastic parameters. Comput. Chem. Eng. 14:991-1000 (1990) doi.org/10.1016/0098-1354(90)87055-t https://doi.org/10.1016/0098-1354(90)87055-T
- Kabatek U, Swaney RE. Worst-case identification in structured process systems. Comput. Chem. Eng. 16:1063-1071 (1992) doi.org/10.1016/0098-1354(92)80024-4 https://doi.org/10.1016/0098-1354(92)80024-4
- Banerjee I, Ierapetritou MG. Feasibility Evaluation of Nonconvex Systems Using Shape Reconstruction Techniques. Ind. Eng. Chem. Res. 44:3638-3647 (2005) doi.org/10.1021/ie049294d https://doi.org/10.1021/ie049294d
- Sachio S, Kontoravdi C, Papathanasiou MM. A model-based approach towards accelerated process development: A case study on chromatography. Chem. Eng. Res. Des. 197:800-820 (2023) doi.org/10.1016/j.cherd.2023.08.016 https://doi.org/10.1016/j.cherd.2023.08.016
- Boukouvala F, Muzzio FJ, Ierapetritou MG. Design Space of Pharmaceutical Processes Using Data-Driven-Based Methods. J. Pharm. Innov. 5:119-137 (2010) doi.org/10.1007/s12247-010-9086-y https://doi.org/10.1007/s12247-010-9086-y
- Geremia M, Bezzo F, Ierapetritou MG. A novel framework for the identification of complex feasible space. Comput. Chem. Eng. 179:108427 (2023) doi.org/10.1016/j.compchemeng.2023.108427 https://doi.org/10.1016/j.compchemeng.2023.108427
- Metta N, Ierapetritou MG. A novel adaptive sampling based methodology for feasible region identification of compute intensive models using artificial neural network. AIChE Journal 67 (2020) doi.org/10.1002/aic.17095 https://doi.org/10.1002/aic.17095
[0.25 s]

