Mixed-integer quadratic
programming (MIQP) is a competitive and
tuning-free method for process data rectification, but the problem-solving
efficiency of this method must be enhanced for online application
to large-scale processes. Therefore, in this work, we propose reducing
the solution time of the MIQP model by tightening the model’s
feasible region using a statistical test for bias detection; then,
a novel, tighter, and Monte Carlo tuning-free MIQP model is devised.
Moreover, we also develop a novel nonredundant mixed-integer reformulation
of absolute inequality constraints, which is more parsimonious than
the established formulation. With a large-scale case from the literature,
the performances of the tighter MIQP with different model parameter
values are evaluated, analyzed, and compared to the original MIQP;
the optimal value of model parameter is recommended; and the computational
advantage of the tighter MIQP is shown by the results.