Table 10-4 represents a solution to a goal programming problem. There are three goals (each represented by a constraint). Which of the goals is assigned the highest priority?

		goal 1
		goal 2
		goal 3
		goals 2 and 3
		All goals have the same priority.

Table 10-4 Minimize Z = P1d1+ + P1d1- + P1d2+ + P1d2- + P1 d3+ + P1d3- Subject to: 4 X1 + 3 X2 + 5 X3 + d1 - d1* = 240 24 X1 + 30 X2 + 32 X3 + d2 - d2+ = 1500 1 X1 + 2 X2 + X3 + d3--03+ = 50 Optimal Solution Data: Decision Solution Goald Variable Value d Priority Non- achievement 0 2.5 X X2 X3 12.5 0 37.5 1 2 3 0 0 2.5 0 0 P1 P1 P1