Mathematics · Linear Programming Problems

Consider an optimization process where a Linear Programming Problem is being systematically converted into its Standard Form. The problem's initial constraints are presented in the following specific sequential order: 1. A resource availability constraint (≤)2. A minimum requirement constraint (≥)3. An exact requirement constraint (=) Arrange the following logical constraint conversions and mathematical steps in the correct chronological order to formulate the complete Standard Form for this entire system: A. Subtract a surplus variable to represent excess and simultaneously add an artificial variable for the second constraint B. Declare all original decision variables along with the newly introduced slack, surplus, and artificial variables as strictly non-negative C. Add a slack variable to represent unused resources for the first constraint D. Add only an artificial variable to assist in obtaining an initial basic feasible solution for the third constraint Choose the correct answer from the options given below: