Answers are grounded in this paper and cite their sources.
This article presents an application of linear programming (LP) to optimize colorant mixtures complying with previously established color‐difference tolerances. Linearized CIE L* a* b* color‐difference equations are the main constraints for the LP model proposed here. In addition, the use of LP allows the inclusion of extra constraints derived from pigment loading requirements. The same LP algorithm can be applied for colorant formulation or batch correction. A quadratic programming algorithm to perform the minimization of color difference is also described.
No takes yet. Share an insight, caveat, or question.
Cogno et al. (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: