Optimal Problem Study For Slab & Order Matching In Iron & Steel Plants

The optimization of slab & order Matching is the urgent requirement of the iron & steel plant in current market situation. It has important meaning for improving the use rate of enterprise resources, elevating the product quality, shorting the delivery period and reducing the cost, raising the enterprise competition level in market economy. Aiming at solving the problem of slab & order matching in an iron and steel plant , an optimal multi-objective 0-1 programming model is established to maximize the utilization of material surplus on inventory and minimize the matching cost . The object function is incorporated by integration method. It is established that an constraint matrix tabulation of the equal matching account between line and row with adding virtual order and virtual slab. We can find up an initial basic feasible solution with the Vogel algorithm. Based on the model characteristic, we can find up iterative solutions with the dual variable method and the cycle method. In the ultimate ,we can find up the best solution. Then ,with practical instances` validating and its excellent exhibition, the model and the algorithm are the ideal way to solve the optimal problem of slab & order matching.