Generalized desirability functions: a structural and topological analysis of desirability functions

Date

2020-01-02

Author

Akteke-Öztürk, 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

235
views

0
downloads

We have Derringer and Suich’s desirability functions in mind,especially, the two-sided ones in our analysis throughout thisstudy. We propose and develop a finite partitioning procedureof the individual desirability functions over their compact andconnected interval which leads to the definition of generalized desirability functions. We call the negative logarithm ofan individual desirability function having a max-type structureand including a finite number of nondifferentiable points asa generalized individual desirability function. By introducingcontinuous selection functions into desirability functions and,especially, employing piecewise max-type functions, it is possible to describe some structural and topological properties ofthese generalized functions. Our aim with this generalization isto show the mechanism that gives rise to a variation and extension in the structure of functions used in classical desirabilityapproaches.

Subject Keywords

Management Science and Operations Research, Control and Optimization, Applied Mathematics

URI

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

Journal

Optimization

DOI

https://doi.org/10.1080/02331934.2019.1570192

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Effective optimization with weighted automata on decomposable trees Ravve, E. V.; Volkovich, Z.; Weber, Gerhard Wilhelm (Informa UK Limited, 2014-01-02) In this paper, we consider quantitative optimization problems on decomposable discrete systems. We restrict ourselves to labeled trees as the description of the systems and we use weighted automata on them as our computational model. We introduce a new kind of labeled decomposable trees, sum-like weighted labeled trees, and propose a method, which allows us to reduce the solution of an optimization problem, defined in a fragment of Weighted Monadic Second Order Logic, on such a tree to the solution of effec...
The semismooth approach for semi-infinite programming under the Reduction Ansatz Stein, Oliver; Tezel, Aysun (Springer Science and Business Media LLC, 2008-06-01) We study convergence of a semismooth Newton method for generalized semi-infinite programming problems with convex lower level problems where, using NCP functions, the upper and lower level Karush-Kuhn-Tucker conditions of the optimization problem are reformulated as a semismooth system of equations. Nonsmoothness is caused by a possible violation of strict complementarity slackness. We show that the standard regularity condition for convergence of the semismooth Newton method is satisfied under natural assu...
Neural network calibrated stochastic processes: forecasting financial assets Giebel, Stefan; Rainer, Martin (Springer Science and Business Media LLC, 2013-03-01) If a given dynamical process contains an inherently unpredictable component, it may be modeled as a stochastic process. Typical examples from financial markets are the dynamics of prices (e.g. prices of stocks or commodities) or fundamental rates (exchange rates etc.). The unknown future value of the corresponding stochastic process is usually estimated as the expected value under a suitable measure, which may be determined from distribution of past (historical) values. The predictive power of this estimati...
Finding nadir points in multi-objective integer programs Köksalan, Mustafa Murat; LOKMAN, BANU (Springer Science and Business Media LLC, 2015-05-01) Let H be a subgroup of a finite group G, and suppose that H contains a Sylow p-subgroup P of G. Write N=NG(H)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N = \mathbf{N}_{G}(H)$$\end{document}, and assume that the Sylow p-subgroups of H boolean AND Hg\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usep...
Supersymmetric solutions of PT-/non-PT-symmetric and non-Hermitian central potentials via Hamiltonian hierarchy method Faridfathi, G; Sever, Ramazan; Aktas, M (Springer Science and Business Media LLC, 2005-11-01) The supersymmetric solutions of PT-/non-PT-symmetric and non-Hermitian deformed Morse and Poschl-Teller potentials are obtained by solving the Schrodinger equation. The Hamiltonian hierarchy method is used to get the real energy eigenvalues and corresponding eigenfunctions.

Citation Formats

B. Akteke-Öztürk, G.-W. Weber, and G. Köksal, “Generalized desirability functions: a structural and topological analysis of desirability functions,” Optimization, pp. 115–130, 2020, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36214.