Comments on "Quasi-min-max MPC algorithm for LPV systems" by Y. Lu and Y. Arkun, Automatica 36 (2000) 527-540

This note shows that the solvability of the modified quasi-min-max MPC algorithm of the paper Lu and Arkun, Automatica 36 (2000) 527 for the systems with input constraints is not guaranteed and the proof of the theorems are not sufficient via a counterexample of the Remark 5.