Question: How to solve this in GAMS The formulated Integer Programming (IP) model seeks to minimize weekly costs while meeting demand and adhering to constraints: Objective:
The formulated Integer Programming (IP) model seeks to minimize weekly costs while meeting demand and adhering to constraints: Objective: Minimize Z=(xi FixedCost_i )+(xiyi) ShippingCost_ij) Subject to: 1. (y_ij)>= Demand_j for each j in A,B,C,D,E} 2. x_AlphaCity =1xBetaMetropolis =1 3. (xi)=0 (for all i and j ) 7. xi is binary (for all i )
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
