Pseudoconvex optimization for a special problem of paint industry

DOI10.1016/0377-2217(94)90064-7zbMath0813.90087OpenAlexW1985696061MaRDI QIDQ1342653

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

Publication date: 12 January 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90064-7

zbMATH Keywords

pseudoconvexityKubelka-Munk theorynonconvex objective function

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26)

Related Items (1)

On the dual of linear inverse problems

Cites Work

• I-divergence geometry of probability distributions and minimization problems
• Linearly constrained estimation by mathematical programming
• M.D.I. estimation via unconstrained convex programming
• Finding the nearest point in A polytope
• Large-scale linearly constrained optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pseudoconvex optimization for a special problem of paint industry