Optimization of generalized desirability functions under model uncertainty

Date

2017-01-01

Author

Akteke-Ozturk, Başak
Weber, Gerhard-Wilhelm
Köksal, Gülser

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

141
views

0
downloads

Desirability functions are increasingly used in multi-criteria decision-making which we support by modern optimization. It is necessary to formulate desirability functions to obtain a generalized version with a piecewise max type-structure for optimizing them in different areas of mathematics, operational research, management science and engineering by nonsmooth optimization approaches. This optimization problem needs to be robustified as regression models employed by the desirability functions are typically built under lack of knowledge about the underlying model. In this paper, we contribute to the theory of desirability functions by our robustification approach. We present how generalized semi-infinite programming and disjunctive optimization can be used for this purpose. We show our findings on a numerical example. The robustification of the optimization problem eventually aims at variance reduction in the optimal solutions.

Subject Keywords

Multi-response surface optimization, Desirability function, Model uncertainty, Generalized semi-infinite optimization, Disjunctive optimization

URI

https://hdl.handle.net/11511/35922

Journal

OPTIMIZATION

DOI

https://doi.org/10.1080/02331934.2017.1371167

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

OPTIMIZATION OF DESIRABILITY FUNCTIONS AS A DNLP MODEL BY GAMS/BARON Öztürk, Başak; Köksal, Gülser; Weber, Gerhard Wilhelm (2010-02-04) Desirability functions of Derringer and Suich, one of the widely used approaches in multiresponse optimization, have nondifferentiable points in their formulations as a drawback. To solve the optimization problem of the overall desirability function, one way is to modify the individual desirability functions by approximation approaches and then to use the gradient based methods. Another way is to use the optimization techniques that do not employ the derivative information. In this study, we propose a new a...
An Efficient Metaheuristic Algorithm for Engineering Optimization: SOPT Hasançebi, Oğuzhan (2012-06-01) Metaheuristic algorithms are well-known optimization tools which have been employed for solving a wide range of optimization problems so far. In the present study, a simple optimization (SOPT) algorithm with two main steps; namely exploration and exploitation, is provided for practical applications. Aside from a reasonable rate of convergence attained, the ease in its implementation and dependency on few parameters only are among the advantageous characteristics of the proposed SOPT algorithm. The efficienc...
Interactive evolutionary multi-objective optimization for quasi-concave preference functions Fowler, John W.; Gel, Esma S.; Köksalan, Mustafa Murat; Korhonen, Pekka; Marquis, Jon L.; Wallenius, Jyrki (2010-10-16) We present a new hybrid approach to interactive evolutionary multi-objective optimization that uses a partial preference order to act as the fitness function in a customized genetic algorithm. We periodically send solutions to the decision maker (DM) for her evaluation and use the resulting preference information to form preference cones consisting of inferior solutions. The cones allow its to implicitly rank solutions that the DM has not considered. This technique avoids assuming an exact form for the pref...
Design of Compact Nano-Optical Couplers Involving Dielectric Nanorods Karaosmanoglu, Bariscan; Yazar, Sirin; Ergül, Özgür Salih (2018-06-01) We present optimization and design of nano-optical couplers involving dielectric nanorods. Using tens of elements, optimal array configurations are found to produce alternative responses that can be digitized. For realistic simulations, the couplers are modeled as three-dimensional structures and analyzed via surface integral equations and the multilevel fast multipole algorithm (MLFMA). Initial results are presented demonstrate the feasibility of compact but effective couplers with desired responses.
Aggregate codifferential method for nonsmooth DC optimization Tor, Ali Hakan; Bagirov, Adil; Karasözen, Bülent (2014-03-15) A new algorithm is developed based on the concept of codifferential for minimizing the difference of convex nonsmooth functions. Since the computation of the whole codifferential is not always possible, we use a fixed number of elements from the codifferential to compute the search directions. The convergence of the proposed algorithm is proved. The efficiency of the algorithm is demonstrated by comparing it with the subgradient, the truncated codifferential and the proximal bundle methods using nonsmooth o...

Citation Formats

B. Akteke-Ozturk, G.-W. Weber, and G. Köksal, “Optimization of generalized desirability functions under model uncertainty,” OPTIMIZATION, pp. 2157–2169, 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35922.