Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
