• Interaction and multiscale mechanics
• /
• v.1 no.1
• /
• pp.103-121
• /
• 2008

This paper presents an optimization-based method for computing a minimal bounding ellipsoid that contains the set of static responses of an uncertain braced frame. Based on a non-stochastic modeling of uncertainty, we assume that the parameters both of brace stiffnesses and external forces are uncertain but bounded. A brace member represents the sum of the stiffness of the actual brace and the contributions of some non-structural elements, and hence we assume that the axial stiffness of each brace is uncertain. By using the $\mathcal{S}$-lemma, we formulate a semidefinite programming (SDP) problem which provides an outer approximation of the minimal bounding ellipsoid. The minimum bounding ellipsoids are computed for a braced frame under several uncertain circumstances.

• Geomechanics and Engineering
• /
• v.35 no.2
• /
• pp.149-163
• /
• 2023

This paper presents stability evaluation of unlined tunnels with semi-circular arch and straight sides (SASS) driven in non-homogeneous and anisotropic undrained clay. Numerical analysis has been conducted based on lower bound finite element limit analysis with second order cone programming under plane strain condition. The solutions will be used for the assessment of stability of unlined semi-circular arch tunnels and tunnels in which semi-circular roof is supported over rectangular/square sections. The stability charts have been generated in terms of a non-dimensional factor considering linear variation in undrained anisotropic strength for normally consolidated and lightly over consolidated clay with depth, and constant undrained anisotropic strength for heavily over-consolidated clay across the depth. The effect of normalized surcharge pressure on ground surface, non-homogeneity and anisotropy of clay, tunnel cover to width ratio and height to width ratio of tunnel on the stability factor and associated zone of shear failure at yielding have been examined and discussed. The geometry of tunnel in terms of shape and size, and non-homogeneity and anisotropy in undrained strength of clay has been observed to influence significantly the stability of unlined SASS tunnels.

• Korean Journal of Food Science and Technology
• /
• v.31 no.2
• /
• pp.385-390
• /
• 1999

Noodle was made using a combination of yulmu, wheat and water through mixture design. Statistical models of yulmu noodle were shown by analysing tensile stress and color $(L^{*})$, and sensory evaluation with other constraints. Analysing the linear and non-linear model, the linearity in the values of tensile stress, lightness $(L^{*})$ and sensory evaluation showed that each component worked separately without interactions. In studying the component effect on the response by trace plot, the result indicated that the increase in the amount of yulmu enhanced tensile stress of noodle while degrading $L^{*}$ value and sensory evaluation score. In the range of satisfying the conditions of noodle in every tensile stress, $L^{*}$ value and sensory evaluation point, the optimum mixture ratio of yulmu : wheat : water was 2.27% : 66.28% : 28.45% based on least cost linear programming. In this calculation, the least cost was 9.924 and estimated potential results of the response for tensile stress was 2.234 N and those for $L^{*}$ was 82.39. Finally, the potential response results affected by mixture ratio of yulmu, wheat and water were screened using Excel.

• Journal of Power System Engineering
• /
• v.21 no.6
• /
• pp.56-61
• /
• 2017

The check valves are mechanical valves that permit fluids to flow in only one direction, preventing flow from reversing. It is classified as one way directional valves. There are various types of check valves that used in a marine application. A lift type check valve uses the disc to open and close the passage of fluid. The disc lift up from seat as pressure below the disc increases, while drop in pressure on the inlet side or a build up of pressure on the outlet side causes the valve to close. An important concept in check valves is the cracking pressure which is the minimum upstream pressure at which the valve will operate. On the other hand, optimization is a process of finding the best set of parameters to reach a goal while not violating certain constraints. The AMESim software provides NLPQL(Nonlinear Programming by Quadratic Lagrangian) and genetic algorithm(GA) for optimization. NLPQL is the implementation of a SQP(sequential quadratic programming) algorithm. SQP is a standard method, based on the use of a gradient of objective functions and constraints to solve a non-linear optimization problem. A characteristic of the NLPQL is that it stops as soon as it finds a local minimum. Thus, the simulation results may be highly dependent on the starting point which user give to the algorithm. In this paper, we carried out optimization design of the check valve with NLPQL algorithm.

• Water for future
• /
• v.27 no.4
• /
• pp.59-67
• /
• 1994

The objective of this study is to develop a method which can design an optimal pipe network system using nonlinear programming(NLP) technique. The method finds the minimum-cost pipe network while satisfying all the design constraints including hydraulic constraints. The method developed in this study was applied to the Goyang distribution area in Goyang, Kyoungi-do. It has been found in the application and the comparison between the original design and the optimal design of this study that the optimal design method developed in this study does not require the trial-and-error procedure while satisfying the discharge and pressure requirements at the demanding nodes. Therefore, the optimal design method using NLP could be effectively utilized in the practical design considering economic aspect of the pipe network system at the same time.

• Journal of Korean Society of Transportation
• /
• v.12 no.4
• /
• pp.53-63
• /
• 1994

도시확산과 지방분권화의 시대적 추세는 도시경제 및 교통-토지이용모형의 구조에 도 영향을 미치고 있다. 첫째, 도시의 공간적 확산과 고밀도화로 인한 도시내 제반 경제.사 회활동이 이전보다는 훨씬 다양해지고 복잡해지고 있다. 둘째, 지방분권화로 인해 대도시내 작은 지역단위별 주민들이 자신의 지역문제에 대한 관심과 요구들이 증가하고 있다. 또한 대부분의 도시계획 및 정책은 대도시내 공간적으로 뿐만 아니라 서로 다른 이익집단에 상이 한 영향을 미치는 것으로 파악되고 있다. 이러한 요인으로 인해 대도시 모형은 1) 도시내 제반활동의 흐름을 체계적으로 분석할 수 있어야 하며, 2) 도시계획 및 정책의 효과를 도시 내 세분화된 공간별, 업종별로 분석할 수 있어야 한다. 본 연구는 Wilson의 모형에 도시내 중요한 경제활동인 통근과 shopping변수를 추가하여 Wilson의 모형이 대도시모형으로 이용 될 때 발생하는 문제를 해결하였다. 또한 모형을 구성함에 있어 Matrix Inversion과 Non-linear Programming Model의 두 가지 방법을 도입하고 그 장단점을 비교하였다. Matrix Inversion의 경우 해 (Solution)을 찾기가 쉬워 실질적이고 승수계산과정에서 각 Round마다 승수의 크기를 알 수 있는 반면 Programming을 통한 모형의 경우 제약식의 도 입이 용이하고 목적함수의 형태를 바꾸는 것이 가능하므로 이론적 기틀을 세우는데 유리한 접근방법으로 분석되었다.

• Journal of Mechanical Science and Technology
• /
• v.20 no.3
• /
• pp.366-375
• /
• 2006

In this paper, it is intended to introduce a method to solve multi-objective optimization problems and to evaluate its performance. In order to verify the performance of this method it is applied for a vertical roller mill for Portland cement. A design process is defined with the compromise decision support problem concept and a design process consists of two steps: the design of experiments and mathematical programming. In this process, a designer decides an object that the objective function is going to pursuit and a non-linear optimization is performed composing objective constraints with practical constraints. In this method, response surfaces are used to model objectives (stress, deflection and weight) and the optimization is performed for each of the objectives while handling the remaining ones as constraints. The response surfaces are constructed using orthogonal polynomials, and orthogonal array as design of experiment, with analysis of variance for variable selection. In addition, it establishes the relative influence of the design variables in the objectives variability. The constrained optimization problems are solved using sequential quadratic programming. From the results, it is found that the method in this paper is a very effective and powerful for the multi-objective optimization of various practical design problems. It provides, moreover, a reference of design to judge the amount of excess or shortage from the final object.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.3
• /
• pp.169-180
• /
• 2015

Recently, scheduling problems with position-dependent processing times have received considerable attention in the literature, where the processing times of jobs are dependent on the processing sequences. However, they did not consider cases in which each processed job has different learning or aging ratios. This means that the actual processing time for a job can be determined not only by the processing sequence, but also by the learning/aging ratio, which can reflect the degree of processing difficulties in subsequent jobs. Motivated by these remarks, in this paper, we consider a two-agent single-machine scheduling problem with linear job-dependent position-based learning effects, where two agents compete to use a common single machine and each job has a different learning ratio. Specifically, we take into account two different objective functions for two agents: one agent minimizes the total weighted completion time, and the other restricts the makespan to less than an upper bound. After formally defining the problem by developing a mixed integer non-linear programming formulation, we devise a branch-and-bound (B&B) algorithm to give optimal solutions by developing four dominance properties based on a pairwise interchange comparison and four properties regarding the feasibility of a considered sequence. We suggest a lower bound to speed up the search procedure in the B&B algorithm by fathoming any non-prominent nodes. As this problem is at least NP-hard, we suggest efficient genetic algorithms using different methods to generate the initial population and two crossover operations. Computational results show that the proposed algorithms are efficient to obtain near-optimal solutions.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1901-1904
• /
• 2003

MPC or model predictive control is representative of control methods which are able to handle physical constraints. Closed-loop stability can therefore be ensured only locally in the presence of constraints of this type. However, if the system is neutrally stable, and if the constraints are imposed only on the input, global aymptotic stability can be obtained; until recently, use of infinite horizons was thought to be inevitable in this case. A globally stabilizing finite-horizon MPC has lately been suggested for neutrally stable continuous-time systems using a non-quadratic terminal cost which consists of cubic as well as quadratic functions of the state. The idea originates from the so-called small gain control, where the global stability is proven using a non-quadratic Lyapunov function. The newly developed finite-horizon MPC employs the same form of Lyapunov function as the terminal cost, thereby leading to global asymptotic stability. A discrete-time version of this finite-horizon MPC is presented here. The proposed MPC algorithm is also coded using an SQP (Sequential Quadratic Programming) algorithm, and simulation results are given to show the effectiveness of the method.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10b
• /
• pp.30-35
• /
• 1993

Simple recurrence relations for calculating completion times of various storage polices (unlimited, intermediate storages(FIS), finite intermediate storages(FIS), no intermediate storage(NIS), zero wait(ZW) for serial multi-product multi-unit processes are suggested. Not only processing times but also transfer times, set-up (clean-up) times of units and set-up times of storages are considered. Optimal scheduling strategies with zero transfer times and zero set-up times had been developed as a mixed integer linear programniing(MILP) formulation for several intermediate storage policies. In this paper those with non-zero transfer times, non-zero set-up times of units and set-up times of storages are newly proposed as a mixed integer nonlinear programming(MINLP) formulation for various storage polices (UIS, NIS, FIS, and ZW). Several examples are tested to evaluate the robustness of this strategy and reasonable computation times.