إيجاد القيود الفائضة في النماذج الرياضية الخطية بالاعتماد على خوارزمية Cosine Simplex

Abstract EN

When large and large-scale linear programming models were built, it consisted of redundant constraints because of one of the common of neglect that occurs to avoid the risk of deleting some of the relevant constraints during modeling the problem due to poor data source.

Redundant constraints are common in the formulation of large mathematical models.

In this paper, a new approach was established to determine the redundant constraint in the linear programming model after reviewing some general and fundamental concepts at the same time about the mathematical model as well as In addition, a general perspective on constraint programming was presented.

The proposed method of determining the redundant constraint was based on the Cosine Simplex algorithm.

The proposed method is based mainly on the integration of constraints between them after finding the strength of the relationship between each constraint in the model.

Finally, the paper provided some comprehensive illustrations examples that support the proposed method.