• Title/Summary/Keyword: Robust Optimization

Search Result 705, Processing Time 0.024 seconds

ROBUST DUALITY FOR NONSMOOTH MULTIOBJECTIVE OPTIMIZATION PROBLEMS

  • Lee, Gue Myung;Kim, Moon Hee
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.30 no.1
    • /
    • pp.31-40
    • /
    • 2017
  • In this paper, we consider a nonsmooth multiobjective robust optimization problem with more than two locally Lipschitz objective functions and locally Lipschitz constraint functions in the face of data uncertainty. We prove a nonsmooth sufficient optimality theorem for a weakly robust efficient solution of the problem. We formulate a Wolfe type dual problem for the problem, and establish duality theorems which hold between the problem and its Wolfe type dual problem.

Network Congestion Control using Robust Optimization Design

  • Quang, Bui Dang;Shin, Sang-Mun;Hwang, Won-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11B
    • /
    • pp.961-967
    • /
    • 2008
  • Congestion control is one of major mechanisms to avoid dropped packets. Many researchers use optimization theories to find an efficient way to reduce congestion in networks, but they do not consider robustness that may lead to unstable network utilities. This paper proposes a new methodology in order to solve a congestion control problem for wired networks by using a robust design principle. In our particular numerical example, the proposed method provides robust solutions that guarantee high and stable network utilities.

ROBUST DUALITY FOR GENERALIZED INVEX PROGRAMMING PROBLEMS

  • Kim, Moon Hee
    • Communications of the Korean Mathematical Society
    • /
    • v.28 no.2
    • /
    • pp.419-423
    • /
    • 2013
  • In this paper we present a robust duality theory for generalized convex programming problems under data uncertainty. Recently, Jeyakumar, Li and Lee [Nonlinear Analysis 75 (2012), no. 3, 1362-1373] established a robust duality theory for generalized convex programming problems in the face of data uncertainty. Furthermore, we extend results of Jeyakumar, Li and Lee for an uncertain multiobjective robust optimization problem.

A Note on Robust Combinatorial Optimization Problem

  • Park, Kyung-Chul;Lee, Kyung-Sik
    • Management Science and Financial Engineering
    • /
    • v.13 no.1
    • /
    • pp.115-119
    • /
    • 2007
  • In [1], robust combinatorial optimization problem is introduced, where a positive integer $\Gamma$ is used to control the degree of robustness. The proposed algorithm needs solutions of n+1 nominal problems. In this paper, we show that the number of problems needed reduces to $n+1-\Gamma$.

Implementation of the robust speed control system for DC servo motor using TDF compensator method (2자유도 보상법에 의한 직류서보전동기의 강인한 속도제어시스템 구현)

  • Kim, Dong-Wan
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.52 no.2
    • /
    • pp.74-80
    • /
    • 2003
  • In this paper, a robust two-degree-of-freedom(TDF) the speed control system using $H_{\infty}$ optimization method and real genetic algorithm is proposed for the robust stability and the robust performance in dc servo motor system. This control system composed of feedback and feedforward controller. The feedback(FB) controller with $H_{\infty}$ optimization method is designed for real genetic algorithm that is model matching problem using mixed sensitivity function. The feedforward(FF) controller with $H_{\infty}$optimization method is minimized the error between transfer function of the optimal model and the overall transfer function. The proposed robust two-degree-of-freedom speed control system is simulated to the dc servo motor. By the simulation, feedback controller can obtain the robust stability property and feedforward controller can obtain the robust performance property under modelling error. The performance of the dc servo motor is analyzed by the experiment setting. The validity of the proposed method is verified through being compared with pid(proportional integrated differential)control system design method for the dc servo motor.

Probabilistic Structure Design of Automatic Salt Collector Using Reliability Based Robust Optimization (신뢰성 기반 강건 최적화를 이용한 자동채염기의 확률론적 구조설계)

  • Song, Chang Yong
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.23 no.5
    • /
    • pp.799-807
    • /
    • 2020
  • This paper deals with identification of probabilistic design using reliability based robust optimization in structure design of automatic salt collector. The thickness sizing variables of main structure member in the automatic salt collector were considered the random design variables including the uncertainty of corrosion that would be an inevitable hazardousness in the saltern work environment. The probabilistic constraint functions were selected from the strength performances of the automatic salt collector. The reliability based robust optimum design problem was formulated such that the random design variables were determined by minimizing the weight of the automatic salt collector subject to the probabilistic strength performance constraints evaluating from reliability analysis. Mean value reliability method and adaptive importance sampling method were applied to the reliability evaluation in the reliability based robust optimization. The three sigma level quality was considered robustness in side constraints. The probabilistic optimum design results according to the reliability analysis methods were compared to deterministic optimum design results. The reliability based robust optimization using the mean value reliability method showed the most rational results for the probabilistic optimum structure design of the automatic salt collector.

Robust Optimization with Static Analysis Assisted Technique for Design of Electric Machine

  • Lee, Jae-Gil;Jung, Hyun-Kyo;Woo, Dong-Kyun
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.6
    • /
    • pp.2262-2267
    • /
    • 2018
  • In electric machine design, there is a large computation cost for finite element analyses (FEA) when analyzing nonlinear characteristics in the machine Therefore, for the optimal design of an electric machine, designers commonly use an optimization algorithm capable of excellent convergence performance. However, robustness consideration, as this factor can guarantee machine performances capabilities within design uncertainties such as the manufacturing tolerance or external perturbations, is essential during the machine design process. Moreover, additional FEA is required to search robust optimum. To address this issue, this paper proposes a computationally efficient robust optimization algorithm. To reduce the computational burden of the FEA, the proposed algorithm employs a useful technique which termed static analysis assisted technique (SAAT). The proposed method is verified via the effective robust optimal design of electric machine to reduce cogging torque at a reasonable computational cost.

A Study on Robust Design Optimization of Layered Plates Bonding Process Considering Uncertainties (적층판 결합공정의 불확정성을 고려한 강건최적설계)

  • Choi Joo-Ho;Lee Woo-Hyuk;Youn Byeng-Dong;Xi Zhimin
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2006.04a
    • /
    • pp.836-840
    • /
    • 2006
  • Design optimization of layered plates bonding process is conducted to achieve high product quality by considering uncertainties in a manufacturing process. During the cooling process of the sequential sub-processes, different thermal expansion coefficients lead to residual stress and displacement. thus resulting in defects on the surface of the adherent. So robust process optimization is performed to minimize the residual stress mean and variation of the assembly while constraining the distortion as well as the instantaneous maximum stress to the allowable limits. In robust process optimization, the dimension reduction (DR) method is employed to quantify both reliability and quality of the layered plate bonding. Using this method. the average and standard deviation is estimated. Response surface is constructed using the statistical data obtained by the DRM for robust objectives and constraints. from which the optimum solution is obtained.

  • PDF

ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS

  • Lee, Gue Myung;Son, Pham Tien
    • Bulletin of the Korean Mathematical Society
    • /
    • v.51 no.1
    • /
    • pp.287-301
    • /
    • 2014
  • In this paper, we prove a necessary optimality theorem for a nonsmooth optimization problem in the face of data uncertainty, which is called a robust optimization problem. Recently, the robust optimization problems have been intensively studied by many authors. Moreover, we give examples showing that the convexity of the uncertain sets and the concavity of the constraint functions are essential in the optimality theorem. We present an example illustrating that our main assumptions in the optimality theorem can be weakened.

Robust Optimization of Caliper Brake Disc Considering Tolerance (설계변수 및 매개변수의 공차를 고려한 캘리퍼 디스크 브레이크의 강건설계)

  • Kim, Jong-Hun;Park, Jeong-Min;Lee, Jong-Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.6
    • /
    • pp.905-913
    • /
    • 2003
  • Generally, most of optimization have been performed with fixed sizes and variables. But, the optimum value considering tolerance of design variables and material properties, might be useless owing to exist in infeasible region. It is needed that the tolerance of design variables and material properties is considered for a real design problem. A deterministic optimal solution can be in the feasible region by performing robust optimization considering tolerance. In the paper, robust design is suggested to gain an optimum insensitive to variation of design variables and it is applied for optimization problem of caliper disc brakes for vehicles.