• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.24-29
• /
• 1996

If the LP problem doesn't have the optimal soultion uniquely, the solution fo the primal-dual barrier method converges to the interior point of the optimal face. Therefore, when the optimal vertex solution or the optimal basis is required, we have to perform the additional procedure to recover the optimal basis from the final solution of the interior point method. In this paper the exisiting methods for recovering the optimal basis or identifying the optimal solutions are analyzed and the new methods are suggested. This paper treats the two optimal basis recovery methods. One uses the purification scheme and the simplex method, the other uses the optimal face solutions. In the method using the purification procedure and the simplex method, the basic feasible solution is obtained from the given interior solution and then simplex method is performed for recovering the optimal basis. In the method using the optimal face solutions, the optimal basis in the primal-dual barrier method is constructed by intergrating the optimal solution identification technique and the optimal basis extracting method from the primal-optimal soltion and the dual-optimal solution.

• Journal of applied mathematics & informatics
• /
• 제8권1호
• /
• pp.181-197
• /
• 2001

A heuristic method TABU-CSP using Tabu Search (TS) is described for solving Constraint Satisfaction Problems (CSPs). The method is started with a complete but inconsistent solution of a binary CSP and obtained in prespecified number of iterations either a consistent solution or a near optimal solution with an acceptable number of conflicts. The repair in the solution at each iterative step is done by using two heuristics alternatively. The first heuristic is a min-conflicts heuristic that chooses a variable with the maximum number of conflicts and reassigns it the value which leads to the minimum number of conflicts. If the acceptable solution is not reached after the search continued for a certain number of iterations, the min-conflict heuristic is changed and the variable selected least number of times is chosen for repair. If an acceptable solution is not reached, the method switches back to the min-conflict heuristic and proceeds further. This allowed the method to explore a different region of search space space for the solution as well as to prevent cycling. The demonstration of the method is shown on a toy problem [9]which has no solution. The method is then tested on various randomly generated CSPs with different starting solutions. The performance of the proposed method in terms of the average number of consistency is checked and the average number of conflicts is conflicts is compared with that of the Branch and Bound(BB) method used to obtain the same solution. In almost all cases, the proposed method moves faster to the acceptable solution than BB.

• International Journal of Aeronautical and Space Sciences
• /
• 제3권2호
• /
• pp.46-58
• /
• 2002

An inverse method is introduced to construct benchmark problems for the numerical solution of initial value problems. Benchmark problems constructed through this method have a known exact solution, even though analytical solutions are generally not obtainable. The solution is constructed such that it lies near a given approximate numerical solution, and therefore the special case solution can be generated in a versatile and physically meaningful fashion and can serve as a benchmark problem to validate approximate solution methods. A smooth interpolation of the approximate solution is forced to exactly satisfy the differential equation by analytically deriving a small forcing function to absorb all of the errors in the interpolated approximate solution. A multi-variable orthogonal function expansion method and computer symbol manipulation are successfully used for this process. Using this special case exact solution, it is possible to directly investigate the relationship between global errors of a candidate numerical solution process and the associated tuning parameters for a given code and a given problem. Under the assumption that the original differential equation is well-posed with respect to the small perturbations, we thereby obtain valuable information about the optimal choice of the tuning parameters and the achievable accuracy of the numerical solution. Illustrative examples show the utility of this method not only for the ordinary differential equations (ODEs) but for the partial differential equations (PDEs).

• Journal of Advanced Marine Engineering and Technology
• /
• 제29권8호
• /
• pp.877-882
• /
• 2005

This paper discusses the lateral vibration of a bar which has its tip free. The uniform bar has a solution by summation of some simple exponential functions But if its shape is not uniform, its solution could be by Bessel's function, or mathematical solution could not be existed. Enen if the solution of Bessel's function exists. as Bessel function is a series function. we must got the solution by numerical method Hereby the author Proposes the ununiform beam solution of the matrix method by Ritz's method. and Proposes a new deflection shape function.

• 설비공학논문집
• /
• 제20권8호
• /
• pp.534-540
• /
• 2008

In this paper, the optimal bang-bang control problem of an air-conditioning system with slab thermal storage was formulated by gradient method. Furthermore, the numeric solution obtained by gradient method algorithm was compared with the analytic solution obtained on the basis of maximum principle. The control variable is changed uncontinuously at the start time of thermal storage operation in an analytic solution. On the other hand, it is showed as a continuous solution in a numeric solution. The numeric solution reproduces the analytic solution when a tolerance for convergence is applied severely. It is conceivable that gradient method is effective in the analysis of the optimal bang-bang control of the large-scale system like an air-conditioning system with slab thermal storage.

• 한국항공운항학회지
• /
• 제16권2호
• /
• pp.21-27
• /
• 2008

An inverse method is introduced to construct the problem for the error analysis of the numerical solution of initial value problem. These problems constructed through this method have a known exact solution, even though analytical solutions are generally not obtainable. The process leading to the exact solution makes use of an initially available approximate numerical solution. A smooth interpolation of the approximate solution is forced to exactly satisfy the differential equation by analytically deriving a small forcing function to absorb all of the errors in the interpolated approximate solution. Using this special case exact solution, it is possible to investigate the relationship between global errors of a candidate numerical solution process and the associated tuning parameters for a given problem. Under the assumption that the original differential equation is well-posed with respect to the small perturbations, we thereby obtain valuable information about the optimal choice of the tuning parameters and the achievable accuracy of the numerical solution.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2003년도 추계학술대회논문집
• /
• pp.984-987
• /
• 2003

This paper discusses the lateral vibration of a bar which has its tip free. The uniform bar has a solution by summation of some simple exponential functions. But if its shape is not uniform, its solution could be by Bessel's function, or mathematical solution could not be existed. Even if the solution of Bessel's function exists. as Bessel function is a series function, we must get the solution by numerical method, Hereof the author proposes the solution of the matrix method by Ritz's method, and proposes a new deflection shape

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2011년도 춘계학술발표대회
• /
• pp.990-992
• /
• 2011

In this paper, we introduce a new Tabu method to get K-anonymity character in database information privacy protection. We use the conception of lattice to form the solution space for K-anonymity Character and search the solution area in this solution space to achieve the best or best approach modification solution for the information in the database. We then compared the Tabu method with other traditional heuristic method and our method show a better solution in most of the cases.

• Journal of Positioning, Navigation, and Timing
• /
• 제3권3호
• /
• pp.117-122
• /
• 2014

In CDGPS, ambiguity resolution is determined by the performance of a floating solution, and thus, the performance needs to be improved. In the case of precise positioning at a stationary position, the batch method using multiple measurements is used for the accuracy improvement of a position. The position accuracy performance of a floating solution is outstanding, but it has a problem of high computation cost because all measurements are used. In this study, to improve the floating solution performance of the initial static user in CDGPS, a floating solution method using a recursive filter was implemented. A recursive filter estimates the position solution of the current epoch using the position solution of up to the previous epoch and the pseudorange measurement of the current epoch. The computation cost of the floating solution method using a recursive filter was found to be similar to that of the epoch-by-epoch method. Also, based on actual GPS signals, the floating solution performance was found to be similar to that of the batch method. The floating solution using a recursive filter could significantly improve the performance of the prompt initial position and ambiguity resolution of the initial static user.

• ETRI Journal
• /
• 제37권3호
• /
• pp.533-540
• /
• 2015

In wireless localization, several linear closed-form solution (LCS) methods have been investigated as a direct result of the drawbacks that plague the existing iterative methods, such as the local minimum problem and heavy computational burden. Among the known LCS methods, both the direct solution method and the difference of squared range measurements method are considered in this paper. These LCS methods do not have any of the aforementioned problems that occur in the existing iterative methods. However, each LCS method does have its own individual error property. In this paper, a hybrid LCS method is presented to reduce these errors. The hybrid LCS method integrates the two aforementioned LCS methods by using two check points that give important information on the probability of occurrence of each LCS's individual error. The results of several Monte Carlo simulations show that the proposed method has a good performance. The solutions provided by the proposed method are accurate and reliable. The solutions do not have serious errors such as those that occur in the conventional standalone LCS and iterative methods.