• Proceedings of the Korean Society of Computer Information Conference
• /
• 2020.07a
• /
• pp.83-84
• /
• 2020

Sum Utility를 최적화하는 Convex Optimization Algorithm을 제안한다. 일반적으로, Sum Utility 최적화 문제는 Non Convex Optimization Problem이다. 하지만, '상대간섭'과 '간섭주요화'를 활용하여 Non Convex Optimization Problem이 간섭구간에 따라 Convex Optimization으로 해결할 수 있음을 확인하였다. 특히, 유틸리티 함수는 상대간섭 0.1 이하에서는 오목함수임을 확인하였다. 실험결과 상대간섭이 작아질수록 제안하는 알고리즘에 의한 Sum Utility는 증가함을 확인하였다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.1
• /
• pp.19-33
• /
• 2008

In the previous double auction research for the market optimization, two basic assumptions are usually applied - (1) each trader has a linear or quasi-linear utility function of price and quantity, and (2) buyers as well as sellers have identical utility functions. However, in practice, each buyer and seller in a double auction market may have diverse utility functions for trading goods. Therefore, a flexible and integrated double auction mechanism that can integrate all traders' diverse utility functions is necessary. In particular, the flexible mechanism is more useful in a synchronous double auction because traders can properly change utilities in each round. Therefore, in this paper, we propose a flexible synchronous double auction mechanism in which traders can express diverse utility functions for the price and quantity of the goods, and optimal total market utility is guaranteed. In order to optimize the total market utility which consists of multiple complex utility functions of traders. We show the viability of the proposed mechanism through a several simulation experiments.

• East Asian mathematical journal
• /
• v.34 no.1
• /
• pp.1-16
• /
• 2018

We study an optimization problem for hyperbolic absolute risk aversion (HARA) utility function under two-factor Heston's stochastic volatility model. It is not possible to obtain an explicit solution because our financial market model is complicated. However, by using asymptotic analysis technique, we find the explicit forms of the approximations of the optimal value function and the optimal strategy for HARA utility function.

• Korean Management Science Review
• /
• v.27 no.1
• /
• pp.45-60
• /
• 2010

This study evaluates life annuity plans based on two different types of measures : financial benefit and utility on consumption. The financial benefit is measured by Money's Worth (MW) ratio and return on annuity. For the measure of utility, an optimization problem is formulated with the objective of maximizing utility on consumption. To solve the optimization model, we use Dynamic Programming (DP) technique. The both types of measures are applied to cases of Korean pre-retirees at age 40 with different accumulation years of annuity (i.e. level of annuity asset at the age of retirement) and different timings of annuitization. Our results generally indicate that the utility based optimization model is superior to the financial measures in terms of providing a better evaluation of an annuity plan due to its capability to consider an individual's financial situation during his/her retirement period. Also, they suggest that the level of annuity asset is an important factor when an individual determines the optimal annuitization timing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.473-493
• /
• 2019

5G vehicular communication is one of key enablers in next generation intelligent transportation system (ITS), that require ultra-reliable and low latency communication (URLLC). To meet this requirement, a new hybrid vehicular network structure which supports both centralized network structure and distributed structure is proposed in this paper. Based on the proposed network structure, a new vehicular network utility model considering the latency and reliability in vehicular networks is developed based on Euclidean norm theory. Building on the Pareto improvement theory in economics, a vehicular network uplink optimization algorithm is proposed to optimize the uplink utility of vehicles on the roads. Simulation results show that the proposed scheme can significantly improve the uplink vehicular network utility in vehicular networks to meet the URLLC requirements.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.7
• /
• pp.75-83
• /
• 2020

We consider the D2D utility optimization problem in the cellular system. More specifically, we develop a concave function decision rule which reduces the complexity of non-convex optimization problem. Typically, utility function, which is a function of the signal and the interference, is non-convex. In this paper, we analyze the utility function from the interference perspective. We introduce the 'relative interference' and the 'interference majorization'. The relative interference captures the level of interference at D2D receiver's perspective. The interference majorization approximates the interference by applying the major interference. Accordingly, we propose a concave function decision rule, and the corresponding convex optimization solution. Simulation results show that the utility function is concave when the relative interference is less than 0.1, which is a typical D2D usage scenario. We also show that the proposed convex optimization solution can be applied for such relative interference cases.

• Journal of applied mathematics & informatics
• /
• v.36 no.3_4
• /
• pp.301-306
• /
• 2018

I obtain the optimal portfolio and consumption strategies of an investor who have a Cobb-Douglas utility function. And I assume that there is negative wealth constraints. This constraints mean that the investor can borrow partially against her future labor income.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.193-214
• /
• 2017

In this paper, we study the problem of network utility maximization in a CSMA based multi-hop wireless network. Existing work in this aspect typically adopted continuous time Markov model for performance modelling, which fails to consider the channel conflict impact in actual CSMA networks. To maximize the utility of a CSMA based wireless network with channel conflict, in this paper, we first model its weighted network capacity (i.e., network capacity weighted by link queue length) and then propose a distributed link scheduling algorithm, called CSMA based Maximal-Weight Scheduling (C-MWS), to maximize the weighted network capacity. We derive the upper and lower bounds of network utility based on C-MWS. The derived bounds can help us to tune the C-MWS parameters for C-MWS to work in a distributed wireless network. Simulation results show that the joint optimization based on C-MWS can achieve near-optimal network utility when appropriate algorithm parameters are chosen and also show that the derived utility upper bound is very tight.

• International Journal of Precision Engineering and Manufacturing
• /
• v.1 no.1
• /
• pp.133-145
• /
• 2000

Plastic molding designers are frequently faced with optimizing multiple defects in injection molded parts. these defects are usually in conflict with each other, and thus a tradeoff needs to be made reach a final compromised solution. In this study, an automated injection molding design methodology has been developed to optimize multiple defects of injection molded parts. Two features of the proposed methodology are as follows: one is to apply the utility theory to transform the original multiple objective optimization problem into single objective optimization problem with utility as objective function, the other is an implementation of a direct search-based injection molding optimization procedure with automated consideration of process variation. The modified complex method is used as a general optimization tool in this research. The developed methodology was applied to an actual molding design and the results showed that the methodology was useful through the CAE simulation using a commercial injection molding software package. Applied to production, this study will be of immense value to industry in reducing the product development time and enhancing the product quality.

• Proceedings of the Korea Society for Energy Engineering kosee Conference
• /
• 1997.10a
• /
• pp.17-23
• /
• 1997

A methodology for on-line data reconciliation and optimization has been proposed to minimize the energy cost of a utility system. As industrial data tend to be corrupted by noise or gross error, fast and robust data reconciliation technique is essential for the on-line optimization of utility system. Thus, we propose the hierarchical decomposition approach that can be applicable to on-line data reconciliation and optimization. As this approach divides whole system into several subsystems and removes the nonlinearity of constraint systematically, it handles complexity of system easily and shows good performance in accuracy and computation speed. Through case studies, we prove that this methodology is a good candidate for on-line data reconciliation and optimization.