Abstract
In this paper we revisit the explicit MPC representation and related notions. We point to the special structure of the constraint matrices and exploit it in order to provide novel results. We give an upper bound for the collection of admissible active sets with use in the mixed integer representation of the KKT problem and a partial recursive description of the explicit partitioning of the MPC problem. The results are tested over illustrative examples.
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.
