• Journal of Korea Water Resources Association
• /
• v.35 no.5
• /
• pp.541-552
• /
• 2002

Two global optimization methods, the SCE-UA method and the Annealing-Simplex(A-S) method for calibrating a daily rainfall-runoff model, a Tank model, was compared with that of the Downhill Simplex method. In synthetic data study, 100% success rates for all objective functions were obtained from the A-S method, and the SCE-UA method was also consistently able to obtain good estimates. The Downhill Simplex method was converged to the true values only when the initial guess was close to the true values. In the historical data study, the A-S method and the SCE-UA method showed consistently good results regardless of objective function. An objective function was developed, which puts more weight on the low flows.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.2
• /
• pp.217-225
• /
• 1999

Preprocessing is the essential technique in the implementation of the simplex method for large scale linear programming problems. In this research, we explained the effect of preprocessing in the simplex method, classified the techniques into four categories, and compared our results with those of HOPDM, CPLEX and Soplex by computational experiments. We also noted some implementing issues of preprocessing for the simplex method and the recovery of the optimal basis of the original problem from that of the preprocessed problem.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.13 no.4
• /
• pp.209-215
• /
• 1993

A stability analysis program(CSLOP) which can obtain the factor of safety and the critical failure surface at the same time is developed from this study. In order to improve existing slice methods, the general slice method of Gussmann is applied to compute the factor of safety, and the constrained simplex algorithm proposed by Box is applied to systematically locate the critical failure surface in slopes. The proposed method is applied to two examples of circular and noncircular slope stability and the results are compared to previously published solutions. Constrained simplex method is recommended to improve slope stability programs which provide for an automatic search of the critical failure mechanisms.

• Korean Management Science Review
• /
• v.11 no.3
• /
• pp.13-26
• /
• 1994

In this paper we studied an integration scheme of some simplex algorithms and some efficient techniques to get the stable solution in linear programming code. And we developed a linear programming package (LPAK) by introducing this scheme and techniques. In LPAK three different algorithms were integrated, which were two primal simplex algorithms using Two phase method and big-M method respectively, and the dual simplex algorithm. LPAK introduces several heuristic techniques in each step of simplex method in order to enhance the stability and efficiency. They were new heuristic methods in structuring initial basis, choosing entering variable, choosing dropping variable and performing reinversion. The experimental results on the NETLIB problems showed that LPAK provided the stable solutions.

• Journal of the Society of Naval Architects of Korea
• /
• v.35 no.2
• /
• pp.29-37
• /
• 1998

Linear equations of motion for submersibles are one of the rest important design parameters, which are used as a governing equation for the shape design and the controller design. But, the estimated maneuvering coefficients in equations of motion by using empirical formulae, theoretical calculations or model tests might have some errors. Therefore the maneuvering coefficients should be verified from sea trial test. In this study, parallel extended Kalman filter method, Nelder & Mead Simplex method and genetic algorithm were applied to the parameter identification of roll maneuvering coefficients based on sea trial data. As a result, it was verified that Nelder & Mead Simplex method gave the most satisfactory results for the mathmatical models and the sea trial data used in this study.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1997.10a
• /
• pp.52-55
• /
• 1997

In this paper, both the generalization of one artificial variable technique to the general bound problem and the efficient implementation of the technique are suggested. When the steepest-edge method is used as a pricing rule in the simplex method, it is easy to update the reduced cost and the simplex multiplier every iteration. Therefore, one artificial variable technique is more efficient than Wolfe's method in which the reduced cost and simplex multiplier must be recalculated in every iteration. When implementing the one artificial variable technique on the LP problems with the general bound restraints on the variables, an arbitrary basic solution which satisfies the bound restraints is sought first, and the artificial column which adjusts the infeasibility is introduced. The phase one of the simplex method minimizes the one artificial variable. The efficient implementation technique includes the splitting, scaling, storage of the artificial column, and the cure of infeasibility problem.

• Korean Management Science Review
• /
• v.13 no.3
• /
• pp.105-113
• /
• 1996

Constructing an initial basis is an important process in the simplex method. An initial basis greatly affects the number of iterations of iterations and the execution time in the simplex method. The purpose of this paper is to construct a good initial basis. First, to avoid linear dependency among the chosen columns, an enhanced Gaussian elimination method and a method using non-duplicated nonzero elements are developed. Second, for an order to choose variables, the sparsity of the column is used. Experimenal results show that the proposed method can reduce the number of iterations and the execution time compared with Bixby's method by 12%.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.1
• /
• pp.27-38
• /
• 1999

In this paper, Primal-Interior Dual-Simplex method(PIDS) and Dual-Interior Primal-Simplex method(DIPS) are developed for the general bounded linear programming. Two methods were implemented and compared with other pricing techniques for the Netlib. linear programming problems. For the PIDS, it shows superior performance to both most nagative rule and dual steepest-edge method since it practically reduces degenerate iterations and has property to reduce the problem. For the DIPS, pt requires less iterations and computational time than least reduced cost method. but it shows inferior performance to the dynamic primal steepest-edge method.

• Journal of Industrial Technology
• /
• v.20 no.B
• /
• pp.27-34
• /
• 2000

The definition of flatness is given by ISO, ANSI, KS, etc. but those standards don't mention about the specific methods for the flatness. So various solution models that are based on the Minimum Zone Method have been proposed as an optimization problem for the minimax curve fitting. But it has been rare to compare some optimization algorithms to make a guideline for choosing better algorithms in this field. Hence this paper examined and compared Genetic Algorithm and Simplex Method to the evaluation of flatness. As a result, Genetic Algorithm gave the better or equal flatness than Simplex Method but it has the inefficiency caused from the large number of iteration. Therefore, in the future, another researches about alternative algorithms including Hybrid Genetic Algorithm should be achieved to improve the efficiency of Genetic Algorithm for the evaluation of flatness.

• Journal of Korea Water Resources Association
• /
• v.31 no.3
• /
• pp.327-335
• /
• 1998

The distribution network is an essential part of all water supply systems. The cost of this portion of any sizable water supply system may amount to most of the entire cost of the project. This study tried to reduce the cost of the distribution system through optimization in system design. To determine pipe diameter considered in water distribution system design, a iterative procedure linked the flow analysis model and optimization model was used. Linear theory was introduced to analyze flowrate and revised-simplex method based on linear programming is used to optimize pipe diameter. This model was applied to wter distribution system with 22 and 35 pipes, and rapidly determine optimized commercial pipe diameters. Keywords : water distribution system, revised simplex method, optimum pipe diameters.