Pseudoconvex optimization for a special problem of paint industry

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

doi:10.1016/0377-2217(94)90064-7

Pseudoconvex optimization for a special problem of paint industry

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

Management Science

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	537-548
Number of pages	12
Journal	European Journal of Operational Research
Volume	79
Issue number	3
DOIs	https://doi.org/10.1016/0377-2217(94)90064-7
Publication status	Published - 22 Dec 1994

Keywords

nonconvex optimization
pseudoconvexity
Kubelka-Munk theory

Access to Document

10.1016/0377-2217(94)90064-7

Cite this

@article{2b721a98ec3645e3ac4865b6078fb42b,

title = "Pseudoconvex optimization for a special problem of paint industry",

abstract = "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.",

keywords = "nonconvex optimization, pseudoconvexity, Kubelka-Munk theory",

author = "Tibor Ill{\'e}s and J{\'a}nos Mayer and Tam{\'a}s Terlaky",

year = "1994",

month = dec,

day = "22",

doi = "10.1016/0377-2217(94)90064-7",

language = "English",

volume = "79",

pages = "537--548",

journal = "European Journal of Operational Research",

issn = "0377-2217",

number = "3",

}

TY - JOUR

T1 - Pseudoconvex optimization for a special problem of paint industry

AU - Illés, Tibor

AU - Mayer, János

AU - Terlaky, Tamás

PY - 1994/12/22

Y1 - 1994/12/22

N2 - 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.

AB - 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.

KW - nonconvex optimization

KW - pseudoconvexity

KW - Kubelka-Munk theory

U2 - 10.1016/0377-2217(94)90064-7

DO - 10.1016/0377-2217(94)90064-7

M3 - Article

SN - 0377-2217

VL - 79

SP - 537

EP - 548

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

Pseudoconvex optimization for a special problem of paint industry

Abstract

Keywords

Access to Document

Fingerprint

Cite this