• Bulletin of the Korean Mathematical Society
• /
• v.50 no.2
• /
• pp.589-599
• /
• 2013

In this paper, we propose a sufficient condition for the existence of solutions to general variational inequality problems (GVI(K, F, $g$)). The condition is also necessary when F is a $g-P^M_*$ function. We also investigate the boundedness of the solution set of (GVI(K, F, $g$)). Furthermore, we show that when F is norm-coercive, the general complementarity problems (GCP(K, F, $g$)) has a nonempty compact solution set. Finally, we establish some existence theorems for (GNCP(K, F, $g$)).

• Structural Engineering and Mechanics
• /
• v.6 no.8
• /
• pp.857-870
• /
• 1998

This paper deals with a special class of inverse problems in discrete structural plasticity involving the identification of elastic limits and hardening moduli on the basis of information on displacements. The governing equations lead naturally to a special and challenging optimization problem known as a Mathematical Program with Equilibrium Constraints (MPEC), a key feature of which is the orthogonality of two sign-constrained vectors or so-called "complementarity" condition. We investigate numerically the application of two simple algorithms, both based on the use of the general purpose nonlinear programming code CONOPT accessed via the GAMS modeling language, for solving the suitably reformulated problem. Application is illustrated by means of two numerical examples.

• Information Systems Review
• /
• v.12 no.1
• /
• pp.107-130
• /
• 2010

Knowledge management strategy is considered a key determinant of successful knowledge management. However, theoretical and empirical researchers disagree on how knowledge management strategies improve firms' performance. The inconsistent results of prior studies may be attributed to the fact that complementary relationships among knowledge management strategies have not been adequately taken into consideration. While the previous literature has focused on investigating the impact of knowledge sourcing strategies on firms' performance one-at-a-time, in reality firms adopt several different knowledge management strategies together. By drawing on complementarity theory, this study revisits this research problem and develops three complementarity hypotheses. Surveys collected from 139 firms in Korea were analyzed to test the hypotheses by using super modularity function. The results confirmed complementary relationships between system- and person-oriented, and between internal- and external-oriented knowledge management strategies. Our results found no complementarity among the four different knowledge management strategies. This study sheds new light on knowledge management research by developing a new conceptual framework and using advanced analytical approaches to explore the relationship between knowledge management strategies and firms' performance. Implications for practice highlight that a successful knowledge management strategy requires a judicious combination of system- and person-oriented, or of internal- and external-oriented knowledge management strategies.

• Journal of applied mathematics & informatics
• /
• v.3 no.2
• /
• pp.149-156
• /
• 1996

We discuss sensitivity of equilibrium points in bimatrix games depending on small variances (perturbations) of data. Applying implicit function theorem to a linear complementarity problem which is equivalent to the bimatrix game we investigate sensitivity of equi-librium points with respect to the perturbation of parameters in the game. Namely we provide the calculation of equilibrium points deriva-tives with respect to the parameters.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1992.04b
• /
• pp.3-9
• /
• 1992

참가자가 두명인 쌍행렬게임에서 각 참가자의 전략선택에 따른 이득행렬이 부정확한 상황일 경우를 고려하였다. 이러한 퍼지쌍행렬게임의 해를 구하는 방법으로 퍼지숫자간의 순위관계의 결과인 대소관계를 적용하여 선형상보문제화하는 과정을 제시하였다.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.211-225
• /
• 2014

A new class of smoothing functions is introduced in this paper, which includes some important smoothing complementarity functions as its special cases. Based on this new smoothing function, we proposed a smoothing Newton method. Our algorithm needs only to solve one linear system of equations. Without requiring the nonemptyness and boundedness of the solution set, the proposed algorithm is proved to be globally convergent. Numerical results indicate that the smoothing Newton method based on the new proposed class of smoothing functions with ${\theta}{\in}(0,1)$ seems to have better numerical performance than those based on some other important smoothing functions, which also demonstrate that our algorithm is promising.

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.653-668
• /
• 2011

This paper presents a new hybrid method for solving nonlinear complementarity problems with $P_0$-functions. It can be regarded as a combination of smoothing trust region method with ODE-based method and line search technique. A feature of the proposed method is that at each iteration, a linear system is only solved once to obtain a trial step, thus avoiding solving a trust region subproblem. Another is that when a trial step is not accepted, the method does not resolve the linear system but generates an iterative point whose step-length is defined by a line search. Under some conditions, the method is proven to be globally and superlinearly convergent. Preliminary numerical results indicate that the proposed method is promising.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.13 no.3
• /
• pp.189-202
• /
• 2009

In this paper we propose new primal-dual interior point algorithms for $P_*(\kappa)$ linear complementarity problems based on a new class of kernel functions which contains the kernel function in [8] as a special case. We show that the iteration bounds are $O((1+2\kappa)n^{\frac{9}{14}}\;log\;\frac{n{\mu}^0}{\epsilon}$) for large-update and $O((1+2\kappa)\sqrt{n}log\frac{n{\mu}^0}{\epsilon}$) for small-update methods, respectively. This iteration complexity for large-update methods improves the iteration complexity with a factor $n^{\frac{5}{14}}$ when compared with the method based on the classical logarithmic kernel function. For small-update, the iteration complexity is the best known bound for such methods.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.4
• /
• pp.120-128
• /
• 2011

Recent development of communication technology and evolution of telecommunications services, various needs of users are giving Telecom operators difficulties in discovering new services and its promotion strategies. In addition, at the launching of new services, if carriers does not consider complementary and substitution relationships with competing services or self-encroachment problem with the existing service profitability is reduced or lost in the current market. In this study, by analyzing usage pattern of telecommunications services respect to changes in supply and demand environment, the complementarity/substitutability analysis and systematic analytical framework is proposed. This study proposes approaches to establish mobile operators' business strategies and to identify new services demand.

• East Asian mathematical journal
• /
• v.25 no.1
• /
• pp.55-68
• /
• 2009

In this paper we propose new large-update primal-dual inte-rior point algorithms for $P_*(\kappa)$ linear complementarity problems(LCPs). New search directions and proximity measures are proposed based on the kernel function$\psi(t)=\frac{t^{p+1}-1}{p+1}+\frac{e^{\frac{1}{t}}-e}{e}$,$p{\in}$[0,1]. We showed that if a strictly feasible starting point is available, then the algorithm has $O((1+2\kappa)(logn)^{2}n^{\frac{1}{p+1}}log\frac{n}{\varepsilon}$ complexity bound.