Pseudoconvex optimization for a special problem of paint industry

Tibor Illés, János Mayer, Tamás Terlaky

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


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, that 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.
Original languageEnglish
Pages (from-to)537-548
Number of pages12
JournalEuropean Journal of Operational Research
Issue number3
Publication statusPublished - 22 Dec 1994


  • nonconvex optimization
  • pseudoconvexity
  • Kubelka-Munk theory


Dive into the research topics of 'Pseudoconvex optimization for a special problem of paint industry'. Together they form a unique fingerprint.

Cite this