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

A generalized network problem is a special class of linear programming problem whose coefficient matrix contains at most two nonzero elements per column. A generalized network problem with 0-1 flow restrictions is called an integer generalized network(IGN) problem. In this paper, we presented a branch and bound algorithm for the IGN that uses network relaxation. To improve the procedure, we develop various strategies, each of which employs different node selection criterion and/or branching variable selection criterion. We test these solution strategies and compare their efficiencies with LINDO on 70 randomly generated problems.

• Journal of Korean Society for Quality Management
• /
• v.32 no.4
• /
• pp.242-251
• /
• 2004

Several statistical methods are introduced 1=o analyze the accelerated failure time data. Most frequently used method is the log-linear approach with parametric assumption. Since the accelerated failure time experiments are exposed to many environmental restrictions, parametric log-linear relationship might not be working properly to analyze the resulting data. The models proposed by Buckley and James(1979) and Stute(1993) could be useful in the situation where parametric log-linear method could not be applicable. Those methods are introduced in accelerated experimental situation under the thermal acceleration and discussed through an illustrated example.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.422_423
• /
• 2009

DNP 3.0 is the most widely used data communication protocol for electric power control systems. KEPCO(Korea Electric Power Corporation) also uses DNP 3.0 as a data transmission protocol for the DAS(Distribution Automation System) and the SCADA system of the transmmission system. But DNP 3.0 is one of the oldest industrial standard having many restrictions and there are many considerations for optimal design of DNP 3.0 network for the Distribution Automation System.

• IE interfaces
• /
• v.1 no.1
• /
• pp.17-26
• /
• 1988

This paper describes a nonlinear goal programming approach to the optimal composition of composite solid propellant taking multiple characteristics into consideration synchronously. The nonlinear goal programming model with response functions, restrictions and the optimal value of each characteristic is developed using Scheffe's "Experiments with mixtures" and preference weighting system. Objective functions are described based on process, performance and assurance characteristics. The systematic approach to optimal composition in this study is proved efficient through a CTPB-AL-AP propellant which is one of composite solid propellant systems.

• IE interfaces
• /
• v.1 no.1
• /
• pp.49-62
• /
• 1988

This paper deals with the case study that determines the best operating system of a container terminal using computer simulation techniques. For the simulation, SIMAN simulation language is used. The simulation model developed circumvents the dimensional restrictions imposed by the SIMAN package. Non-terminating simulation experiments are conducted for the 90 days' work on the basis of operation practices of real terminals.

• Communications of the Korean Mathematical Society
• /
• v.35 no.1
• /
• pp.229-241
• /
• 2020

For a second order linear differential equation f" + A(z)f' + B(z)f = 0, with A(z) and B(z) being transcendental entire functions under some restrictions, we have established that all non-trivial solutions are of infinite order. In addition, we have proved that these solutions, with a condition, have exponent of convergence of zeros equal to infinity. Also, we have extended these results to higher order linear differential equations.

• Korean Management Science Review
• /
• v.13 no.1
• /
• pp.1-12
• /
• 1996

This paper deals with production scheduling of block assembly shop in shipbuilding company. The Objectives of the schedule are leveling of daily total workload and fair assignment of workload to each department of the shop. Optimizing the objectives, we consider some restrictions which consisit of block due dates, workability of each department, and space restriction. We formulate the problem in mathematical form. But the model is too complex to find the optimal solution (the problem is NP-complete) and we use the genetic algorithm to find a good solution.

• Journal of the Korean Mathematical Society
• /
• v.31 no.4
• /
• pp.703-707
• /
• 1994

Since John and Nirenberg introduced the BMO in early 1960 [JN], it has been one of the most significant function spaces. The significance of BMO lies in the fact that BMO is a limiting space of $L^p (p \longrightarrow \infty)$, or a proper substitute of $L^\infty$. A dual statement of this would be that the Hardy space $H^1$ is a proper substitute of $L^1$.

• Bulletin of the Korean Mathematical Society
• /
• v.35 no.4
• /
• pp.689-700
• /
• 1998

We consider an infinite dimensional dynamical system what is called Lattice Dynamical System given by a discrete nonlinear diffusion equation. By assuming the nonlinearity to be a general nonlinear function with mild restrictions, we show that as the diffusion parameter changes the stationery state of the given system undergoes bifurcations from the zero state to a bounded invariant set or a 3- or 4-periodic state in the global phase space of the given system according to the values of the coefficients of the linear part of the given nonlinearity.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.2
• /
• pp.387-400
• /
• 2009

We establish a new strategy to study the Hyers-Ulam-Rassias stability of the Cauchy and Jensen equations in non-Archimedean normed spaces. We will also show that under some restrictions, every function which satisfies certain inequalities can be approximated by an additive mapping in non-Archimedean normed spaces. Some applications of our results will be exhibited. In particular, we will see that some results about stability and additive mappings in real normed spaces are not valid in non-Archimedean normed spaces.