A Feasible Method for a Class of Mathematical Problems in Manufacturing System

Abstract:

Article Preview

In this paper a feasible method is proposed for solving a class of mathematical problems in manufacturing system and production system. By utilizing linearization technique the relaxation programming problem about the original problem is constructed. The proposed branch and bound algorithm is convergent to the global minimum of original problem through the successive refinement linear relaxation of the feasible region of objective function and solutions of a series of relaxation linear programming problem. And large number of experiments results show feasibility of presented method.

Info:

Periodical:

Key Engineering Materials (Volumes 460-461)

Edited by:

Yanwen Wu

Pages:

806-809

DOI:

10.4028/www.scientific.net/KEM.460-461.806

Citation:

Q. G. Feng et al., "A Feasible Method for a Class of Mathematical Problems in Manufacturing System", Key Engineering Materials, Vols. 460-461, pp. 806-809, 2011

Online since:

January 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.