Year-end Sale % OFF 
Abstract
An improved method of candidate attainable region (AR) construction, based on an existing bounding hyperplanes approach, is presented. The method uses a plane rotation about existing extreme points, rather than a plane translation, to eliminate unachievable regions from an initial bounding set. The algorithm is shown to be faster, but has currently only been implemented for two-dimensional constructions and has been extended to include the construction of candidate ARs that involve nonisothermal kinetics in concentration and concentration−time space.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
