New Computational Method for a Class of Optimization Problems in Production System and System Engineering

Abstract:

In this paper, a new computational method is proposed for solving a class of optimization problems which have broad applications in production system and system engineering. Firstly, by exploiting structure of the problem, linear relaxation programming of the original problem is constructed. By using simplex method we can solve a sequence of linear relaxation programming, the proposed algorithm is convergent to the global minimum of original problem through the successive refinement of the feasible region of a series of linear programming problems. In finally, numerical experiments are given to show the feasible of the proposed method.

• Periodical: Applied Mechanics and Materials (Volumes 29-32)
• Pages: 1016-1021
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.29-32.1016
• Online since: August 2010
• Authors: Qi Gao Feng, Han Ping Mao, Yan Fang Wei, Hong Wei Jiao
• Keywords: Computational Micromechanics Method, Optimization Problem, Production Systems, System Engineering

References

[1] S. Schaible, J. Shi. Recent developments in fractional programming: single ratio and maxmin case, Proc. 3rd Int. Conf. Nonlinear Anal. Convex Anal., 2003: 493-506.

[2] S. Schaible. Fractional programming, in R. Horst and P. M. Pardalos (eds. ), Handbook of Global Optimization, Kluwer Academic Pulishers, Dordrecht-Boston-London, 1995, 168: 495-608.

[3] H. Konno, Y. Yajima and T. Matsui, Parametric simplex algorithms for solving a special class of nonconvex minimization problem, Journal of Global Optimization, 1991, 1: 65-81.

DOI: 10.1007/bf00120666

[4] H. Konno and H. Yamashita, Minimizing sums and products of linear fractional functions over a polytope, Naval Research Logistics, 1999, 46: 583-596.

DOI: 10.1002/(sici)1520-6750(199908)46:5<583::aid-nav8>3.0.co;2-5

[5] J.E. Falk and S.W. Palocsay, Image space analysis of generalized fractional programs, Journal of Global Optimization, 1994, 4: 63-88.

DOI: 10.1007/bf01096535

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

DOI: 10.1016/j.amc.2006.06.101

[7] H. Konno and M. Inori, Bond protfolio optimization by bilinear fractional programming, Journal of the Operations Research Society of Japan, 1989, 32: 143-158.

DOI: 10.15807/jorsj.32.143

[8] H. Jiao, Y. Chen, A note on a deterministic global optmization algorithm, Applied Mathematics and Computation, 2008, 202(1): 67-70.

DOI: 10.1016/j.amc.2008.01.021

[9] Tuy H., Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms, Journal of Global Optimization, 1991, 1(1): 23-36.

DOI: 10.1007/bf00120663

[10] R. Horst and H. Tuy, Global Optimization: Deterministic Approaches, 2nd Edition, Spring Verlag, Berlin, Germany, (1993).