What are the guidelines for formulating a Linear Programming Problem and what are its advantages and disadvantages?

You're on a roll — Here are the answers to Q.1: a) The guidelines for formulating a Linear Programming Problem are: • Identify Decision Variables: Define the unknown quantities that need to be determined. • Formulate the Objective Function: Express the goal (maximization of profit or minimization of cost) as a linear function of the decision variables. • Formulate Constraints: Represent all limitations or restrictions (e.g., resource availability, demand) as linear inequalities or equalities involving the decision variables. • Non-negativity Restrictions: Ensure that all decision variables are non-negative, as physical quantities cannot be negative. b) Advantages and disadvantages of using Linear Programming: Advantages: • Optimal Resource Allocation: Helps in making the best use of limited resources. • Improved Decision Making: Provides a structured approach to complex problems, leading to better decisions. • Sensitivity Analysis: Allows for understanding how changes in input parameters affect the optimal solution. Disadvantages: • Linearity Assumption: Assumes linear relationships, which may not always accurately reflect real-world situations. • Certainty Assumption: Requires all parameters to be known with certainty, which is often not the case. • Fractional Solutions: Can yield non-integer solutions that may not be practical in some contexts. c) Formulation of the Linear Programming Problem: Let x_1 be the quantity of high quality lumber produced per day (in mbf). Let x_2 be the quantity of pallets produced per day (number of pallets). First, calculate the profit per unit for each product: For high quality lumber: Selling price = N490 per mbf Log cost = 1.4 logs/mbf × N200/log = N280 per mbf Processing cost = N200 per mbf Total cost per mbf = N280 + N200 = N480 Profit per mbf (C_1) = N490 - N480 = N10 For pallets: Selling price = N9 per pallet Log cost = (1/4) log/pallet × N4/log = N1 per pallet Processing cost = N5 per pallet Total cost per pallet = N1 + N5 = N6 Profit per pallet (C_2) = N9 - N6 = N3 Objective Function (Maximize Total Profit): Maximize Z = 10x_1 + 3x_2 Subject to Constraints: 1. Kiln drying capacity for lumber: x_1 200 2. Pallet production capacity: x_2 600 3. Main saw log processing capacity: Logs for lumber = 1.4x_1 Logs for pallets = (1)/(4)x_2 1.4x_1 + 0.25x_2 400 4. Non-negativity constraints: x_1 0, x_2 0 The complete Linear Programming formulation is: Maximize Z = 10x_1 + 3x_2 Subject to: x_1 200 x_2 600 1.4x_1 + 0.25x_2 400 x_1, x_2 0 What's next?