• Kyungpook Mathematical Journal
• /
• v.62 no.1
• /
• pp.89-106
• /
• 2022

We are concerned with finding a common solution to an equilibrium problem associated with a bifunction, and a constrained convex minimization problem. We propose an iterative fixed point algorithm and prove that the algorithm generates a sequence strongly convergent to a common solution. The common solution is identified as the unique solution of a certain variational inequality.

• Journal of KSNVE
• /
• v.4 no.1
• /
• pp.59-69
• /
• 1994

A new LMS algorithm titled constrained LMS' is proposed for problems with constrained structure. The conventional LMS algorithm can not be used because it destroys the constrained structures of the weights or parameters. Proposed method uses error-back propagation, which is popular in training neural networks, for error minimization. The illustrative examplesare shown to demonstrate the applicability of the proposed algorithm.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.305-314
• /
• 2007

This paper considers single machine scheduling problems where the processing time of a job increases as a function of its position in the sequence. In this model, the later a given job is scheduled in the sequence, the longer its processing time. It is shown that the optimal schedule may be very different from that of the classical version of the problem. We introduce polynomial solutions for the makespan minimization problem, the sum of completion times minimization problem and the sum of earliness penalties minimization problem. For two resource constrained problems, based on the analysis of the problems, the optimal resource allocation methods are presented, respectively.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.8
• /
• pp.1799-1809
• /
• 1995

The applicability of the field-consistency paradigm, which was originally employed for analysis of locking due to constrained energy having the second power of a strain, is extended to the constrained energy having a quadratic form of strain. For the extension, nearly-incompressible plane strain problem is considered by introducing the concept of reduced minimization. The field-consistent analysis of the plane strain problem leads to a clear and systematic understanding on the relation amongst constraints imposed on element, spurious constraint -free optimal points, and integration order used.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.12
• /
• pp.3792-3803
• /
• 1996

Since the skew beam element has two curvatures which are a curvature and a torsion, spatial behavior of curved beam which cannot be included in one plane can be anlayzed by emploting the skew beam element. The $C^{0}$-continuous skew beam element shows the stiffness locking phenomenon when full integration is employed. The locking phenomenpn is characterized by two typical phenomena ; one is the much smaller displacement thant the exact one and theother is the undelation phenomenon is stress distribution. In this paper, we examine how unmatched coefficient in the constrained energy brings about the locking by Reduced Minimization theory. We perform the numerical ones. These comparisons show that uniformly full integration(UFI), which employs full integration for the constrained energy, entails the locking phenomenon. But the use of uniformly reduced integration(URI) of selectively reduced integration(SRI), which employs reduced integration for constrained energy, does not produce the significant errors of displacements of the undulation phenomenon in stress distribution since they do not entails the locking, Additionally, the error due to the approximated parameters for describing the geometry of skew beam is examined.d.

• Journal of Mechanical Science and Technology
• /
• v.18 no.10
• /
• pp.1691-1699
• /
• 2004

The objective of this study is to present an accurate and simple method to describe the motion of constrained mechanical or structural systems. The proposed method is an elimination method to require less effort in computing Moore-Penrose inverse matrix than the generalized inverse method provided by Udwadia and Kalaba. Considering that the results by numerical integration of the derived second-order differential equation to describe constrained motion veer away the constrained trajectories, this study presents a numerical integration scheme to obtain more accurate results. Applications of holonomically or nonholonomically constrained systems illustrate the validity and effectiveness of the proposed method.

• Communications of the Korean Mathematical Society
• /
• v.18 no.1
• /
• pp.65-73
• /
• 2003

In this paper we seek a positive, radially symmetric and energy minimizing solution of an m-Laplacian equation, -div$($\mid${\nabla}u$\mid$^{m-2}$\mid${\nabla}u)\;=\;h(u)$. In the variational sense, the solutions are the critical points of the associated functional called the energy, $J(v)\;=\;\frac{1}{m}\;\int_{R^N}\;$\mid${\nabla}v$\mid$^m\;-\;\int_{R^N}\;H(v)dx,\;where\;H(v)\;=\;{\int_0}^v\;h(t)dt$. A positive, radially symmetric critical point of J can be obtained by solving the constrained minimization problem; minimize{$\int_{R^N}$\mid${\nabla}u$\mid$^mdx$\mid$\;\int_{R^N}\;H(u)d;=\;1$}. Moreover, the solution minimizes J(v).

• Proceedings of the Korea Concrete Institute Conference
• /
• 1998.10b
• /
• pp.718-723
• /
• 1998

The program which could determine cross-sectional dimension of the prestressed concrete box girder bridges at the stage of preliminary design was developed using the optimal technique in this study. It could minimize the cost required in the design of box girder bridges and the construction with the full staging method. Objective cost function consisted of six independent variables such as height of cross-section, jacking force and thickness of web and bottom flange. The SUMT(Sequntial Unconstrained minimization Technique) was used to solve the constrained nonlinear minimization optimal problem. Using the program developed in this study, optimum design was performed for existing bridges with one cell cross section of constant depth. The result verify the compatibility of the program.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.3
• /
• pp.95-108
• /
• 2013

The problem of constrained sequencing of a set of jobs on a conveyor system with the objective of minimizing setup cost is investigated in this paper. A setup cost is associated with extra material, labor, or energy required due to the change of attributes in consecutive jobs at processing stations. A finite set of attributes is considered in this research. Sequencing is constrained by the availability of conveyor junctions. The problem is motivated by the paint purge reduction problem at a major U.S. automotive manufacturer. We first model a diverging junction with a sequence-independent setup cost and predefined attributes as an assignment problem and this model is then extended for a more general situation by relaxing the initial assumptions in various ways.

• Journal of the KSME
• /
• v.21 no.4
• /
• pp.259-263
• /
• 1981

본고의 목적은 제한조건이 있는 최소화(constrained minimization) 문제를 해석하는데 있어서 효과적인 방법으로 받아 들여지고있는 Penalty method 에 대한 간단한 개념과 이러한 류의 문제를 해석하는데 이미 사용되어 온 Lagrange multiplier method 와의 연관성, 그리고 이의 유한요소법에의 적용시 고려사항 등에 대하여 간략하게 소개하는데 있다.