Integer Goal Programs

Multiple Criteria Decision Making in Supply Chain Management 

---

Arthur, J. L. and A. Ravindran. 1980b. A branch and bound algorithm with constraint partitioning for integer goal programs. European Journal of Operational Research. 4 421-425. 

The best way to approach the retrofit synthesis of the heat-exchanger network is to model all five tasks simultaneously. A mixed-integer nonlinear programming model is usually formulated to accomplish this goal. 

A process-synthesis problem can be formulated as a combination of tasks whose goal is the optimization of an economic objective function subject to constraints. Two types of mathematical techniques are the most used mixed-integer linear programming (MILP), and mixed-integer nonlinear programming (MINLP). 

The goal of this paper is the development of a novel approaeh that overeomes these shortcomings. The key ideas of the proposed method are presented in seetion 2. The main variables and eonstraints of the mixed-integer linear programming (MILP) formulation are presented in section 3. The advantages of the new method are illustrated through a small example problem in seetion 4. 

Mehrbod et al. (2012) considered a multi-product, multi-time period CLSC network with manufacturing plants, distributors, retailers, return product collection centers, and recycling centers. The authors developed a bi-criteria mixed integer nonlinear program for the problem to minimize supply chain costs, delivery time of new products, and collection time of returned products. An interactive fuzzy goal programming method was used to solve the problem. 

The bids were accepted at sealed-bid, single-round auction. Once bids were submitted. Home Depot solved an integer program whose goal was to (1) provide service on all lanes (2) allocate a lane to one single carrier ... 

---