• 한국강구조학회 논문집
• /
• 제28권5호
• /
• pp.337-344
• /
• 2016

본 연구에서는 내력밀도법과 강성행렬법을 결합한 방법을 사용한 텐세그리티 시스템의 형상탐색기법을 제안하였다. 텐세그리티 시스템의 형상탐색 기법에 대한 연구는 많은 연구자들에 의해 계속되어왔으나 그 기법들은 복수의 자기응력 상태를 갖는 시스템의 경우 한계가 있다. 제안 기법을 사용하면 복수의 자기응력상태를 갖는 텐세그리티 구조물에 대한 최적의 내력밀도 값을 결정할 수 있다. 텐세그리티 시스템의 최대 강성 값을 유도하기 위해 구조물의 고유진동수 값을 최대로 이끌어 내는 목적함수를 설정한 유전 알고리즘을 사용하였다. 다수의 평형상태를 갖는 텐세그리티 시스템의 자기평형 형태를 얻을 수 있는 본 기법에 대한 효율성을 입증하기 위해 수치해석 예제를 수행하였으며 이를 통해 만족하는 결과 값을 얻을 수 있었다.

• 한국경영과학회지
• /
• 제22권4호
• /
• pp.71-80
• /
• 1997

In this paper, we consider with a market pioneering game among symmetric firms in highly competitive situation. To describe the puzzling situation of timing competition, we construct a dynamic game model and explore the equilibrium solution. As a result, we find a subgame perfect mixed strategy Nash equilibrium conceptually defined by 't$_{0}$ + .elsilon. equilibrium'. Our major finding s include : i) market entry will be occurred in sequential manner even though the condition of each firm is symmetric ii) the optimal timing of market pioneering will be advanced until almost all of the monopolist's profit is dissipated, iii) as the market position of the pioneer is stronger, the timings of the pioneer and the follower are separated, iv) and as the slope of the profit flow is steeper, the entry timing of the two players will be pooled together.

• 대한수학회논문집
• /
• 제25권1호
• /
• pp.69-82
• /
• 2010

In this paper, we propose an iterative scheme for finding a common element of the set of solutions of an equilibrium problem and the set of fixed points of an asymptotically k-strict pseudo-contractive mapping in the setting of real Hilbert spaces. We establish some weak and strong convergence theorems of the sequences generated by our proposed scheme. Our results are more general than the known results which are given by many authors. In particular, necessary and sufficient conditions for strong convergence of our iterative scheme are obtained.

• 대한수학회지
• /
• 제46권3호
• /
• pp.561-576
• /
• 2009

We introduce two iterative algorithms for finding a common element of the set of fixed points of an asymptotically k-strict pseudo-contraction and the set of solutions of a mixed equilibrium problem in a Hilbert space. We obtain some weak and strong convergence theorems by using the proposed iterative algorithms. Our results extend and improve the corresponding results of Tada and Takahashi [16] and Kim and Xu [8, 9].

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 하계학술대회 논문집 A
• /
• pp.380-382
• /
• 2002

An important aspect of the study of power system markets involves the assessment of strategic behavior of participants for maximizing their profits. In models of imperfect competition of a deregulated electricity system the key task is to find the Nash equilibrium. In this paper, the bimatrix approach for finding Nash equilibria in electricity markets is investigated. This approach determines pure and mixed equilibria using the complementarity pivot algorithm. The mixed equilibrium in the matrix approach has the equal number of non-zero property. This property makes it difficult to reproduce a smooth continuous distribution for the mixed equilibrium. This paper proposes an algorithm for adjusting the quantization value of discretization to reconstruct a continuous distribution from a discrete one.

• East Asian mathematical journal
• /
• 제26권1호
• /
• pp.25-38
• /
• 2010

In this paper, we introduce a hybrid iterative method for finding a common element of the set of solutions of a mixed equilibrium problem, the set of common mixed points of finitely many nonexpansive mappings and the set of solutions of the variational inequality for an inverse strongly monotone mapping in a Hilbert space. We show that the iterative sequences converge strongly to a common element of the three sets. The results extended and improved the corresponding results of L.-C.Ceng and J.-C.Yao.

• 대한전기학회논문지:전력기술부문A
• /
• 제55권11호
• /
• pp.492-497
• /
• 2006

Nash Equilibrium (NE) is essential to investigate a participant's bidding strategy in a competitive electricity market. The transmission line constraints make it difficult to compute the NE due to causing a mixed strategy NE instead of a pure strategy NE. Computing a mixed strategy is more complicated in a multi-player game. The competition among multi-participants is modeled by a two-level hierarchical optimization problem. A mathematical programming approach is widely used in finding this equilibrium. However, there are difficulties to solving a mixed strategy NE. This paper presents two propositions to add heuristics to the mathematical programming method. The propositions are based on empirical studies on mixed strategies in numerous sample systems. Based on the propositions a new formulation is provided with a set of linear and nonlinear equations, and an algorithm is suggested for using the prepositions and the newly-formulated equations.

• 농업생명과학연구
• /
• 제46권6호
• /
• pp.185-195
• /
• 2012

The purpose of this paper is to analyze how strategically the bilaterally monopolistic firms, only-one-seller and only-one-buyer, behave in a situation in which each firm has uncertain information on its opponent firm's cost. Even though the two firms know that seeking integrated profit leads to the optimized profit for both firms, each firm has an incentive to opportunistically behave to increase its share of the integrated profit. These opportunistic behaviors of the firms are analyzed through a game theoretic approach especially finding Nash equilibrium mixed strategies for the strategic profiles such as true-report or not and monitoring or not. The comparative statics to the Nash equilibrium mixed strategies shows that as the profit share increases the probability of monitoring an opponent firm is decreased while the probability increases as the size of the overstated production cost increases. This study also shows that high penalty and low monitoring cost lead to high probability to tell the truth of the production cost.

• Kyungpook Mathematical Journal
• /
• 제59권1호
• /
• pp.83-99
• /
• 2019

In this paper, we introduce a hybrid subgradient method for finding an element common to both the solution set of a class of pseudomonotone equilibrium problems, and the set of fixed points of a finite family of ${\kappa}$-strictly presudononspreading mappings in a real Hilbert space. We establish some weak and strong convergence theorems of the sequences generated by our iterative method under some suitable conditions. These convergence theorems are investigated without the Lipschitz condition for bifunctions. Our results complement many known recent results in the literature.

• Korean Journal of Mathematics
• /
• 제27권2호
• /
• pp.297-327
• /
• 2019

In this paper, we introduce and study a general iterative algorithm to approximate a common solution of split generalized equilibrium problem, variational inequality problem and fixed point problem for a finite family of nonexpansive mappings in real Hilbert spaces. Further, we prove a strong convergence theorem for the sequences generated by the proposed iterative scheme. Finally, we derive some consequences from our main result. The results presented in this paper extended and unify many of the previously known results in this area.