• Structural Engineering and Mechanics
• /
• v.38 no.5
• /
• pp.593-618
• /
• 2011

This paper deals with the problem of the determination of the response of a viscoelastic Bernoulli-Navier beam, which is resting on an elastic medium. Assuming uniaxial bending, the displacement of the beam axis is governed by an integro-differential equation. The compatibility of the displacements between the beam and the elastic medium is imposed through an integral equation. In general and in particular in the case of a Boussinesq medium, the solution has to be pursued numerically. On the contrary, in the case of a Winkler's medium the compatibility equation becomes a linear finite relationship, which allows finding an original analytical solution of the problem for both hereditary and aging behavior of the beam. Some numerical examples complete the paper, in which a comparison is made between the hereditary and the aging model for the creep of the beam.

• The Bulletin of The Korean Astronomical Society
• /
• v.37 no.2
• /
• pp.160.1-160.1
• /
• 2012

We present an alternative approach for satellite formation reconfiguration by an optimal impulsive-thrust strategy to minimize the total characteristic velocity in a near-circular-orbit. Linear transformation decouples the Hill-Clohessy-Wiltshire(HCW) dynamics into a new block-diagonal system matrix consisting of 1-dimensional harmonic oscillator and 2-dimensional subsystem. In contrast to a solution based on the conventional primer vector theory, the optimal solution and the necessary conditions are represented as times and directions of impulses. New analytical expression of the total characteristic velocity is found for each sub systems under general boundary conditions including transfer time constraint. To minimize the total characteristic velocity, necessary conditions for times and directions of impulses are analytically solved. While the solution to the 1-dimensional harmonic oscillator has been found, the solution to the 2-dimensional subsystem is currently under construction. Our approach is expected to be applicable to more challenging problems.

• Journal of Ship and Ocean Technology
• /
• v.5 no.1
• /
• pp.30-37
• /
• 2001

Ship optimal design is a multi-objective decision-making process and its optimal solution does not exit in general. It is a problem in which the decision-maker is very interested that an effective solution is how to be found which has good characteristic and is substituted for optimal solution in a sense. In the previous methods of multi-objective decision-making, the weighting coefficients are decided from the point of view of individuals which have a bit sub-jective an unilateral behavior. in order to fairly and objectively decide the weighting coeffi-cients, which are considered to be optimal in all system of multi-objective decision-making and satisfactory solution to the decision-maker, the pater presents a method of applying the Technology of the Biggest Entropy. It is proved that the method described in the paper is very feasible and effective be means of a practical example of ship optimal design.

• Korean Journal of Mathematics
• /
• v.22 no.1
• /
• pp.123-131
• /
• 2014

The purpose of this paper is to study the perturbation analysis of the matrix equation $X=I-A^*X^{-1}A+B^*X^{-1}B$. Based on the matrix differentiation, we give a precise perturbation bound for the positive definite solution. A numerical example is presented to illustrate the shrpness of the perturbation bound.

• Honam Mathematical Journal
• /
• v.34 no.3
• /
• pp.375-379
• /
• 2012

We find a general solution $f:G{\rightarrow}G$ of the symmetric functional equation $$x+f(y+f(x))=y+f(x+f(y)),\;f(0)=0$$ where G is a 2-divisible abelian group. We also prove that there exists no measurable solution $f:\mathbb{R}{\rightarrow}\mathbb{R}$ of the equation. We also find the continuous solutions $f:\mathbb{C}{\rightarrow}\mathbb{C}$ of the equation.

• 전기의세계
• /
• v.22 no.5
• /
• pp.12-18
• /
• 1973

This paper deals with Linear Programming by Signal Flow Graph technique which is different from that of Mason and Coates. The objective function is regarded as variable, and slack variable node, artificial variable node and objective function variable (constant) node are newly defined, which shows the process for optimization of solution very intuitively. Also methods for solving L.P. and examples with subject to Ax.leq.b, Ax=b and Ax.geq.b are presented.

• Journal of the Korean Mathematical Society
• /
• v.43 no.5
• /
• pp.1081-1098
• /
• 2006

Mathematical analysis is made on a mesh free method for the compressible Euler equations. In particular, the Moving Least Square Reproducing Kernel (MLSRK) method is employed for space approximation. With the backward-Euler method used for time discretization, existence of discrete solution and it's $L^2-error$ estimate are obtained under a regularity assumption of the continuous solution. The result of numerical experiment made on the biconvex airfoil is presented.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.1
• /
• pp.121-131
• /
• 1994

Since many infinite horizon problems have infinite sequence of data to be considered, in general, it is impossible to express the optimal strategies finitely or to calculate them in finite time. This paper considers undiscounted nonhomogeneous deterministic infinite horizon problems. For those problems, we take a basic step to solve this class of infinite horizon problems optimally by giving a sufficient condition for a finite solution.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.2
• /
• pp.177-198
• /
• 1994

We consider an algorithm for the Crew Scheduling Problem (CSP) based on the Transportation Problem approach. The main flows of the algorithm are arranged in three steps. First we propose a heuristic algorithm of the greedy principle to obtain an initial feasible solution. Secondary we present a method of formulating CSP into a Modified Transportation Problem format. Lastly the procedures of network search to get the optimal solution are presented. This algorithm can be applied to the general GSP and also to most combinatorial problems like the Vehicle Routing Problems. The computational results show that the large size CSP's could be tackled.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.1
• /
• pp.147-158
• /
• 1995

In this paper a face optimization algorithm is developed for solving the problem (P) of optimizing a linear function over the set of efficient solution of a bicriterion linear program. We show that problem (P) can arise in a variety of practical situations. Since the efficient set is in general a nonoconvex set, problem (P) can be classified as a global optimization problem. The algorithm for solving problem (P) is guaranteed to find an exact optimal or almost exact optimal solution for the problem in a finite number of iterations. The algorithm can be easily implemented using only linear programming method.