1. Formulate a preemptive goal programming model for this situation.

Decision variables: = amount that the company can bill on Partner for Job 1 = amount that the company can bill on Partner for Job 2 = amount that the company can bill on Partner for Job 3 = amount that the company can bill on Senior employee for Job 1 = amount that the company can bill on Senior employee for Job 2 = amount that the company can bill on Senior employee for Job 3 = amount that the company can bill on Junior employee for Job 2 = amount that the company can bill on Junior employee for Job 3 = the number of Partner should be hired = the number of Senior employee should be hired = the number of Junior employee should be hired

Goal constraints: Goal 1: Monthly billing should exceed RM68,000

will minimize the underachievement variable

Goal 2: At most 1 partner should be hired

will minimize the overachievement variable

Goal 3: At most 3 senior employees should be hired

will minimize the overachievement variable

Goal 4: At most 5 junior employees should be hired

will minimize the overachievement variable

Hard constraints:

Therefore, Minimize Subject to:

3. Solve Question 2 by using any LP package. (Example: LINDO, Spreadsheet) We will rewrite the problem using , , , , , , and variables because it is easier

to type the problem in LINGO with that notation without getting confused with the + and signs. Therefore the new problem is:

Min subject to

To solve with LINGO, we must minimize one variable at a time in the objective function. So, we will first minimize .

We will write in LINGO the following problem:

Min subject to

and press Solve.

If Goal 1 is achieved, then

. We will get the following printout:

We will note the objective function is 0, and the values of and . , to the constraints as follows and this time we are

To solve for the second goal, we add minimizing

, the second variable in the objective function.

By putting follows:

, we are ensured that the first goal is met. By solving we will get a printout as

If Goal 2 is achieved, then

We will note the objective function is 0, and the values of and . , to the constraints as follows and this time we are

To solve for the third goal, we add minimizing

, the third variable in the objective function.

By putting as follows:

, we are ensured that the second goal is met. By solving we will get a printout

If Goal 3 is achieved, then

We will note the objective function is 0, and the values of and To solve for the fourth goal, we add minimizing . , to the constraints as follows and this time we are

, the fourth variable in the objective function.

By putting follows:

, we are ensured that the third goal is met. By solving we will get a printout as

If Goal 4 is achieved, then

We will note the objective function is 0, and the values of and The optimal solution is: .

Therefore, The number of employees should be hired by Halim&Lee = 1 partner + 3 senior employees + 5 junior employees = 9 employees