Ma 195 J.

14 Take Home LT 2
Hyunsang Oh
Riemann Soliven
John Paolo Soto
April 29, 2016

Statement of the Problem

For this paper we are posed with the following problem:

The admissions office of a state college is processing freshman applications
for the upcoming academic year. The applications fall into three categories:
Metro Manila, provincial and international. The male-female ratios for Metro
Manila and provincial applicants are 1:1 and 3:2, respectively. For international
students, the corresponding ratio is 8:1. The school conducts an entrance exam,
which would be an important factor in accepting new students. The statistics
gathered by the university indicate that the average exam scores for Metro
Manila, provincial and international students are 27, 26 and 23, respectively.
The committee on admissions has established the following desirable goals for
the new freshman class according to their importance:
P1: The incoming class is at least 1200 freshmen.
P2: The average exam score for all incoming students is at least 25.
P3: International students constitute at least 10% of the incoming class.
P4: The male-female ratio is at least 3:4
P5: Provincial students constitute at least 20% of the incoming class.
1

Formulation of the Problem

In the formulation of the problem, we need to first identify the decision variables
of the problem then express the constraints in terms of the decision variables.
We are dealing with a goal programming problem so our objective function is
in terms of priority values and deviation variables. In the problem, we let our
decision variable xi be the number of freshman applicants, where i = 1, . . . , 6.
The pair x1 and x2 represent the number of male and female applicants in Metro
Manila, respectively. We designate the same for the male-female applicants
for the provincial and international: x3 and x4 represent the male and female
number of applicants for the provincial while x5 and x6 represent the male and
female number of international applicants, respectively.
For the constraints, we first deal with the goal constraints, these are the
constraints expressed in increasing priority. For P1 , it is stated that the incoming
class is at least 1200 freshmen. Since it is a goal constraint, we add deviational

variables d+
1 and d1 , which gives us

+
x1 + x2 + x3 + x4 + x5 + x6 + d
1 d1 = 1200

(1)

Because of the nature of the constraint, we aim to make d

1 as small as possible.
For P2 , it says that the average exam score for all incoming students is at

least 25. Introducing the deviational variables d+

1 and d1 which gives us the

constraint

+
27(x1 +x2 )+26(x3 +x4 )+23(x5 +x6 )+d
2 d2 = 25(x1 +x2 +x3 +x4 +x5 +x6 )

Equating the right hand side to zero, we have the following constraint:

+
2x1 + 2x2 + x3 + x4 2x5 2x6 + d
2 d2 = 0

(2)

since it is stated that the average scores for the Metro Manila, provincial and

international are 27, 26 and 23, respectively. By the constraint, we aim to make
d
2 as small as possible.
For P3 , it says that the main decision variable should be related to the
international students and it should be limited at least 10% of the incoming

students. Introducing the deviaional variables d+

3 and d3 , we have

+
x5 + x6 + d
3 d3 = 0.1(x1 + x2 + x3 + x4 + x5 + x6 ).

Doing the same for the constraint above, we get

+
0.1x1 0.1x2 0.1x3 0.1x4 + 0.9x5 + 0.9x6 + d
3 d3 = 0.

(3)

and the constraint tells us that d

3 should be made as small as possible.
For the fourth goal constraint, we first express it in linear fashion. Since the
constraint is of the form
x2 + x4 + x6
3

x1 + x3 + x5
4
it follows then that it is the same as

4(x2 + x4 + x6 ) 3(x1 + x3 + x5 )

introducing the deviational variables d+

4 and d4 (since it is a goal constraint),

this gives us

+
4(x2 + x4 + x6 ) + d
4 d4 = 3(x1 + x3 + x5 ).

This is the same as

+
3x1 + 4x2 3x3 + 4x4 3x5 + 4x6 + d
4 d4 = 0.

(4)

and how the constraint was stated tells us that d

4 is minimized. For the last
priority, the provincial students should constitute 20% of the incoming class, and
3


adding deviational variables d+
5 and d5 gives us the following goal constraint

+
x3 + x4 + d
5 d5 = 0.2(x1 + x2 + x3 + x4 + x5 + x6 )

which is equivalent to

+
0.2x1 0.2x2 + 0.8x3 + 0.8x4 0.2x5 0.2x6 + d
5 d5 = 0.

(5)

The nature of the constraint tells us that we should make d

5 as small as possible.
The hard constraints in the problem refer to the male-female ratio with respect
to the categories of the applicants. That is, we have the following constraints

x1 = x2
2x3 = 3x4
x5 = 8x6 .

The hard constraints tell us that we can reduce the number of decision variables
in the goal programming problem. Expressing the number of female in terms of
the male applicants, it follows that

x2 = x1
2
x3
3
1
x6 = x5 .
8
x4 =

(6)
(7)
(8)

Thus, we can express the constraints in terms of x1 x3 and x5 (we have expressed
the constraint in terms of the male population of applicants). It has enabled us
to reduce the number of variables in our tableau which will be constructed later
on. Using Equations (6) to (8) on Equations (1) to (5), we have the following

constraints:
5
9
+
2x1 + x3 + x5 + d
1 d1
3
8
5
9
+
4x1 + x3 x5 + d
2 d2
3
4
1
81
1
+
x1 x3 + x5 + d
3 d3
5
6
80
1
5
+
x1 x3 x5 + d
4 d4
3
2
4
9
2
+
x1 + x3 x5 + d
5 d5
5
3
40

= 1200
=0
=0
=0
=0

As we have formulated the constraints, together with the objective function, we

have the goal programming problem

Min z = P1 d
1 + P2 d2 + P3 d3 + P4 d4 + P5 d5

5
9
+
2x1 + x3 + x5 + d
1 d1
3
8
5
9
+
4x1 + x3 x5 + d
2 d2
3
4
1
1
81
+
x1 x3 + x5 + d
3 d3
5
6
80
1
5
+
x1 x3 x5 + d
4 d4
3
2
2
4
9
+
x1 + x3 x5 + d
5 d5
5
3
40

Subject to

= 1200
=0
=0
=0
=0

+
d
i , di , xi 0

and the formulation of the problem allows us to consider non-integral values.

Solution of the Goal Programming Problem

As we have constructed the initial tableau, we are now ready to solve it using
Microsoft Excel. The negative deviational variables form the basis of the initial
tableau. The initial tableau is shown in Figure 1.

Figure 1: The initial tableau for the goal programming problem.

Looking at the highest priority level P1 , we are to choose which has the
highest value in the row. By the tableau, it is observed that the x1 column has
the highest P1 value. Therefore, it is the variable that enters the basis. On
the other hand, we are only interested in the entries on the x1 column with
positive entries since choosing a basis with negative entries in the x1 column
makes the problem infeasible. Using the minimum ratio rule we see that the

d
2 and d4 rows have the same ratio. Thus, we use perturbation to determine

which variable leaves the basis, with  = 0.1. After doing so, we see that d
4 is
the one that leaves the basis. A new iteration then is performed, given below.

Figure 2: Tableau after x1 enters the basis and d

4 leaves the basis.
Again, we see that the column with the highest P1 value is x5 so it enters the

basis. By the minimum ratio rule, we again see a tie: the d

2 and d3 rows have

the same ratio. We then again use perturtabion where  = 0.1. After doing so,
we see that d
3 is the variable that leaves the basis. Performing elementary row
operations, a new iteration given below, is performed.

Figure 3: Tableau after x3 enters the basis and d

3 leaves the basis.
Looking at the tableau, the highest P1 value corresponds to d+
3 with value
11.95122, so it enters the basis. By the minimum ratio rule, d
2 leaves the basis

also because it has the smaller d+

3 entry compared to d5 . Performing elemen-

tary row operations, we have the next iteration given below.

Figure 4: Tableau after d+

3 enters the basis and d2 leaves the basis.

The column with the largest P1 value corresponds to d

4 so it enters the basis.
By the minimum ratio rule and since it only has the positive entry in the d
4
column, d
1 leaves the basis. Thus, we have the next iteration given below.

Figure 5: Tableau after d

4 enters the basis and d1 leaves the basis.

It is observed in the tableau that the largest P1 is 0, which corresponds to more

than one column thus we cannot determine the entering variable. Thus, we go
to the lower priority level P2 . But, it is again observed that the highest P2
7

value is 0 which corresponds again to more than one column in the tableau so
we again cannot determine the entering variable. Finally, going to the third
49
priority level P3 , we see that its highest value is
which corresponds to d+
2,
72
therefore it enters the basis. By the minimum ratio rule, d
4 leaves the basis, as
seen in Figure 5. Performing elementary row operations, the next iteration is
given below.

Figure 6: Tableau after d+

2 enters the basis and d4 leaves the basis.

In the tableau we see that the highest value in the P1 row is zero, which corresponds to more than one column in the tableau. Continuing until the fourth
priority level P4 , we see the similar situation. Thus we go the the fifth priority
8
level P5 . In that level we see that its highest value is , which corresponds to
3
x3 , so it enters the basis. By the minimum ratio rule, d
5 leaves the basis, as
seen in Figure 6. The next iteration is given below.

Figure 7: Tableau after x3 enters the basis and d

5 leaves the basis.
In the tableau, it is observed that the from the first up to the fifth priority level,
there is no entry with has the greatest value. In fact, some of the columns in
the tableau show entries which are all zero from the first to the fifth priority
level. That being said, Figure 7 shows us the optimal tableau for the goal pro-

gramming problem since we have minimized the values of the priorities. We

74736 +
1896
6912
thus have attained the optimal solution d+
, d3 =
, x5 =
,
2 =
49
49
49
19632
and x3 = 144 and the other variables are all zero with optimal
x1 =
49
value z = 0.

Conclusion and Analysis

From the given optimal tableau,we can come out with the number of each students from different regions. Since the ratio of male-female applicants in Metro
19632
Manila is 1:1, it then follows that x2 = x1 =
. x2 and x1 again refer to
49
the number of female and male applicants from Metro Manila.

For the provincial applicants, as the male-female of ratio of its applicants is

2
3:2, it follows that the number of female applicants x4 , is (144) = 96.
3
For the international students, the male-female ratio of applicants is 8:1.


1 6912
864
Thus, it follows that the number of female applicants x6 is
.
=
8
49
49
We now look at the goal constraints. We see that the total number of
applicants which is obtained by adding x1 to x6 is 1200, implying that d+
1 and
d
1 are both zero. For the second goal constraint, the average score of the
applicants (rounded off to four decimal places) is given by

27

19632 19632
+
49
49


+ 26(144 + 96) + 23
1200

6912 864
+
49
7


= 26.27102

which satisfies P2 and from the optimal tableau, d

2 = 0. We have a surplus
of average, and d+
2 is obtained by multiplying the surplus of average to the
number of students. In the third priority, substituting the values obtained for
the number of international students, we have the value (rounded off to four

decimal places)
6912 864
+
49
49 = 0.1322
1200
which satisfies P3 and it follows that d
3 = 0. There is a surplus of the ratio,
and d+
3 is equivalent to multiplying the surplus value by the total number of
applicants. At the fourth priority, the male-female ratio of applicants is given
by
19632
+ 96 +
49
19632
+ 144 +
49

864
49 = 0.75
6912
49

which strictly satisfies P4 . That is, there is no surplus nor deficiency in the

constraint and as seen from the optimal tableau, d+

4 = d4 = 0. For the fifth

priority, the ratio of the provincial applicants to the total number is given by
144 + 96
= 0.2
1200

which strictly satisfies P5 . It follows then that d+

5 = d5 = 0, which satisfies our

optimal tableau.

10