An Optimization Algorithm for a Class of Mathematical Model in Mechanical Engineering

Jing Ben Yin; Jie Sheng Yan; Ying Feng Zhao; Hong Wei Jiao

doi:10.4028/www.scientific.net/AMM.26-28.813

Paper Titles

Structural Design and Analysis on Frame of Blueberry Harvesters Based on ANSYS
p.794

Research on Flexible Cables Simulation Based on CATIA/DELMIA
p.800

Study on Nonlinear Dynamic Response of the Gear-Shaft-Housing Coupling System
p.805

Game Strategy in Multi-User Shared Virtual Environment Based on Internet
p.809

An Optimization Algorithm for a Class of Mathematical Model in Mechanical Engineering
p.813

The Modeling and Integrating Issues of EII- Oriented QMS in Manufacturing Enterprises
p.817

Study on Scheduling Optimization for Flexible Job Shop
p.821

Slagging Process Simulation Based on Improved BP Neural Network
p.826

Durability of Wood-PMMA Composite
p.830

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 26-28An Optimization Algorithm for a Class of...

An Optimization Algorithm for a Class of Mathematical Model in Mechanical Engineering

Abstract:

In this paper, we develop an algorithm to globally solve a class of mathematical models in system engineering. Firstly, by utilizing equivalent problem and linear relaxation method, a linear relaxation programming of original problem is established. Secondly, by using branch and bound technique, a determined branch and bound algorithm is proposed for globally solving original problem. Finally, the convergence of the proposed algorithm is given and numerical examples showed that the presented algorithm is feasible.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 26-28)

Pages:

813-816

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.26-28.813

Citation:

Cite this paper

Online since:

June 2010

Authors:

Jing Ben Yin, Jie Sheng Yan, Ying Feng Zhao, Hong Wei Jiao

Keywords:

Bound, Branch Algorithm, Linear Relaxation, Mathematical Models, Mechanical Engineering

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] H. Jiao, Y. Guo, Y. Shen. Global Optimization for a Class of Sum of Ratios Problems, MATHEMATICA APPLICATA , 2009, 22(1): 717-728.

Google Scholar

[2] H. Jiao, P. Shen. A note on the paper global optimization of nonlinear sum of ratios, Applied Mathematics and Computation, 2007, 188: 1812-1815.

DOI: 10.1016/j.amc.2006.11.047

Google Scholar

[3] P. Shen, H. Jiao. A new rectangle branch-and-pruning approach for generalized geometric programming, Applied Mathematics and Computation, 2006, 183: 1027-1038.

DOI: 10.1016/j.amc.2006.05.137

Google Scholar

[4] P. Shen, G. Yuan. Global optimization for sum of generalized polynomial fractional functions. Mathematical Methods of Operational Research, 2007, 65(3): 445-459.

DOI: 10.1007/s00186-006-0130-0

Google Scholar

[5] Q. Feng, e tal. A branch and bound algorithm for generalized polynomial programming problems. Proceedings of 2009 Information Engineering and Computer Science, (2009).

DOI: 10.1109/iciecs.2009.5365116

Google Scholar

[6] P. S. V. Nataray, K. Kotecha, Global optimization with higher order inclusion function forms, part1: a combined Taylor-Bernsteinform, Reliable Computing 1 (2004) 27-44.

DOI: 10.1023/b:reom.0000003995.08805.2a

Google Scholar