• Title/Summary/Keyword: linear optimization

Search Result 1,662, Processing Time 0.021 seconds

A Robust Pole Placement for Uncertain Linear Systems via Linear Matrix Inequalities (선형행렬부등식에 의한 불확실한 선형시스템의 견실한 극점배치)

  • 류석환
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.11a
    • /
    • pp.476-479
    • /
    • 2000
  • This paper deals with a robust pole placement method for uncertain linear systems. For all admissible uncertain parameters, a static output feedback controller is designed such that all the poles of the closed loop system are located within the prespecfied disk. It is shown that the existence of a positive definite matrix belonging to a convex set such that its inverse belongs to another convex set guarantees the existence of the output feedback gain matrix for our control problem. By a sequence of convex optimization the aforementioned matrix is obtained. A numerical example is solved in order to illustrate efficacy of our design method.

  • PDF

Analyzing the Performance of a Davis-Putnam based Optimization Algorithm for the Index Selection Problem of Database Systems (데이터베이스 색인선택 문제에 대한 Davis-Putnam 기반 최적화 알고리즘의 성능 분석)

  • 서상구
    • The Journal of Information Technology and Database
    • /
    • v.7 no.2
    • /
    • pp.47-59
    • /
    • 2000
  • In this paper, we analyze the applicability of a general optimization algorithm to a database optimization problem. The index selection problem Is the problem to choose a set of indexes for a database in a way that the cost to process queries in the given workload is minimized subject to a given storage space restriction for storing indexes. The problem is well known in database research fields, and many optimization and/or heuristic algorithms have been proposed. Our work differs from previous research in that we formalize the problem in the form of non-linear Integer Programming model, and investigate the feasibility and applicability of a general purpose optimization algorithm, called OPBDP, through experiments. We implemented algorithms to generate workload data sets and problem instances for the experiment. The OPBDP algorithm, which is a non-linear 0-1 Integer Programming problem solver based on Davis-Putnam method, worked generally well for our problem formulation. The experiment result showed various performance characteristics depending on the types of decision variables, variable navigation methods and ocher algorithm parameters, and indicates the need of further study on the exploitation of the general purpose optimization techniques for the optimization problems in database area.

  • PDF

Efficient Approximation Method for Constructing Quadratic Response Surface Model

  • Park, Dong-Hoon;Hong, Kyung-Jin;Kim, Min-Soo
    • Journal of Mechanical Science and Technology
    • /
    • v.15 no.7
    • /
    • pp.876-888
    • /
    • 2001
  • For a large scaled optimization based on response surface methods, an efficient quadratic approximation method is presented in the context of the trust region model management strategy. If the number of design variables is η, the proposed method requires only 2η+1 design points for one approximation, which are a center point and tow additional axial points within a systematically adjusted trust region. These design points are used to uniquely determine the main effect terms such as the linear and quadratic regression coefficients. A quasi-Newton formula then uses these linear and quadratic coefficients to progressively update the two-factor interaction effect terms as the sequential approximate optimization progresses. In order to show the numerical performance of the proposed method, a typical unconstrained optimization problem and two dynamic response optimization problems with multiple objective are solved. Finally, their optimization results compared with those of the central composite designs (CCD) or the over-determined D-optimality criterion show that the proposed method gives more efficient results than others.

  • PDF

MINLP optimization of a composite I beam floor system

  • Zula, Tomaz;Kravanja, Stojan;Klansek, Uros
    • Steel and Composite Structures
    • /
    • v.22 no.5
    • /
    • pp.1163-1192
    • /
    • 2016
  • This paper presents the cost optimization of a composite I beam floor system, designed to be made from a reinforced concrete slab and steel I sections. The optimization was performed by the mixed-integer non-linear programming (MINLP) approach. For this purpose, a number of different optimization models were developed that enable different design possibilities such as welded or standard steel I sections, plastic or elastic cross-section resistances, and different positions of the neutral axes. An accurate economic objective function of the self-manufacturing costs was developed and subjected to design, resistance and deflection (in)equality constraints. Dimensioning constraints were defined in accordance with Eurocode 4. The Modified Outer-Approximation/Equality-Relaxation (OA/ER) algorithm was applied together with a two-phase MINLP strategy. A numerical example of the optimization of a composite I beam floor system, as presented at the end of this paper, demonstrates the applicability of the proposed approach. The optimal result includes the minimal produced costs of the structure, the optimal concrete and steel strengths, and dimensions.

Application of Linear Goal Programming to Large Scale Nonlinear Structural Optimization (대규모 비선형 구조최적화에 관한 선형 goal programming의 응용)

  • 장태사;엘세이드;김호룡
    • Computational Structural Engineering
    • /
    • v.5 no.1
    • /
    • pp.133-142
    • /
    • 1992
  • This paper presents a method to apply the linear goal programming, which has rarely been used to the structural opimization problem due to its unique formulation, to large scale nonlinear structural optimization. The method can be used as a multicriteria optimization tool since goal programming removes the difficulty in defining an objective function and constraints. The method uses the finite element analysis, linear goal programming techniques and successive linearization to obtain the solution for the nonlinear goal optimization problems. The general formulation of the structural optimization problem into a nonlinear goal programming form is presented. The successive linearization method for the nonlinear goal optimization problem is discussed. To demonstrate the validity of the method, as a design tool, the minimum weight structural optimization problems with stress constraints are solved for the cases of 10, 25 and 200 trusses and compared with the results of the other works.

  • PDF

Fundamental framework toward optimal design of product platform for industrial three-axis linear-type robots

  • Sawai, Kana;Nomaguchi, Yutaka;Fujita, Kikuo
    • Journal of Computational Design and Engineering
    • /
    • v.2 no.3
    • /
    • pp.157-164
    • /
    • 2015
  • This paper discusses an optimization-based approach for the design of a product platform for industrial three-axis linear-type robots, which are widely used for handling objects in manufacturing lines. Since the operational specifications of these robots, such as operation speed, working distance and orientation, weight and shape of loads, etc., will vary for different applications, robotic system vendors must provide various types of robots efficiently and effectively to meet a range of market needs. A promising step toward this goal is the concept of a product platform, in which several key elements are commonly used across a series of products, which can then be customized for individual requirements. However the design of a product platform is more complicated than that of each product, due to the need to optimize the design across many products. This paper proposes an optimization-based fundamental framework toward the design of a product platform for industrial three-axis linear-type robots; this framework allows the solution of a complicated design problem and builds an optimal design method of fundamental features of robot frames that are commonly used for a wide range of robots. In this formulation, some key performance metrics of the robot are estimated by a reducedorder model which is configured with beam theory. A multi-objective optimization problem is formulated to represent the trade-offs among key design parameters using a weighted-sum form for a single product. This formulation is integrated into a mini-max type optimization problem across a series of robots as an optimal design formulation for the product platform. Some case studies of optimal platform design for industrial three-axis linear-type robots are presented to demonstrate the applications of a genetic algorithm to such mathematical models.

Algorithm for Grade Adjust of Mixture Optimization Problem (혼합 최적화 문제의 성분 함량 조절 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.4
    • /
    • pp.177-182
    • /
    • 2021
  • Generally, the linear programming (LP) with O(n4) time complexity is applied to mixture optimization problem that can be produce the given ingredients grade product with minimum cost from mixture of various raw materials. This paper suggests heuristic algorithm with O(n log n) time complexity to obtain the solution of this problem. The proposed algorithm meets the content range of the components required by the alloy steel plate while obtaining the minimum raw material cost, decides the quantity of raw material that is satisfied with ingredients grade for ascending order of unit cost. Although the proposed algorithm applies simple decision technique with O(n log n) time complexity, it can be obtains same solution as or more than optimization technique of linear programing.

Active Vibration Control of Structure Using LMI Optimization Design of Robust Saturation Controller (강인 포화 제어기의 LMI 최적 설계를 이용한 구조물의 능동 진동 제어)

  • Park, Young-Jin;Moon, Seok-Jun;Lim, Chae-Wook
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.16 no.3 s.108
    • /
    • pp.298-306
    • /
    • 2006
  • In our previous paper, we developed a robust saturation controller for the linear time-invariant (LTI) system involving both actuator's saturation and structured real parameter uncertainties. This controller can only guarantee the closed-loop robust stability of the system in the presence of actuator's saturation. But we cannot analytically make any comment on control performance of this controller. In this paper, we suggest a method to use linear matrix inequality (LMI) optimization problem which can analytically explain control performance of this robust saturation controller only in nominal system. The availability of design method using LMI optimization problem for this robust saturation controller is verified through a numerical example for the building with an active mass damper (AMD) system.

Design of an Active Damping Layer Using Topology Optimization (위상 최적화를 이용한 능동 감쇠층의 설계)

  • 김태우;김지환
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2003.11a
    • /
    • pp.660-664
    • /
    • 2003
  • The optimal thickness distribution of an active damping layer is sought so that it satisfies a certain constraint on the dynamic performance of a system minimizing control efforts. To obtain a topologically optimized configuration, which includes size and shape optimization, thickness of the active damping layer is interpolated using linear functions. With the control energy as the objective function to be minimized, the state error energy is introduced as the dynamic performance criterion for the system and used lot a constraint. The optimal control gains are evaluated from LQR simultaneously as the optimization of the layer position proceeds. From numerical simulation, the topologically optimized distribution of the active damping layer shows the same dynamic performance and cost as the Idly covered counterpart, which is optimized only in terms of control gains, with less amount of the layer.

  • PDF

Shape Optimization of Structures in Opening Mode (열림 파괴양식에 대한 구조물의 형상 최적화)

  • 한석영;송시엽
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.10 no.2
    • /
    • pp.141-149
    • /
    • 2002
  • Most of mechanical failures are caused by repeated loadings and therefore they are strongly related to fatigue. To avoid the failures caused by fatigue, determination of an optimal shape of a structure is one of the very important factors in the initial design stage. Shape optimization for three types of specimens, which are very typical ones in opening mode in fracture mechanics, was accomplished by the linear elastic fracture mechanics and the growth-strain method in this study. The linear elastic fracture mechanics was used to estimate stress intensity factors and fatigue lives. And the growth-strain method was used to optimize the shape of the initial shape of the specimens. From the results of the shape optimization, it was concluded that shapes of three types of specimens optimized by the growth-strain method prolong their fatigue lives very much.