Abstract

A critical factor for automated method development in chromatography is the maximization or minimization of an objective function describing the quality (and speed) of the separation. In chromatography, this function is commonly referred to as a chromatographic response function (CRF). Many CRFs have previously been introduced, but many have unfavourable properties such as featuring multiple optima, insufficient discriminatory power, and a too strong dependence on the weight factors needed to balance resolution and time penalty components. To overcome these problems, the present study introduces a new type of CRF wherein the relative weight of the time penalty term is a self-adaptive function of the separation quality. The ability to unambiguously identify the optimal gradient settings of this newly proposed CRF is compared to that of some of the most frequently used CRFs in a study covering 100 randomly composed in silico samples. Doing so, the new CRF is found to flawlessly lead to the correct solution (=linear gradient parameters providing the highest resolution in the shortest potential time) in 100 % of the cases, while the most frequently used literature CRFs were off-target for about 50 to 60 % of the samples, even when considering the availability of spectral peak shape data. Some slight alterations to the proposed CRF are introduced and discussed as well.

Full Text
Paper version not known

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 call

Disclaimer: 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.