Mathematical programming models may contain a great deal of variations in their formulations. The same problem can be modeled as different formulations, or different problems can be modeled as the same formulations. In order to handle these variant formulations efficiently and intelligently, a model management system should be able to eliminate or recognize the variations in model formulations. We analyze possible variations involved in model formulations and categorize them into three types-syntactic, semantic and structural.