We present an interval global optimization algorithm using a modified monotonicity test, The improvement applies to constrained problems and can result in significant speedup, when constraints are sparse, i.e. they "bind" a few of the variables, not all of them. A theorem that ensures the correctness of the new tool, is given and proved. The improved method is applied to an economic problem of setting optimal prices on a couple of products. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Kubica, B. J., & Niewiadomska-Szynkiewicz, E. (2007). An improved interval global optimization method and its application to price management problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4699 LNCS, pp. 1055–1064). Springer Verlag. https://doi.org/10.1007/978-3-540-75755-9_123
Mendeley helps you to discover research relevant for your work.