Pseudoconvex optimization for a special problem of paint industry

A new mathematical programming model is presented for the computer color formulation problem. The model is essentially based on the two-constant Kubelka–Munk theory, which describes most of the necessary physical properties of this problem. The model is a nonconvex programming problem. It has a nonconvex objective function with some nice pseudoconvexity properties. The set of feasible solutions is a relatively simple polyhedron. An algorithm is also proposed to solve the problem.