• Bulletin of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.193-204
• /
• 1996

Let U and V be nonempty compact subsets of two Hausdorff topological vector spaces. Suppose that a function $J : U \times V \to R$ is such that for each $\upsilon \in V, J(\cdot, \upsilon)$ is lower semi-continuous and convex on U, and for each $ u \in U, J(u, \cdot)$ is upper semi-continuous and concave on V.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.8
• /
• pp.55-62
• /
• 2014

A game theoretic approach is applied for studying the energy efficient rate scheduling. The individual utility function is defined first. Then, a non cooperative rate game is modeled in which each user decides the transmission rate to maximize its own utility. The utility function considered here is the consumed energy for the individual user's data transmissions. In particular, using the fact that the utility function is convex, we prove the existence of Nash Equilibrium in the energy efficient rate scheduling problem at hand. Accordingly, a non cooperative scheduling algorithm is provided. For better energy efficiency, the sum of the individual user's utility function is optimized Finally, the convergence analysis and numerical results to show the energy efficiency of the proposed algorithms are provided.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.7
• /
• pp.615-623
• /
• 2008

This paper proposes an $H_{\infty}$ controller design method for Takagi-Sugeno (T-S) fuzzy systems using a fuzzy basis-function-dependent Lyapunov function. Sufficient conditions for the guaranteed $H_{\infty}$ performance of the T-S fuzzy control system are given in terms of linear matrix inequalities (LMIs). These LMI conditions are further used for a convex optimization problem in which the $H_{\infty}-norm$ of the closed-loop system is to be minimized. To facilitate the basis-function-dependent Lyapunov function approach and thus improve the closed-loop system performance, additional decision variables are introduced in the optimization problem, which provide an additional degree-of-freedom and thus can enlarge the solution space of the problem. Numerical examples show the effectiveness of the proposed method.

• Journal of the Korean Mathematical Society
• /
• v.58 no.6
• /
• pp.1461-1484
• /
• 2021

We deal with the following elliptic equations: $\{-div({\varphi}^{\prime}(\left|{\nabla}z\right|^2){\nabla}z)+V(x)\left|z\right|^{{\alpha}-2}z={\lambda}{\rho}(x)\left|z\right|^{r-2}z+h(x,z),\\z(x){\rightarrow}0,\;as\;\left|x\right|{\rightarrow}{\infty},$ in ℝ^N , where N ≥ 2, 1 < p < q < N, 1 < α ≤ p^*q'/p', α < q, 1 < r < min{p, α}, φ(t) behaves like t^q/2 for small t and t^p/2 for large t, and p' and q' the conjugate exponents of p and q, respectively. Here, V : ℝ^N → (0, ∞) is a potential function and h : ℝ^N × ℝ → ℝ is a Carathéodory function. The present paper is devoted to the existence of at least two distinct nontrivial solutions to quasilinear elliptic problems of Schrödinger type, which provides a concave-convex nature to the problem. The primary tools are the well-known mountain pass theorem and a variant of Ekeland's variational principle.

• Communications of the Korean Mathematical Society
• /
• v.14 no.1
• /
• pp.147-156
• /
• 1999

This paper deals with a class H(A,B,$\alpha$) of analytic functions and we obtain coefficient estimates and related results.

• Management Science and Financial Engineering
• /
• v.12 no.1
• /
• pp.113-125
• /
• 2006

Bilevel programming problem is a two-stage optimization problem where the constraint region of the first level problem is implicitly determined by another optimization problem. In this paper we consider the bilevel quadratic/linear fractional programming problem in which the objective function of the first level is quasiconcave, the objective function of the second level is linear fractional and the feasible region is a convex polyhedron. Considering the relationship between feasible solutions to the problem and bases of the coefficient submatrix associated to variables of the second level, an enumerative algorithm is proposed which finds a global optimum to the problem.

• Korean Management Science Review
• /
• v.33 no.3
• /
• pp.89-103
• /
• 2016

In this paper, we design sampling inspections and service capacities simultaneously for multi-products. Products are supplied in batches after rectifying inspections, that is, rejected lot is subject to total inspection and defective products are reworked to good ones. When supplied, all defective products are uncovered and returned to service. Particularly, we extend Kim [1] by introducing the fixed costs of providing services and show that the cost function of a product is no longer linear or convex in terms of the level of service provision. We develop a framework for a product to deal with this joint design problem and a dynamic programming algorithm for multi-products which allocates the given number of the total service capacities among products with the considerably smaller computations than the total number of possible allocations.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.240-242
• /
• 2007

The game theoretic analysis in wireless networks can be classified into the jamming game of the physical layer, the multiple access game of the medium access layer, the forwarder's dilemma and joint packet forwarding game of the network layer, and etc. In this paper, the game theoretic analysis about the multiple access game that selfish nodes exist in the IEEE 802.11 DCF(Distributed Coordination Function) wireless networks is addressed. In this' wireless networks, the modeling of the CSMA/CA protocol based DCF, the utility or payoff function calculation of the game, the system optimization (using optimization theory or convex optimization), and selection of Pareto-optimality and Nash Equilibrium in game strategies are the important elements for analyzing how nodes are operated in the steady state of system. Finally, the main issues about the game theory in the wireless network are introduced.

• Honam Mathematical Journal
• /
• v.37 no.3
• /
• pp.317-323
• /
• 2015

The purpose of the present paper is to study certain radii problems for the function $$f(z)=\[{\frac{z^{1-{\gamma}}}{{\gamma}+{\beta}}}\(z^{\gamma}[D^nF(z)]^{\beta}\)^{\prime}\]^{1/{\beta}}$$, where ${\beta}$ is a positive real number, ${\gamma}$ is a complex number such that ${\gamma}+{\beta}{\neq}0$ and the function F(z) varies various subclasses of analytic functions with fixed second coefficients. Relevant connections of the results presented herewith various well-known results are briefly indicated.

• Honam Mathematical Journal
• /
• v.43 no.4
• /
• pp.627-639
• /
• 2021

Numerical techniques are used to determine the radius of convexity of the starlike functions related to cardioid shaped bounded domain. In addition, radius constants of certain starlikeness associated with right half plane of various starlike functions are computed.