Login
Register
Submit a Paper
Propose a Special lssue
Open Access
ARTICLE
Upper and Lower Bounds of the Solution for the Superelliptical Plates Problem Using Genetic Algorithms
Computer Modeling in Engineering & Sciences 2012, 85(3), 193-206. https://doi.org/10.3970/cmes.2012.085.193
Download PDFAbstract
In this article, a new method combining the Mathematical Programming and the Method of Weighted Residual called MP-MWR is presented. Under the validation of maximum principle, and up on the collocation method, the differential equation can be transferred into a bilateral inequality problem. Applying the genetic algorithms helps to find optimal solutions of upper and lower bounds which satisfy the inequalities. Here, the method is verified by analyzing the deflection of superelliptical clamped plate problem. By using this method, the good approximate solution and its error bounds can be obtained effectively and accurately.Keywords
Cite This Article
APA Style
Tang, H., Yang, Y., Chen, C. (2012). Upper and lower bounds of the solution for the superelliptical plates problem using genetic algorithms. Computer Modeling in Engineering & Sciences, 85(3), 193-206. https://doi.org/10.3970/cmes.2012.085.193
Vancouver Style
Tang H, Yang Y, Chen C. Upper and lower bounds of the solution for the superelliptical plates problem using genetic algorithms. Comput Model Eng Sci. 2012;85(3):193-206 https://doi.org/10.3970/cmes.2012.085.193
IEEE Style
H. Tang, Y. Yang, and C. Chen, “Upper and Lower Bounds of the Solution for the Superelliptical Plates Problem Using Genetic Algorithms,” Comput. Model. Eng. Sci., vol. 85, no. 3, pp. 193-206, 2012. https://doi.org/10.3970/cmes.2012.085.193
Copyright © 2012 The Author(s). Published by Tech Science Press.This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Downloads
Citation Tools
