Application of binary programming theory to product color planning with multiple constraints

Abstract Companies generally set a standard color for product color design to enhance the corporate brand image. When a given color and the planned combination of given areas contain multiple constraints, the exhaustive process that has traditionally been used to obtain the optimal color scheme is often time consuming. Therefore, this study proposes the use of binary programming theory to solve the problem of product color planning with multiple constraints. In this research, binary programming theory is first used to determine the variables of the product color matching design. Thereafter, multiple constraints are established based on various color requirements from the product color matching design, following which the color matching design goal is determined according to the aesthetic experience of the designer on the color matching design. Finally, the constrained formula is converted into a language that can be recognized by the Matlab software and input into the Optimization Tool application to calculate the final color planning scheme. The color design of an intelligent assembly product in the rail transit field is used as an example to demonstrate the operation process of the proposed solution, and the calculation results are verified by subjective questionnaires. The results reveal that the proposed method can effectively solve the problem of product color matching design with multiple constraints, can improve the efficiency of product color matching design with multiple constraints, and offers certain reliability and practicability.