This article proposes a new approach based on linear programming optimization to solve the problem of determining the color of a complex fractal carpet pattern. The principle is aimed at finding suitable dyes for mixing and their exact concentrations, which, when applied correctly, gives the desired color. The objective function and all constraints of the model are expressed linearly according to the solution variables. Carpet design has become an emerging technological field known for its creativity, science and technology. Many carpet design concepts have been analyzed in terms of color, contrast, brightness, as well as other mathematical concepts such as geometric changes and formulas. These concepts represent a common process in the carpet industry. This article discusses the use of complex fractal images in carpet design and simplex optimization in color selection.

No abstract