A Note on a Class of Optimization Problems in System Engineering

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

doi:10.4028/www.scientific.net/AMM.29-32.1063

Paper Titles

A New Verification Method of Digital Circuits Based on Cone-Oriented Partitioning and Decision Diagrams
p.1040

Research on Force Feedback-Based Tool Operation in Virtual Assembly
p.1046

Research on CANopen-Based Intelligent Sensor for Ship Monitoring System
p.1051

A Modeling and Representation Method for Virtual Assembly System
p.1057

A Note on a Class of Optimization Problems in System Engineering
p.1063

Design of Precision Micro-Milling Machine for Meso-Scaled Parts
p.1068

Investigation of Micro-Milling Force Based on Miniature Machine Tool
p.1074

Parameter Optimization of Hydraulic Hybrid Vehicle Based on Genetic Algorithm
p.1079

Configuration of Random Transducer Array in Irregular Region Based on Delaunay Triangulation
p.1085

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 29-32A Note on a Class of Optimization Problems in...

A Note on a Class of Optimization Problems in System Engineering

Abstract:

In this technical note, we develop an approach to globally solve a class of optimization problems in system engineering based on the recent paper ([1]). Actually the problem we investigated is more general, since we extend numerators and denominators of linear ratios to generalized polynomial functions. And we give a new linear relaxation method for obtaining the lower bound of problems. Our approach is easy to be implemented, since it need not additional special program to the upper and lower bound for numerator and denominator of each generalized polynomial ratio.

You might also be interested in these eBooks

Applied Mechanics And Mechanical Engineering

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 29-32)

Pages:

1063-1067

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.29-32.1063

Citation:

Cite this paper

Online since:

August 2010

Authors:

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

Keywords:

Bound, Branch Algorithm, Linear Relaxation, Optimization Problem, System Engineering

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

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

[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