• 한국경영과학회지
• /
• 제17권1호
• /
• pp.3-16
• /
• 1992

We present a modified Tank and Hopfield's neural network model for solving Linear Programming problems. We have found the fact that the Tank and Hopfield's neural circuit for solving Linear Programming problems has some difficulties in guaranteeing convergence, and obtaining both the primal and dual optimum solutions from the output of the circuit. We have identified the exact conditions in which the circuit stops at an interior point of the feasible region, and therefore fails to converge. Also, proper scaling of the problem parameters is required, in order to obtain a feasible solution from the circuit. Even after one was successful in getting a primal optimum solution, the output of the circuit must be processed further to obtain a dual optimum solution. The modified model being proposed in the paper is designed to overcome such difficulties. We describe the modified model and summarize our computational experiment.

• 산업공학
• /
• 제13권4호
• /
• pp.725-737
• /
• 2000

This paper deals with the design and the development of user interface for a high speed linear programming solving system. The general users' educational and practical requirements are analyzed and the functionalities that should be implemented for the requirements are designed. The user interface of the system consists of various carefully designed built-in commands that perform the functionalities. The names of the build-in commands are chosen to enhance the users' convenience. We also address the various factors that should be considered in the design of the linear programming solvers when integrated with the user interface. As one of user-friendly environments, data input system that can understand user-written arithmetic form is added to our user interface system. Finally, we compare our system with other user interface systems.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제24권4호
• /
• pp.375-385
• /
• 2020

In this paper, a special indefinite inner product, named hyperbolic scalar product, is used and all acquired results have been raised and proved with the proviso that the space is equipped with this indefinite scalar product. The main objective is to be introduced and applied an indefinite oblique projection method, called Indefinite Lanczos J-biorthogonalizatiom process, which in addition to building a pair of J-biorthogonal bases for two used Krylov subspaces, leads to the introduction of a process for solving large non-J-symmetric linear systems, i.e., Indefinite two-sided Lanczos Algorithm for Linear systems.

• 정보보호학회논문지
• /
• 제16권2호
• /
• pp.13-24
• /
• 2006

여러 개체가 각자의 정보를 제공하여 이를 바탕으로 정보 제공자의 프라이버시를 보존하면서 공통의 유익한 정보를 얻고자 하는 다자간 협력 계산 프로토콜에 대해서 논한다. 금융, 제조업, 통신 분야 등에서 널리 응용되는 선형계(linear system)의 일반해(general solution)와 최소제곱해(least-square solution)를 구하는 문제에서 프라이버시를 보존하는 실용적인 다자간(multi-party) 협력 계산 프로토콜을 제안한다. 본 논문에 제안된 프로토콜은 기존의 양자간(two-party) 협력 계산 방식을 확장한 새로운 것으로 효율성 측면에서 우수한 실용적인 다자간 계산 프로토콜이다.

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

그로벌최적화문제(Global optimization problem)의 부류인 다목적선형계획법 ( MOLP ) (Multiple objective linear programming)에서 결정된 유효해집합(a set of efficient solutions)위에서 선형함수 최적화문제 ( Ρ )는 해집합이 볼록집합이 아니므로(nonconvex set) 일반적인 선형계획법을 활용하기가 어렵다. 현재까지 ( Ρ )의 최적화를 위해서 유효해집합의 모든 꼭지점(extreme point)를 찾거나 일련의 선형계획문제들을 최적화하여 최적해를 찾는 접근방법들이 있다. 이러한 방법들에는 ( MOLP )의 해집합의 차원(dimension)이 커짐에 따라 문제해결이 실제적으로 가능하지 않는 경우가 많다. 본 연구는 주어진 선형함수와 다목적선형함수들간 관계를 고찰하여 선형목적함수를 구성하고 그 목적함수를 이용하여 주어진 문제 (Ρ) 의 최적해를 찾는 선형계획적 접근방법을 제안한다.

• 충청수학회지
• /
• 제10권1호
• /
• pp.147-159
• /
• 1997

It is important to solve the large sparse linear system appeared in many application field such as $AA^Ty={\beta}$ efficiently. In solving this linear system, the sparse solver using the splitting method for the relatively dense column is experimentally better than the direct solver using the Cholesky method.

• 한국CDE학회논문집
• /
• 제1권2호
• /
• pp.158-162
• /
• 1996

Algorithms to find the Bezier control points of the image of a Bezier domain curve on a Bezier surface are described. The diagonal image curve is analysed and the general linear case is transformed to the diagonal case. This proposed algorithm gives the closed form solution to find the control points of the image curve of a linear domain curve. If the domain curve is not linear, the image curve can be obtained by solving the system of linear equations.

• 산업경영시스템학회지
• /
• 제19권40호
• /
• pp.137-142
• /
• 1996

An algorithm for solving the cardinality constrained linear programming knapsack problem is presented. The algorithm has a convenient structure for a branch-and-bound approach to the integer version, especially to the 0-1 collapsing knapsack problem. A numerical example is given.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제3권2호
• /
• pp.29-36
• /
• 1999

It is shown that a new Krylov subspace method for solving symmetric indefinite systems of linear equations can be obtained. We call the method as the projection method in this paper. The residual vector of the projection method is maintained at each iteration, which may be useful in some applications.

• 경영과학
• /
• 제11권3호
• /
• pp.35-46
• /
• 1994

The primal-dual log barrier code OB1(Optimization with Barriers 1) has been identified the most efficient one in reducing computer time and solving large linear programs. This is a brief survey of OB1's life-time and performance.