• Journal of the Korean Mathematical Society
• /
• v.47 no.1
• /
• pp.17-28
• /
• 2010

In this paper we deal with linear chance-constrained optimization problems, a class of problems which naturally arise in practical applications in finance, engineering, transportation and scheduling, where decisions are made in presence of uncertainty. After giving the deterministic equivalent formulation of a linear chance-constrained optimization problem we construct a conjugate dual problem to it. Then we provide for this primal-dual pair weak sufficient conditions which ensure strong duality. In this way we generalize some results recently given in the literature. We also apply the general duality scheme to a portfolio optimization problem, a fact that allows us to derive necessary and sufficient optimality conditions for it.

• Korean Management Science Review
• /
• v.29 no.1
• /
• pp.57-71
• /
• 2012

In this paper, we deal with a sector investment strategy by implementing the black-litterman model that incorporates expert evaluation and sector rotation momentum. Expert evaluation analyzes the relative performance of the industry sector compared with the market, while sector rotation momentum reflects the price impact of significant sector anomaly. In addition, we consider the portfolio impact of sector cardinality and weight constraints within the context of mean-variance portfolio optimization. Finally, we demonstrate the empirical viability of the proposed sector investment strategy with KOSPI 200 data.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.659-662
• /
• 1998

In this paper, lower and upper possibility distributions are identified to reflect two extreme opinions in portfolio selection problems based on upper and lower possibility distributions are formalized as quadratic programming problems. Portfolios for compromising two extreme opinions from upper and lower possibility distributions and balancing the opinions of a group of experts can be obtained by quadratic optimization problems, respectively.

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

• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.3
• /
• pp.571-576
• /
• 2013

In this paper, we solve the optimal investment problem when the investor gets labor income and may have a wage increase. We assume the investor has constant absolute risk aversion(CARA) utility and obtain closed form solutions.

• Korean Management Science Review
• /
• v.28 no.2
• /
• pp.1-16
• /
• 2011

In this study we suggested two optimization models to answer a question from an investor standpoint : how many convertible bonds should one convert, and how many keep? One model minimizes certain risk to the minimum required expected return, the other maximizes the expected return subject to the maximum acceptable risk. In comparison with Markowitz portfolio models, which use the variance of return, our models used Conditional Value-at-Risk(CVaR) for risk measurement. As a coherent measurement, CVaR overcomes the shortcomings of Value-at-Risk(VaR). But there are still difficulties in solving CVaR including optimization models. For this reason, we adopted Rockafellar and Uryasev's[18, 19] approach. Then we could approximate the models as linear programming problems with scenarios. We also suggested to extend the models with credit risk, and applied examples of our models to Hynix 207CB, a convertible bond issued by the global semiconductor company Hynix.

• Industrial Engineering and Management Systems
• /
• v.15 no.1
• /
• pp.63-76
• /
• 2016

Multiperiod portfolio selection problem attracts more and more attentions because it is in accordance with the practical investment decision-making problem. However, the existing literature on this field is almost undertaken by regarding security returns as random variables in the framework of probability theory. Different from these works, we assume that security returns are uncertain variables which may be given by the experts, and take absolute deviation as a risk measure in the framework of uncertainty theory. In this paper, a new multiperiod mean absolute deviation uncertain portfolio selection models is presented by taking transaction costs, borrowing constraints and threshold constraints into account, which an optimal investment policy can be generated to help investors not only achieve an optimal return, but also have a good risk control. Threshold constraints limit the amount of capital to be invested in each stock and prevent very small investments in any stock. Based on uncertain theories, the model is converted to a dynamic optimization problem. Because of the transaction costs, the model is a dynamic optimization problem with path dependence. To solve the new model in general cases, the forward dynamic programming method is presented. In addition, a numerical example is also presented to illustrate the modeling idea and the effectiveness of the designed algorithm.

• Industrial Engineering and Management Systems
• /
• v.16 no.1
• /
• pp.118-128
• /
• 2017

Uncertain factors in finical markets make the prediction of future returns and risk of asset much difficult. In this paper, a model,assuming the admissible errors on expected returns and risks of assets, assisted in the multiperiod mean variance portfolio selection problem is built. The model considers transaction costs, upper bound on borrowing risk-free asset constraints, cardinality constraints and threshold constraints. Cardinality constraints limit the number of assets to be held in an efficient portfolio. At the same time, threshold constraints limit the amount of capital to be invested in each stock and prevent very small investments in any stock. Because of these limitations, the proposed model is a mix integer dynamic optimization problem with path dependence. The forward dynamic programming method is designed to obtain the optimal portfolio strategy. Finally, to evaluate the model, our result of a meaning example is compared to the terminal wealth under different constraints.

• Journal of Korean Institute of Industrial Engineers
• /
• v.39 no.6
• /
• pp.535-545
• /
• 2013

The goal of stock investment is earning high rate or return with stability. To accomplish this goal, using a portfolio that distributes stocks with high rate of return with less variability and a stock price prediction model with high accuracy is required. In this paper, three methods are suggested to require these conditions. First of all, in portfolio re-balance part, Max-Return and Min-Risk (MRMR) model is suggested to earn the largest rate of return with stability. Secondly, Entering/Leaving Rule (E/L) is suggested to upgrade portfolio when particular stock's rate of return is low. Finally, to use outstanding stock price prediction model, a model based on Semi-Supervised Learning (SSL) which was suggested in last research was applied. The suggested methods were validated and applied on stocks which are listed in KOSPI200 from January 2007 to August 2008.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.3
• /
• pp.139-143
• /
• 2023

The product portfolio problem(PPP) is an optimization problem that determines the production quantity of a particular product to obtain the maximum profit among the n products. Linear programming(LP) is known as the only way to solve this optimization problem. The linear programming method is a problem that optimizes n linear functions and uses LINGO or Excel solver. This paper proposes a simple algorithm that uses CPR, a product cost-profit ratio, to sort in CPR descending order and then determines the maximum allowed production quantity by hand as the actual production quantity. As a result of applying the proposed algorithm to six experimental data, it was shown that more accurate results can be obtained compared to the linear programming method.