Module 3
Part 2 : Solving Goal Programming Problem
Goal Programming
• So far, in all our problems encountered in linear programming, we considered a single linear
objective function and a set of well defined and rigid constraints. When even one of the constraints
is violated, we encountered an infeasible solution to the problem.
• In practice, we could have multiple objectives when addressing real-life situations. Some constraints
may be rigid while some may be flexible and would have targets or goals rather than rigid
constraints. We model such situations using a technique called goal programming (Charnes [Link].,
1960).
• Goal Programming is one of the ways to address multiple objectives. The easier way is to convert a
multiple objective problem into a single objective problem by considering weights for each of the
objectives.
• Another way is to rank the objectives and solve it as a sequence of single objective problems,
considering the ranked objectives one at a time. This method should ensure that the solution
obtained for a particular objectives does not worsen the solution (objective function) of an earlier
solved higher ranked objective. This is called lexicographic minimization (optimization) and when
applied to goal programming, it is called lexicographic goal programming.
Applications of Goal Programming
• Goal programming can be applied to almost unlimited managerial decision areas.
• Some of the striking areas are:
➢ In the area of marketing, it can be applied to media planning and product
mix decisions;
➢ In finance, it can be applied to portfolio selection, capital budgeting, and
financial planning;
➢ In production, it can be applied to aggregate production planning and
scheduling;
➢ In the academic field, it can be used in assigning faculty teaching schedules
and for university admissions planning;
➢ In HRD area, it can be used for manpower planning;
➢ In public systems area, it can be applied to transportation systems, and
medical care planning.
Steps in Goal Programming Model Formulation
EXAMPLE 1
SOLUTION 1
SOLUTION 1
SOLUTION 1
EXAMPLE 2
If in example 1, the company sets two equally ranked goals, one to reach a profit
goal of ₹ 1,500 and the other to meet a radio goal of 10, find the optimal
solution.
SOLUTION 2
SOLUTION 2
SOLUTION 2
EXAMPLE 3
Suppose for example 1, the company has established the following goals and has
assigned them priorities P1, P2, P3 (where P1 is most important) as follows:
SOLUTION 3
SOLUTION 3
SOLUTION 3
SOLUTION 3
SOLUTION 3
SOLUTION 3
SOLUTION 3
Graphical Method for Goal Programming
EXAMPLE 1
SOLUTION 1
SOLUTION 1
SOLUTION 1
SOLUTION 1
EXAMPLE 2
SOLUTION 2
SOLUTION 2
SOLUTION 2
References
1. OPERATIONS RESEARCH by PREM K. GUPTA & Dr. D.S. HIRA