• 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).

• 전기의세계
• /
• 제22권1호
• /
• pp.28-34
• /
• 1973

This paper treats with the sub-optimal control problem of noninear systems by approximation method. This method involves the approximation by linearization which provides the sub-optimal solution of non-linear control problems. The result of this work shows that, in the problem in which the controlled plant is characterized by an ordinary differential equation of first order, the solution obtained by this method coincides with the exact solution of problem. In of case of the second or higher order systems, it is proved analytically that this method of linearization produces the sub-optimal solution of the given problem. It is also shown that the sub-optimality of solution by the method can be evaluated by introducing the upper and lower bounded performance indices. Discussion is made on the procedure with some illustrative examples whose performance indices are given in the quadratic forms.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• pp.613-616
• /
• 2000

This paper considers the problem of subway crew scheduling. Crew scheduling is concerned with finding a minimum number of assignments of crews to a given timetable satisfying various restrictions. Traditionally, crew scheduling problem has been formulated as a set covering or set partitioning problem possessing exponentially many variables, but even the LP relaxation of the problem is hard to solve due to the exponential number of variables. In this paper, we propose two basic techniques that solve the problem in a reasonable time, though the optimality of the solution is not guaranteed. To reduce the number of variables, we adopt column-generation technique. We could develop an algorithm that solves column-generation problem in polynomial time. In addition, the integrality of the solution is accomplished by variable-fixing technique. Computational results show column-generation makes the problem of treatable size, and variable fixing enables us to solve LP relaxation in shorter time without a considerable increase in the optimal value. Finally, we were able to obtain an integer optimal solution of a real instance within a reasonable time.

• Journal of applied mathematics & informatics
• /
• 제7권1호
• /
• pp.183-193
• /
• 2000

In this paper we use measure theory to solve a wide range of second-order boundary value ordinary differential equations. First, we transform the problem to a first order system of ordinary differential equations(ODE's)and then define an optimization problem related to it. The new problem in modified into one consisting of the minimization of a linear functional over a set of Radon measures; the optimal measure is then approximated by a finite combination of atomic measures and the problem converted approximatly to a finite-dimensional linear programming problem. The solution to this problem is used to construct the approximate solution of the original problem. Finally we get the error functional E(we define in this paper) for the approximate solution of the ODE's problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.25-29
• /
• 2003

LQ actuator selection problem for multi-input system discussed in this paper is to determine optimal actuator out of many actuators and input sequences so as to minimize the quadratic control performance. The solution of this problem depends on initial values and has a combinatorial property, so it is extremely difficult to get an optimal solution. For this difficulty, we proposed the concept of comparability of actuators and showed the uniqueness of the solution[1] . Further, to get general optimal solution for LQ problem with actuator selection strategies, we derived the equivalent condition for the comparability of actuator in single-input system . In this paper we extend this result to the case of multi-input system. The derived sufficient condition is applicable in the case of positive semi-definite comparability matrices.

• 대한수학회보
• /
• 제46권3호
• /
• pp.409-434
• /
• 2009

In this paper, we consider a generalized Riemann problem of the first order hyperbolic conservation laws. For the case that excludes the centered wave, we prove that the generalized Riemann problem admits a unique piecewise smooth solution u = u(t, x), and this solution has a structure similar to the similarity solution u = $U{(\frac{x}{t})}$ of the correspondin Riemann problem in the neighborhood of the origin provided that the coefficients of the system and the initial conditions are sufficiently smooth.

• 한국환경교육학회지:환경교육
• /
• 제20권4호
• /
• pp.97-105
• /
• 2007

The purpose of this study is to find out educational effect of school environmental education utilized school eco-audit. The result of the study is as followings. First, environmental education program based on school eco-audit was developed. Environmental education program was applied school environmental education. According to developed program, students surveyed environmental problem of school and drove to solution of environmental problem. Second, after environmental education, students became to recognize the fact we are responsible for the environmental problem and also affect the solution of it too much. Also, result showed that will to save energy and resource get higher. In conclusion, school eco-audit is effective cultivation of positive attitude for solution and responsibility of environmental problem. Therefore school eco-audit have to introduce school environmental education because school eco-audit derive participation for solution of environmental problem and learning of decision-making.

• 한국경영과학회지
• /
• 제21권1호
• /
• pp.147-161
• /
• 1996

Generally the Multiprocessor Scheduling (MPS) problem is difficult to solve because of the precedence of the tasks, and it takes a lot of time to obtain its optimal solution. Though Genetic Algorithm (GA) does not guarantee the optimal solution, it is practical and effective to solve the MPS problem in a reasonable time. The algorithm developed in this research consists of a improved GA and GP/MISF (Critical Path/Most Immediate Successors First). An efficient genetic operator is derived to make GA more efficient. It runs parallel CP/MISF with GA to complement the faults of GA. The solution by the developed algorithm is compared with that of CP/MISF, and the better is taken as a final solution. As a result of comparative analysis by using numerical examples, although this algorithm does not guarantee the optimal solution, it can obtain an approximate solution that is much closer to the optimal solution than the existing GA's.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1995년도 추계학술대회발표논문집; 서울대학교, 서울; 30 Sep. 1995
• /
• pp.220-229
• /
• 1995

Generally the Multiprocessor Scheduling(MPS) problem is difficult to solve because of the precedence of the tasks, and it takes a lot of time to obtain its optimal solution. Though Genetic Algorithm(GA) does not guarantee the optimal solution, it is practical and effective to solve the MPS problem in a reasonable time. The algorithm developed in this research consists of a improved GA and CP/MISF(Critical Path/Most Immediate Successors First). A new genetic operator is derived to make GA more efficient. It runs parallel CP/MISF with Ga to complement the faults of GA. The solution by the developed algorithm is compared with that of CP/MISF, and the better is taken as a final solution. As a result of comparative analysis by using numerical examples, although this algorithm does not guarantee the optimal solution, it can obtain an approximate solution that is much closer to the optimal solution than the existing GA's.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.565-568
• /
• 1996

In this paper, a solution method is proposed to calculate the optimum solution to discrete optimal H$_{.inf}$ control problem for feedback of linear time-invariant system states and disturbance variable. From the results of this study, condition of existence and uniqueness of its solution is that transfer matrix of controlled variable to input variable is left invertible and has no invariant zeros on the unit circle of the z-domain as well as extra geometric conditions given in this paper. Through a numerical example, the noniterative solution method proposed in this paper is illustrated.