# Linear Programming Formulation for Miamitown Mulch ## 1. **Decision Variables** Let’s define the variables for each mulch type, month, and possible price tier. ### **Black Hardwood Mulch** - \( B_{m,20} \): Tons of Black Hardwood ordered in month \( m \) at $20/ton (≤ 500/month) - \( B_{m,26} \): Tons of Black Hardwood ordered in month \( m \) at $26/ton (≤ 300/month) ### **Red Cedar Mulch** - \( R_{m,15} \): Tons of Red Cedar ordered in month \( m \) at $15/ton (≤ 350/month) - \( R_{m,18} \): Tons of Red Cedar ordered in month \( m \) at $18/ton (≤ 150/month) ### **Pine Bark Mulch** - \( P_{m} \): Tons of Pine Bark ordered in month \( m \) at $10/ton (≤ 1000/month) ### **Inventory Variables** - \( I_{B,m} \): Tons of Black Hardwood carried into month \( m \) - \( I_{R,m} \): Tons of Red Cedar carried into month \( m \) - \( I_{P,m} \): Tons of Pine Bark carried into month \( m \) Where \( m \in \{\text{April, May, June}\} \). --- ## 2. **Parameters** ### **Demand (tons)** | Month | Black Hardwood | Red Cedar | Pine Bark | |-------|---------------|-----------|-----------| | April | 400 | 300 | 250 | | May | 700 | 400 | 300 | | June | 375 | 325 | 175 | ### **Price Tiers Per Month** - Black Hardwood: Up to 500 tons @ $20/ton, next 300 tons @ $26/ton - Red Cedar: Up to 350 tons @ $15/ton, next 150 tons @ $18/ton - Pine Bark: Up to 1000 tons @ $10/ton ### **Inventory Constraint** - Total inventory at any time (across all types) ≤ 400 tons ### **Inventory Holding Cost** - 3% of base price per ton per month (base price = lowest price tier for each mulch) --- ## 3. **Objective Function** Minimize total cost (purchasing + inventory holding): \[ \text{Minimize } Z = \sum_{m} [20B_{m,20} + 26B_{m,26} + 15R_{m,15} + 18R_{m,18} + 10P_m] + \sum_{m} [0.6I_{B,m} + 0.45I_{R,m} + 0.3I_{P,m}] \] Where: - $0.6$ = 3% of $20$ (Black Hardwood holding cost per ton per month) - $0.45$ = 3% of $15$ (Red Cedar holding cost per ton per month) - $0.3$ = 3% of $10$ (Pine Bark holding cost per ton per month) --- ## 4. **Constraints** ### **a. Purchase Limits** For each month \( m \): - \( 0 \leq B_{m,20} \leq 500 \) - \( 0 \leq B_{m,26} \leq 300 \) - \( 0 \leq R_{m,15} \leq 350 \) - \( 0 \leq R_{m,18} \leq 150 \) - \( 0 \leq P_{m} \leq 1000 \) ### **b. Inventory Balance Constraints** For each mulch and each month (\( m \)), let’s define \( m-1 \) as the previous month (for April, initial inventory is 0): #### **Black Hardwood** - April: \( B_{Apr,20} + B_{Apr,26} = 400 + I_{B,Apr} \) - May: \( B_{May,20} + B_{May,26} + I_{B,Apr} = 700 + I_{B,May} \) - June: \( B_{Jun,20} + B_{Jun,26} + I_{B,May} = 375 + I_{B,Jun} \) #### **Red Cedar** - April: \( R_{Apr,15} + R_{Apr,18} = 300 + I_{R,Apr} \) - May: \( R_{May,15} + R_{May,18} + I_{R,Apr} = 400 + I_{R,May} \) - June: \( R_{Jun,15} + R_{Jun,18} + I_{R,May} = 325 + I_{R,Jun} \) #### **Pine Bark** - April: \( P_{Apr} = 250 + I_{P,Apr} \) - May: \( P_{May} + I_{P,Apr} = 300 + I_{P,May} \) - June: \( P_{Jun} + I_{P,May} = 175 + I_{P,Jun} \) #### **Ending Inventory** - After June, all inventory should be zero (no need to hold further): - \( I_{B,Jun} = 0 \) - \( I_{R,Jun} = 0 \) - \( I_{P,Jun} = 0 \) ### **c. Inventory Holding Limit** - For each month (April, May, June), total inventory carried over: - \( I_{B,m} + I_{R,m} + I_{P,m} \leq 400 \) ### **d. Non-negativity** - All variables \( \geq 0 \) --- ## 5. **Summary Table of Variables and Constraints** | Variable | Description | Bounds | |-----------------|----------------------------------------------------|------------------| | \( B_{m,20} \) | Black Hardwood at $20/ton in month \( m \) | \( 0 \leq B_{m,20} \leq 500 \) | | \( B_{m,26} \) | Black Hardwood at $26/ton in month \( m \) | \( 0 \leq B_{m,26} \leq 300 \) | | \( R_{m,15} \) | Red Cedar at $15/ton in month \( m \) | \( 0 \leq R_{m,15} \leq 350 \) | | \( R_{m,18} \) | Red Cedar at $18/ton in month \( m \) | \( 0 \leq R_{m,18} \leq 150 \) | | \( P_m \) | Pine Bark at $10/ton in month \( m \) | \( 0 \leq P_m \leq 1000 \) | | \( I_{B,m} \) | Inventory of Black Hardwood after month \( m \) | \( \geq 0 \) | | \( I_{R,m} \) | Inventory of Red Cedar after month \( m \) | \( \geq 0 \) | | \( I_{P,m} \) | Inventory of Pine Bark after month \( m \) | \( \geq 0 \) | --- ## 6. **Final Linear Program (LP) Formulation** ### **Objective:** \[ \text{Minimize } Z = \sum_{m} [20B_{m,20} + 26B_{m,26} + 15R_{m,15} + 18R_{m,18} + 10P_m] + \sum_{m} [0.6I_{B,m} + 0.45I_{R,m} + 0.3I_{P,m}] \] ### **Subject to:** **1. Demand and Inventory Balance (for each month and each mulch type, as above).** **2. Purchase Limits (each month, each price tier).** **3. Inventory Capacity:** \[ I_{B,m} + I_{R,m} + I_{P,m} \leq 400 \quad \forall m \] **4. Ending Inventory Zero after June:** \[ I_{B,Jun} = I_{R,Jun} = I_{P,Jun} = 0 \] **5. Non-negativity:** \[ \text{All variables } \geq 0 \] --- ## 7. **Chegg India Style Final Summary** **Summary:** To minimize the total cost of mulch procurement and storage for Miamitown Mulch, we defined decision variables for each mulch type, price tier, and month. The constraints include demand satisfaction, supplier capacity, storage limits, and inventory holding costs. The objective is to minimize the sum of purchasing and storage costs over the three-month peak season. **LP Formulation:** - **Objective:** Minimize total cost (purchase + holding) - **Decision variables:** Amount of each mulch type, each price, each month + inventory levels - **Constraints:** Meet demand, respect purchase and storage limits, inventory balance, non-negativity This LP can be solved using standard optimization software (like Excel Solver, LINGO, or Gurobi), providing Miamitown Mulch with the optimal, cost-minimizing monthly ordering schedule. --- **If you need the LP in an Excel-ready format or a worked-out solution with numbers, let me know!**

# Linear Programming Summary for Miamitown Mulch Miamitown Mulch needs to determine the optimal ordering schedule for three types of mulch to meet demand while minimizing costs, considering purchase limits and inventory constraints. The linear programming formulation includes decision variables for mulch quantities, an objective function to minimize costs, and constraints related to demand, supplier capacity, and inventory holding limits.

# Linear Programming Summary for Miamitown Mulch ## 1. Decision Variables Define decision variables for each mulch type, pricing tier, and month. These include quantities of Black Hardwood, Red Cedar, and Pine Bark ordered at different price points. ## 2. Parameters Parameters include estimated monthly demand for each mulch type and pricing tiers based on supplier limits. Additionally, holding costs and inventory limits are established. ## 3. Objective Function The objective function aims to minimize total costs, including purchasing and holding inventory. It aggregates costs from all mulch types and their corresponding inventory. ## 4. Constraints Constraints ensure that demand is met while adhering to supplier limits and inventory capacity. Additionally, inventory balance equations relate purchases and demand across months. ## 5. Summary Table of Variables and Constraints A summary table outlines each variable's description and bounds, clarifying the relationships and limits in the LP formulation. This aids in understanding the model structure and constraints. ## 6. Final Linear Program (LP) Formulation The final LP formulation includes the objective function and all relevant constraints. This comprehensive model can be solved using optimization software to derive the optimal ordering schedule.