| Abstract: | This article introduces an extension of the linear-programming formulation algorithm already known. A method for the calculation of suboptimal recipes involving a reduced number of colorants is outlined, as well as the possibility of taking into account the effect of incompatibility between pairs of colorants from the complete inventory. Both improvements are based on the introduction of mixed-integer programming techniques, and result in increased usefulness of linear programming for practical applications. A numerical example showing the results obtained with the proposed algorithm is presented. |
