Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Cogno, D. Jungman, J. Conno (1988)
Linear and quadratic optimization algorithms for computer color matchingColor Research and Application, 13
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.
Color Research & Application – Wiley
Published: Feb 1, 1988
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.