LINEAR PROGRAMMING WITH GOALSS

Abstract

The study aimed to give researchers an idea of goal_oriented programming, its practical importance, and its significance to other operations research. Goal programming is considered a subcategory of mathematical programming methods. This study addresses the concepts of goal programming, how to formulate single- goal and multi- goal problems, and how to prioritize goals, providing practical examples to clarify the concept for the reader. The study concluded that:

1. Goal-based programming helps the organization allocate resources in a way that achieves the best results for allocating limited resources across a number of competing activities, with the aim of increasing profits and reducing costs, thus enabling appropriate decision-making.

1. It is possible to use goal-based programming in the case of scarce resources. This scarcity represents the most important constraints that management is subject to in its pursuit of the goal, and these constraints are in the form of inequalities called structural constraints.

1. The existence of different alternatives to achieve the goal, where scientific methods exist for combining resources to reach the objective, and each alternative has an expected return.

1. Goal programming operates through one main objective and other sub-objectives or a set of different objectives. Therefore, the decision variables are not necessarily homogeneous, unlike linear programming, which operates through a single objective and requires homogeneous decision variables.