Optimization Algorithm for Solving a Kind of Mathematical Problems

Hong Wei Jiao; Kun Li

doi:10.4028/www.scientific.net/AMM.44-47.3423

Paper Titles

Forecast Model of Phreatic Surface on Tailings Dam Based on GM-GRNN Theory
p.3403

Comprehensive Evaluation Model-Based Fuzzy Math of Tailings Dam Stability
p.3408

Physical Insight of the Source Data of a Two-Port Acoustic Source Model
p.3413

KF-MA Model for Short-Term Traffic Flow Prediction Based on SCATS Data
p.3418

Optimization Algorithm for Solving a Kind of Mathematical Problems
p.3423

A Traffic Flow Forecasting Model Based on Variable Dimension Fractal Combined with Weekly Similarity
p.3427

Simulation Platform Development for Random Space Vector PWM
p.3433

Automatic Landmark Detecting by Flickr Photo Clustering
p.3438

Automatic Image Tagging via a Generative Probabilistic Model
p.3443

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 44-47Optimization Algorithm for Solving a Kind of...

Optimization Algorithm for Solving a Kind of Mathematical Problems

Abstract:

In this paper, we develop an algorithm to globally solve a kind of mathematical problem. 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 global optimization algorithm is proposed for solving equivalent problem. Finally, the convergence of the proposed algorithm is proven and numerical examples showed that the presented algorithm is feasible to solve the kind of mathematical problems.

You might also be interested in these eBooks

Frontiers of Manufacturing and Design Science

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 44-47)

Pages:

3423-3426

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.44-47.3423

Citation:

Cite this paper

Online since:

December 2010

Authors:

Hong Wei Jiao, Kun Li

Keywords:

Bound Technique, Branch Technique, Optimization Method, Relaxation Method

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] 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

[2] H. Konno, Y. Yajima, T. Matsui, Parametric simplex algorithm for solving a special class of nonlinear minimization problems, Journal of Global Optimization, 1991, 91: 65-81.

DOI: 10.1007/bf00120666

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, H. Jiao. Linearization method for a class of multiplicativeprogramming with exponent. Applied Mathematics and Computation, 2006, l. 83: 328-336.

DOI: 10.1016/j.amc.2006.05.074

Google Scholar

[5] E. A. Youness, Level set algorithm for solving convex multiplicative programming problems, Applied Mathematics and Computation, 2005, 167: 1412-1417.

DOI: 10.1016/j.amc.2004.08.028

Google Scholar

[6] X. G. Zhou, K. Wu, A comment on "Level set algorithm for solving convex multiplicative programming problems, Applied Mathematics and Computation, 2008, 204: 496-498.

DOI: 10.1016/j.amc.2008.05.143

Google Scholar