• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 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.

• 한국경영과학회지
• /
• 제25권4호
• /
• pp.1-14
• /
• 2000

The methods of sensitivity analysis for linear programming can be classified in two types: sensitivity analysis using an optimal solution, and sensitivity analysis using an approximate optimal solution. As the methods of sensitivity analysis using an optimal solution, there are three sensitivity analysis methods: sensitivity analysis using an optimal basis, positive sensitivity analysis, and optimal partition sensitivity analysis. Since they may provide different characteristic regions under degeneracy, it is not easy to understand and apply the results of the three methods. In this paper, we propose a generalized sensitivity analysis that can integrate the three existing methods of sensitivity analysis. When a right-hand side or a cost coefficient is perturbed, the generalized sensitivity analysis gives different characteristic regions according to the controlling index set that denotes the set of variables allowed to have positive values in optimal solutions to the perturbed problem. We show that the three existing sensitivity analysis methods are special cases of the generalized sensitivity analysis, and present some properties of the generalized sensitivity analysis.

• 대한수학회지
• /
• 제59권6호
• /
• pp.1067-1082
• /
• 2022

This paper presents a new optimal three-step eighth-order family of iterative methods for finding multiple roots of nonlinear equations. Different from the all existing optimal methods of the eighth-order, the new iterative scheme is constructed using one function and three derivative evaluations per iteration, preserving the efficiency and optimality in the sense of Kung-Traub's conjecture. Theoretical results are verified through several standard numerical test examples. The basins of attraction for several polynomials are also given to illustrate the dynamical behaviour and the obtained results show better stability compared to the recently developed optimal methods.

• 한국전자파학회논문지
• /
• 제19권4호
• /
• pp.442-450
• /
• 2008

본 논문에서는 직접 변환 방식의 UHF RFID 수신기에서 사용되는 위상 다이버시티의 특성을 분석하고, 태그 변조 방식에 따른 최적의 I/Q 신호 결합 방법을 제시한다. 먼저 위상 다이버시티를 사용하지 않고 단일 채널 수신기를 구성했을 때 송신 신호와 국부발진기 신호 사이의 거리에 따른 위상차에 의해 발생하는 페이딩 특성을 분석하여 위상 다이버시티의 필요성을 보였다. 다음으로 이러한 페이딩 특성에 따른 수신 신호의 감쇄 특성을 극복하기 위한 최적의 I와 Q 채널의 결합 방법을 제안하였다. ASK의 경우, AWGN 환경에서 I와 Q 채널의 전력 평균값이 최적 신호 결합 방법임을 확인하였고, PSK의 경우는 최적 신호 결합 방법으로 arctangent 방법 및 principal component 결합 방법을 제안하였다. 제시된 결합 방법의 성능 비교를 위해 시간 파형 및 심볼 에러확률 성능을 I와 Q 패널 중 최적의 SNR 값을 갖는 패널을 선택하는 선택 다이버시티와 비교하여 분석하였다. 이론 분석 및 시뮬레이션 결과, 제시된 방법이 선택 다이버시티에 비해 최대 3 dB의 SNR 개선 효과를 가짐을 확인하였다.

• Management Science and Financial Engineering
• /
• 제10권2호
• /
• pp.103-118
• /
• 2004

$\epsilon$-sensitivity analysis is a kind of methods for performing sensitivity analysis for linear programming. Its main advantage is that it can be directly applied for interior-point methods with a little computation. Although $\epsilon$-sensitivity analysis was proposed several years ago, there have been no studies on its relationship with other sensitivity analysis methods. In this paper, we discuss the relationship between $\epsilon$-sensitivity analysis and sensitivity analysis using an optimal basis. First. we present a property of $\epsilon$-sensitivity analysis, from which we derive a simplified formula for finding the characteristic region of $\epsilon$-sensitivity analysis. Next, using the simplified formula, we examine the relationship between $\epsilon$-sensitivity analysis and sensitivity analysis using optimal basis when an $\epsilon$-optimal solution is sufficiently close to an optimal extreme solution. We show that under primal nondegeneracy or dual non degeneracy of an optimal extreme solution, the characteristic region of $\epsilon$-sensitivity analysis converges to that of sensitivity analysis using an optimal basis. However, for the case of both primal and dual degeneracy, we present an example in which the characteristic region of $\epsilon$-sensitivity analysis is different from that of sensitivity analysis using an optimal basis.

• Communications for Statistical Applications and Methods
• /
• 제6권1호
• /
• pp.207-220
• /
• 1999

In this paper, some of the issue about a group sequential method are considered in the Bayesian context. The continuous time optimal stopping boundary can be used to approximate the optimal stopping boundary for group sequential designs. The exact stopping boundary for group sequential design is obtained by using the backward induction method and is compared with the continuous optimal stopping boundary and the corrected continuous stopping boundary.

• 충청수학회지
• /
• 제29권4호
• /
• pp.663-676
• /
• 2016

In this paper we propose a new family of eighth order optimal methods for solving nonlinear equations by using weight function methods. The methods of the family require three function and one derivative evaluations per step and has order of convergence eight, and so they are optimal in the sense of Kung-Traub hypothesis. Precise analysis of convergence is given. Some members of the family are compared with several existing methods to show their performance and as a result to confirm that our methods are as competitive as compared to them.

• 대한수의학회지
• /
• 제47권2호
• /
• pp.247-254
• /
• 2007

This study was performed to identify the normal anatomic orientation of pulmonary arteries and to obtain the normal baseline parameters and the optimal contrast material delivery methods of computed tomographic pulmonary angiography (CTPA) on normal beagle dogs. Based on the contrast injection flow rate, the contrast volume, and the administration methods, the experimental groups were divided into 4 groups such as group 1 : 2 ml/s, 3 ml/kg, and monophasic administration; group 2 : 5 ml/s, 3 ml/kg, and monophasic administration; group 3 : 5 ml/s, 4 ml/kg, and monophasic administration; group 4 : 5 ml/s and 2 ml/kg in first phase, 0.3 ml/s and 2 ml/kg in second phase, as biphasic administration. Normal anatomic orientation of pulmonary arteries in CTPA was evaluated through reformatted and 3D images after retro-reconstruction. Normal parameters for great arteries and peripheral pulmonary arteries were obtained on the factor of basement hounsfield unit (HU) values, contrast enhanced HU values, delay time, and peak time. And the optimal contrast delivery methods were evaluated on the factor of contrast enhanced HU values, image quality, and artifact. The monophasic administration with 5 ml/s contrast injection flow rate and 3 ml/kg contrast volume was optimal in canine CTPA.

• 산업경영시스템학회지
• /
• 제18권35호
• /
• pp.39-46
• /
• 1995

This study is to find the optimal lot size method in the distribution system. In general, the lot size methods used in the distribution system is the same as the methods of the MRP system. The lot size methods used in this study are LFL, EoQ, LTC and POQ.. Resulting in case study, LTC is the optimal lot size method in the distribution system. In distribution system, VRP and VSP shall be investgated.

• International Journal of Computer Science & Network Security
• /
• 제21권2호
• /
• pp.88-92
• /
• 2021

A method and a mathematical algorithm for finding a quasi-optimal assignment plan with rectangular efficiency matrices are proposed. The developed algorithm can significantly reduce the time and computer memory consumption for its implementation in comparison with optimal methods.