• 대한수학회논문집
• /
• 제19권1호
• /
• pp.179-196
• /
• 2004

Mond-Weir type duals for multiobjective variational problems are formulated. Under generalized vector variational type I invexity assumptions on the functions involved, sufficient optimality conditions, weak and strong duality theorems are proved efficient and properly efficient solutions of the primal and dual problems.

• 제어로봇시스템학회논문지
• /
• 제22권8호
• /
• pp.656-664
• /
• 2016

While anthropomorphic robots are gaining interest, dual-arm robots are widely used in the industrial environment. Many methods exist in order to implement bimanual tasks by dual-arm robot. However, kinesthetic teaching is used in this paper. This paper suggests three different kinesthetic teaching methods that can implement most of the human task by the robot. The three kinesthetic teaching methods are joint level, task level, and contact level teaching. The task introduced in this paper is box packing, which is a popular and complex task in industrial environment. The task is programmed into the dual-arm robot by utilizing the suggested kinesthetic teaching method, and this paper claims that most tasks can be implemented by using the suggesting kinesthetic teaching methods.

• Management Science and Financial Engineering
• /
• 제10권2호
• /
• pp.103-118
• /
• 2004

$\epsilon$-sensitivity analysis is a kind of methods for performing sensitivity analysis for linear programming. Its main advantage is that it can be directly applied for interior-point methods with a little computation. Although $\epsilon$-sensitivity analysis was proposed several years ago, there have been no studies on its relationship with other sensitivity analysis methods. In this paper, we discuss the relationship between $\epsilon$-sensitivity analysis and sensitivity analysis using an optimal basis. First. we present a property of $\epsilon$-sensitivity analysis, from which we derive a simplified formula for finding the characteristic region of $\epsilon$-sensitivity analysis. Next, using the simplified formula, we examine the relationship between $\epsilon$-sensitivity analysis and sensitivity analysis using optimal basis when an $\epsilon$-optimal solution is sufficiently close to an optimal extreme solution. We show that under primal nondegeneracy or dual non degeneracy of an optimal extreme solution, the characteristic region of $\epsilon$-sensitivity analysis converges to that of sensitivity analysis using an optimal basis. However, for the case of both primal and dual degeneracy, we present an example in which the characteristic region of $\epsilon$-sensitivity analysis is different from that of sensitivity analysis using an optimal basis.

• 대한토목학회논문집
• /
• 제12권1호
• /
• pp.59-70
• /
• 1992

공학 및 구조최적설계에서 광범위하게 이용되고 있는 2차계획문제(QP)의 효율적인 해법을 개발하기 위하여, 먼저 QP의 해법으로 사용가능한 수학적 최적화기법들의 이론적 및 수치적 특성을 비교연구하였다. 원래 QP 및 쌍대 QP에 대하여 이론적 강건성이 확인된 심플렉스, 경사투영(GRP) 그리고 증대 라그란지승수 알고리즘의 컴퓨터 프로그램을 작성하고 수치적 수행성이 검토되었다. 연구결과, 잠재제약조건방책을 이용하는 원래 QP의 GRP 알고리즘과 쌍대 QP의 심플렉스 알고리즘이 다른 QP해법에 비하여 효율적이면서 강력한 방법임을 알 수 있었고, 제약함수의 수가 설계변수의 수보다 많을 때는 원래 QP의 GRP 알고리즘이 더욱 효율적이었다. 또 GRP 알고리즘과 심플렉스 알고리즘의 장점을 선별적으로 이용할 수 있는 조합 알고리즘이 제안되었다.

• 한국정보통신학회논문지
• /
• 제14권8호
• /
• pp.1877-1886
• /
• 2010

본 논문에서는 전기적인 퓨즈 프로그래밍을 이용한 1T-SRAM 리페어용 리던던시 제어 회로를 설계하였다. 공급전원이 낮아지더라도 외부 프로그램 전원을 사용하여 높은 프로그램 파워를 eFuse (electrical fuse)에 공급하면서 셀의 읽기 전류를 줄일 수 있는 듀얼 포트 eFuse 셀을 제안하였다. 그리고 제안된 듀얼 포트 eFuse 셀은 파워-온 읽기 기능으로 eFuse의 프로그램 정보가 D-래치에 자동적으로 저장되도록 설계하였다. 또한 메모리 리페어 주소와 메모리 액세스 주소를 비교하는 주소 비교 회로는 dynamic pseudo NMOS 로직으로 구현하여 기존의 CMOS 로직을 이용한 경우 보다 레이아웃 면적을 19% 정도 줄였다. 전기적인 퓨즈 프로그래밍을 이용한 1T-SRAM 리페어용 리던던시 제어 회로는 동부하이텍 $0.11{\mu}m$ Mixed Signal 공정을 이용하여 설계되었으며, 레이아웃 면적은 $249.02{\times}225.04{\mu}m^{2}$이다.

• 대한기계학회논문집
• /
• 제15권1호
• /
• pp.69-77
• /
• 1991

본 연구에서는 주로 약결합된 경우의 다로봇시스템에 대한 효과적인 운동조정 법을 개발하였다. 약결합된 경우의 다로봇시스템은 아크용접, 분사 도료, 금속면의 디버링, 복잡한 조립작업, 검사등 수많은 작업에 투입될 수 있다.그와 같은 작업들 은 대부분 연적경로제어(continuous path control)방법을 요구하고 있는데 다로봇시스 템인 경우 작업대 주위의 정지 혹은 이동 장애물이나 제로봇상호간의 충격포험성을 해 결할 수 있는 효과적인 장애물회피 능력을 추가적으로 요구하고 있다. 그리고 연적 경로제어 형태의 거의 대부분의 첨단부의 속도를 정속도로 유지해주어야만 한다. 따 라서 모든 로봇들을 지정된 경로의 이탈없이 가능한 최대등속도로 운동시키기 위한 다 로봇시스템의 충격회피운동제어 알고리즘을 개발하게되었다.

• 제어로봇시스템학회논문지
• /
• 제8권12호
• /
• pp.991-997
• /
• 2002

The concept of feasible & invariant region plays an important role to derive closed loop stability and achie adequate performance of constrained receding horizon predictive control. In this paper, we define a complex polyhedral feasible & invariant set for all stabilizable input-constrained linear systems by using a complex transform and propose a one-norm based receding horizon control scheme using these invariant sets. In order to get a larger stabilizable set, a convex hull of invariant sets which are defined for different state feedback gains is used as a target invariant set of the constrained receding horizon control. The proposed constrained receding horizon control scheme is formulated so that it can be solved via linear programming.

• Journal of applied mathematics & informatics
• /
• 제27권1_2호
• /
• pp.123-137
• /
• 2009

A multiobjective variational problem involving higher order derivatives is considered and Fritz-John and Karush-Kuhn-Tucker type optimality conditions for this problem are derived. As an application of Karush-Kuhn-Tucker optimality conditions, Wolfe type dual to this variational problem is constructed and various duality results are validated under generalized invexity. Some special cases are mentioned and it is also pointed out that our results can be considered as a dynamic generalization of the already existing results in nonlinear programming.

• 한국생산제조학회지
• /
• 제9권2호
• /
• pp.59-65
• /
• 2000

In this paper the comparison of the first order approximation schemes such as SLP(sequential linear programming) CONLIN(convex linearization) MMA(method of moving asymptotes) and the second order approximation scheme SQP(sequential quadratic programming) was accomplished for optimization of nonlinear structures. It was found that MMA and SQP are the most efficient methods for optimization. But the number of function call of SQP is much more than that of MMA. Therefore when it is considered with the expense of computation MMA is more efficient than SQP. In order to examine the efficiency of MMA for complex optimization problem it was applied to the helicopter tail boom con-sidering column buckling and local wall buckling constraints. it is concluded that MMA can be a very efficient approxima-tion scheme from simple problems to complex problems.

• 경영과학
• /
• 제11권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.