A Feasible Algorithm for a Class of Mathematical Problems in Mechanical System

Jing Ben Yin; Kun Li; Hong Wei Jiao; Yong Qiang Chen

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

Paper Titles

An Explicit Analysis Method for Walking-Beam Oil Pumping Unit
p.1008

Research on Quality Control Processes Management in Manufacturing Network Based on Workflow and Multi-Agent
p.1013

Optimization of PEM Fuel Cell System Using Dynamic Model
p.1019

Study of Wheat Straw Veneer on Weave Process
p.1027

A Feasible Algorithm for a Class of Mathematical Problems in Mechanical System
p.1032

Large Network Model of Complex Systems
p.1036

Research on Knowledge Transfer and Sharing in the Implement of Manufacturing EPR
p.1040

Solving Fuzzy U-Shaped Line Balancing Problem with Exact Method
p.1046

Wear Characteristic and Life of Al₂O₃/(W,Ti)C Ceramic Tool in Turning Iron-Based P/M Composites
p.1052

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 26-28A Feasible Algorithm for a Class of Mathematical...

A Feasible Algorithm for a Class of Mathematical Problems in Mechanical System

Abstract:

In this paper, we proposed an algorithm to globally solve a class of mathematical problems in mechanical system. Firstly, by utilizing equivalent problem and linear relaxation technique, a linear relaxation programming of original mathematical problem is established. Secondly, by using branch and bound theory, a feasible algorithm is proposed for globally solving original problem. Finally, the convergence of the proposed algorithm is proven, and numerical experiments 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:

1032-1035

DOI:

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

Citation:

Cite this paper

Online since:

June 2010

Authors:

Jing Ben Yin, Kun Li, Hong Wei Jiao, Yong Qiang Chen

Keywords:

Bound, Branch Algorithm, Mathematical Problem, Mechanical System, Relaxation Method

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] H.P. Benson, On the global optimization of sums of linear fractional functions over a convex set. Journal of Optimization Theory and Applications, 2004, 121: 19-39.

DOI: 10.1023/b:jota.0000026129.07165.5a

Google Scholar

[2] H. Konno, K. Fukaisi, A branch and bound algorithm for soling low rank linear multiplicative and fractional programming problems. Journal of Global Optimization, 2000, 18: 283-299.

Google Scholar

[3] Y. Wang, P. Shen, Z. Liang, A branch-and-bound algorithm to globally solve the sum of several linear ratios[J]. Applied Mathematics and Computation, 2005, 168: 89-101.

DOI: 10.1016/j.amc.2004.08.016

Google Scholar

[4] T. N. Hoai-Phung, H. Tuy, A unified monotonic approach to generalized linear fractional programming[J]. Journal of Global Optimization, 2003, 26: 229-259.

Google Scholar

[5] T. Kuno, A branch-and-bound algorithm for maximizing the sum of several linear ratios. Journal of Global Optimization, 2002, 22: 155-174.

Google Scholar

[6] H. Jiao, Y. Guo, P. Shen, Global optimization of generalized linear fractional programming with nonlinear constraints. Applied Mathematics and Computation, 2006, 183(2): 717-728.

DOI: 10.1016/j.amc.2006.05.102

Google Scholar

[7] Y. Ji, K. Zhang, S. Qu, A deterministic global optimization algorithm[J]. Applied Mathematics and Computation, 2007, 185: 382-387.

DOI: 10.1016/j.amc.2006.06.101

Google Scholar

[8] H. Jiao, et al., Global optimization for sum of linear ratios problem using new pruning technique. Mathematical Problems in Engineering, vol. 2008, Article ID 646205, 13 pages, 2008. doi: 10. 1155/2008/646205.

DOI: 10.1155/2008/646205

Google Scholar