• 정보처리학회논문지C
• /
• 제10C권2호
• /
• pp.141-144
• /
• 2003

인가된 사용자가 패스워드를 입력하는 과정이 타인에게 관찰되어도 패스워드가 노출되지 않는 세계 최초의 패스워드 시스템인 듀얼 패스워드 시스템을 제안하고, 듀얼 패스워드 시스템이 사용자를 인증하는 과정을 제시한다. 듀얼 패스워드 시스템의 패스워드 입력은 first password와 second password의 동일한 위치에 있는 두 기호를 매칭하는 과정을 반복하여 이루어진다. 따라서, 패스워드로부터 first password와 second password를 유도하는 방법은 듀얼 패스워드 시스템에서 중요한 의미를 갖는다. 패스워드로부터 first password와 second password를 유도하는 방법과 관련하여 dual password derivation 문제를 정의하며, dual password derivation 문제의 해에 대한 평가 척도들을 제시한다.

• Journal of applied mathematics & informatics
• /
• 제25권1_2호
• /
• pp.505-511
• /
• 2007

Recently, the equivalent relations between a symmetric dual problem and a matrix game B(x, y) were given in [6: D.S. Kim and K. Noh, J. Math. Anal. Appl. 298(2004), 1-13]. Using more simpler form of B(x, y) than one in [6], we establish the equivalence relations between a symmetric dual problem and a matrix game, and then give a numerical example illustrating our equivalence results.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1996년도 추계학술대회발표논문집; 고려대학교, 서울; 26 Oct. 1996
• /
• pp.289-292
• /
• 1996

In Cholesky factorization of the interior point method, dense columns of A matrix make dense Cholesky factor L regardless of sparsity of A matrix. We introduce a method to transform a primal problem to a dual problem in order to preserve the sparsity.

• East Asian mathematical journal
• /
• 제31권3호
• /
• pp.371-377
• /
• 2015

We consider a nondifferentiable robust optimization problem, which has a maximum function of continuously differentiable functions and support functions as its objective function, continuously differentiable functions as its constraint functions. We prove optimality conditions for the nondifferentiable robust optimization problem. We formulate a Wolfe type dual problem for the nondifferentiable robust optimization problem and prove duality theorems.

• East Asian mathematical journal
• /
• 제31권3호
• /
• pp.345-349
• /
• 2015

In this paper, we consider a fractional robust optimization problem (FP) and give necessary optimality theorems for (FP). Establishing a nonfractional optimization problem (NFP) equivalent to (FP), we formulate a Mond-Weir type dual problem for (FP) and prove duality theorems for (FP).

• 충청수학회지
• /
• 제26권4호
• /
• pp.723-734
• /
• 2013

A robust optimization problem, which has a maximum function of continuously differentiable functions as its objective function, continuously differentiable functions as its constraint functions and a geometric constraint, is considered. We prove a necessary optimality theorem and a sufficient optimality theorem for the robust optimization problem. We formulate a Wolfe type dual problem for the robust optimization problem, which has a differentiable Lagrangean function, and establish the weak duality theorem and the strong duality theorem which hold between the robust optimization problem and its Wolfe type dual problem. Moreover, saddle point theorems for the robust optimization problem are given under convexity assumptions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권5호
• /
• pp.2063-2081
• /
• 2018

A resource allocation algorithm is proposed in this paper to simultaneously minimize the total system power consumption and maximize the system throughput for the downlink of multi-user multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) systems. With the Lagrange dual decomposition method, we transform the original problem to its convex dual problem and prove that the duality gap between the two problems is zero, which means the optimal solution of the original problem can be obtained by solving its dual problem. Then, we use convex optimization method to solve the dual problem and utilize bisection method to obtain the optimal dual variable. The numerical results show that the proposed algorithm is superior to traditional single-objective optimization method in both the system throughput and the system energy consumption.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2008년도 추계학술대회 및 정기총회
• /
• pp.308-311
• /
• 2008

The ant colony optimization (ACO) is a metaheuristic inspired by the behavior of real ants. Recently, ACO has been widely used to solve the difficult combinatorial optimization problems. In this paper, we propose an ACO algorithm to solve the two disjoint paths problem with dual link cost structure (TDPDCP). We propose a dual pheromone structure and a procedure for solution construction which is appropriate for the TDPDCP. Computational comparisons with the state-of-the-arts algorithms are also provided.

• 한국경영과학회지
• /
• 제18권2호
• /
• pp.147-156
• /
• 1993

Recently a new concept of shadow prices, called average shadow price, has been developed. This paper provides a dual problem and the corresponding duality theorems justifying this new shadow price. The general duality framework is used. As an important secondary result, a new reduced class of price function, the pp. h.-class, has been developed for the general duality theory. This should be distinguished from other known reductions achieved in some specific areas of mathematical programming, in that it sustains the strong duality property in all the mathematical programs. The new general dual problem suggested with this pp. h.-class provides, as an optimal solution, the average shadow prices.

• 한국경영과학회지
• /
• 제14권1호
• /
• pp.16-26
• /
• 1989

The terminal layout problem is fundamental in may centralized computer networks, which is generated formulated as the capaciated minimum spanning tree problem (CMSTP). We present an implementation of the dual-based procedure to solve the CMSTP. Dual ascent procedure generates a good feasible solutions to the dual of the linear programming relaxation of CMSTP. A feasible primal solution to CMSTP can then be constructed based on this dual solution. This procedure can be used either as a stand-alone heuristic or, else, it can be incorporated into a branch and bound algorithm. A numerical result is given with quite favorable results.