Would anyone be able to provide me with some general guidelines that could help me determine when to use a particular method to solve a Linear Programming problem? For example to know when I should use Primal Simplex/Dual Simplex/2-Phase/Big M/Cutting Plane? So far I have a list of guidelines which tell me how to solve a standard maximization problem, if the following conditions are satisfied:
• It’s to maximize an objective function
• All variables are non-negative (i.e. ≥0)
• Constraints should all be ≤ a non-negative value
Could anyone provide me with similar conditions for when you have a standard minimization problem, e.g. what way should the constraints and variables be to be able to find the optimal solution using the Primal Simplex method?