• Title/Summary/Keyword: linear optimization

Search Result 1,658, Processing Time 0.024 seconds

Analysis and Optimization of Air-Core Permanent Magnet Linear Synchronous Motors with Overlapping Concentrated Windings for Ultra-precision Applications

  • Li, Liyi;Tang, Yongbin;Ma, Mingna;Pan, Donghua
    • Journal of international Conference on Electrical Machines and Systems
    • /
    • v.2 no.1
    • /
    • pp.16-22
    • /
    • 2013
  • This paper presents the analysis and optimization of air-core permanent magnet linear synchronous motor with overlapping concentrated windings to achieve high thrust density, high thrust per copper losses and low thrust ripple. For the motor design, we adopt equivalent magnetizing current (EMC) method to analyze the magnetic field and give analytical formulae for calculation of motor parameters such as no-load back EMF, dynamic force, thrust density and thrust per copper losses. Further, we proposed a multi-objective optimization by genetic algorithm to search for the optimum parameters. The design optimization is verified by 2-D Finite Element analysis (FEA).

Joint Transmitter and Receiver Optimization for Improper-Complex Second-Order Stationary Data Sequence

  • Yeo, Jeongho;Cho, Joon Ho;Lehnert, James S.
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.1-11
    • /
    • 2015
  • In this paper, the transmission of an improper-complex second-order stationary data sequence is considered over a strictly band-limited frequency-selective channel. It is assumed that the transmitter employs linear modulation and that the channel output is corrupted by additive proper-complex cyclostationary noise. Under the average transmit power constraint, the problem of minimizing the mean-squared error at the output of a widely linear receiver is formulated in the time domain to find the optimal transmit and receive waveforms. The optimization problem is converted into a frequency-domain problem by using the vectorized Fourier transform technique and put into the form of a double minimization. First, the widely linear receiver is optimized that requires, unlike the linear receiver design with only one waveform, the design of two receive waveforms. Then, the optimal transmit waveform for the linear modulator is derived by introducing the notion of the impropriety frequency function of a discrete-time random process and by performing a line search combined with an iterative algorithm. The optimal solution shows that both the periodic spectral correlation due to the cyclostationarity and the symmetric spectral correlation about the origin due to the impropriety are well exploited.

Efficient non-linear analysis and optimal design of biomechanical systems

  • Shojaei, I.;Kaveh, A.;Rahami, H.;Bazrgari, B.
    • Biomaterials and Biomechanics in Bioengineering
    • /
    • v.2 no.4
    • /
    • pp.207-223
    • /
    • 2015
  • In this paper a method for simultaneous swift non-linear analysis and optimal design/posture of mechanical/biomechanical systems is presented. The method is developed to get advantages of iterations in non-linear analysis and/or generations in genetic algorithm (GA) for the purpose of efficient analysis within the optimal design/posture. The method is applicable for both size and geometry optimizations wherein material and geometry non-linearity are present. In addition to established mechanical systems, the method can solve biomechanical models of human musculoskeletal system. Optimization-based procedures are popular methods for resolving the redundancy at joints wherein the number of unknown muscle forces is far more than the number of equilibrium equations. These procedures involve optimization of a cost function(s) which is assumed to be consistent with the central nervous system's strategy when activating muscles to assure equilibrium. However, because of the complexity of biomechanical problems (i.e., due to non-linear biomaterial, large deformation, redundancy of the problem and so on) efficient analysis are required within optimization procedures as suggested in this paper.

Algorithm for Profit per Cost Ratio of Product Portfolio Problem (제품 포트폴리오 문제의 원가 이익률 알고리즘)

  • Sang-Un Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.3
    • /
    • pp.139-143
    • /
    • 2023
  • The product portfolio problem(PPP) is an optimization problem that determines the production quantity of a particular product to obtain the maximum profit among the n products. Linear programming(LP) is known as the only way to solve this optimization problem. The linear programming method is a problem that optimizes n linear functions and uses LINGO or Excel solver. This paper proposes a simple algorithm that uses CPR, a product cost-profit ratio, to sort in CPR descending order and then determines the maximum allowed production quantity by hand as the actual production quantity. As a result of applying the proposed algorithm to six experimental data, it was shown that more accurate results can be obtained compared to the linear programming method.

Optimized Polynomial Neural Network Classifier Designed with the Aid of Space Search Simultaneous Tuning Strategy and Data Preprocessing Techniques

  • Huang, Wei;Oh, Sung-Kwun
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.2
    • /
    • pp.911-917
    • /
    • 2017
  • There are generally three folds when developing neural network classifiers. They are as follows: 1) discriminant function; 2) lots of parameters in the design of classifier; and 3) high dimensional training data. Along with this viewpoint, we propose space search optimized polynomial neural network classifier (PNNC) with the aid of data preprocessing technique and simultaneous tuning strategy, which is a balance optimization strategy used in the design of PNNC when running space search optimization. Unlike the conventional probabilistic neural network classifier, the proposed neural network classifier adopts two type of polynomials for developing discriminant functions. The overall optimization of PNNC is realized with the aid of so-called structure optimization and parameter optimization with the use of simultaneous tuning strategy. Space search optimization algorithm is considered as a optimize vehicle to help the implement both structure and parameter optimization in the construction of PNNC. Furthermore, principal component analysis and linear discriminate analysis are selected as the data preprocessing techniques for PNNC. Experimental results show that the proposed neural network classifier obtains better performance in comparison with some other well-known classifiers in terms of accuracy classification rate.

A Study on the Optimization Method of Building Envelope using Non-linear Programming (비선형계획법을 이용한 건물의 외피최적화 방법)

  • Won, Jong-Seo;Lee, Kyung-Hoi
    • KIEAE Journal
    • /
    • v.3 no.2
    • /
    • pp.17-24
    • /
    • 2003
  • The purpose of this study is to present rational methods of multi-criteria optimization of the envelope of buildings. The object is to determine the optimum R-value of the envelope of a building, based on the following criteria: minimum building costs (including the cost of materials and construction) and yearly heating costs. Mathematical model described heat losses and gains in a building during the heating season. It takes into consideration heat losses through wall, roof, floor and windows. Particular attention was paid to have a more detailed description of heat gains due to solar radiation. On the assumption that shape of building is rectangle in order to solve the problem, optimum R-value of the envelope of a building is determined by using non-linear programing methods(Kuhn-Tucker Conditions). The results constitute information for designers on the optimum R-value of a building envelope for energy saving buildings.

AN ELIGIBLE PRIMAL-DUAL INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION

  • Cho, Gyeong-Mi;Lee, Yong-Hoon
    • East Asian mathematical journal
    • /
    • v.29 no.3
    • /
    • pp.279-292
    • /
    • 2013
  • It is well known that each kernel function defines a primal-dual interior-point method(IPM). Most of polynomial-time interior-point algorithms for linear optimization(LO) are based on the logarithmic kernel function([2, 11]). In this paper we define a new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has ${\mathcal{O}}((log\;p){\sqrt{n}}\;log\;n\;log\;{\frac{n}{\epsilon}})$ and ${\mathcal{O}}((q\;log\;p)^{\frac{3}{2}}{\sqrt{n}}\;log\;{\frac{n}{\epsilon}})$ iteration bound for large- and small-update methods, respectively. These are currently the best known complexity results.

LINEAR PROGRAMMING OPTIMIZATION OF NUCLEAR ENERGY STRATEGY WITH SODIUM-COOLED FAST REACTORS

  • Lee, Je-Whan;Jeong, Yong-Hoon;Chang, Yoon-Il;Chang, Soon-Heung
    • Nuclear Engineering and Technology
    • /
    • v.43 no.4
    • /
    • pp.383-390
    • /
    • 2011
  • Nuclear power has become an essential part of electricity generation to meet the continuous growth of electricity demand. A Sodium-cooled Fast Reactor (SFR) was developed to extend uranium resource utilization under a growing nuclear energy scenario while concomitantly providing a nuclear waste management solution. Key questions in this scenario are when to introduce SFRs and how many reactors should be introduced. In this study, a methodology using Linear Programming is employed in order to quantify an optimized growth pattern of a nuclear energy system comprising light water reactors and SFRs. The optimization involves tradeoffs between SFR capital cost premiums and the total system U3O8 price premiums. Optimum nuclear growth patterns for several scenarios are presented, as well as sensitivity analyses of important input parameters.

AN ELIGIBLE KERNEL BASED PRIMAL-DUAL INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION

  • Cho, Gyeong-Mi
    • Honam Mathematical Journal
    • /
    • v.35 no.2
    • /
    • pp.235-249
    • /
    • 2013
  • It is well known that each kernel function defines primal-dual interior-point method (IPM). Most of polynomial-time interior-point algorithms for linear optimization (LO) are based on the logarithmic kernel function ([9]). In this paper we define new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has $\mathcal{O}(({\log}\;p)^{\frac{5}{2}}\sqrt{n}{\log}\;n\;{\log}\frac{n}{\epsilon})$ and $\mathcal{O}(q^{\frac{3}{2}}({\log}\;p)^3\sqrt{n}{\log}\;\frac{n}{\epsilon})$ iteration complexity for large- and small-update methods, respectively. These are currently the best known complexity results for such methods.

Speed Control of Linear Induction Motor using Sliding Mode Controller Considering the End Effects

  • Boucheta, A.;Bousserhane, I.K.;Hazzab, A.;Sicard, P.;Fellah, M.K.
    • Journal of Electrical Engineering and Technology
    • /
    • v.7 no.1
    • /
    • pp.34-45
    • /
    • 2012
  • In the present paper, the mover speed control of a linear induction motor (LIM) using a sliding mode control design is proposed, considering the end effects. First, the indirect field-oriented control LIM is derived, considering the end effects. The sliding mode control design is then investigated to achieve speed- and flux-tracking under load thrust force disturbance. The numerical simulation results of the proposed scheme present good performances in comparison to that of the classical sliding mode control.