Scribd
Upload
115 views2 pages

Caed101 de Castro Acn1 Assignment Problem

1. The document presents a linear programming model to minimize the total profit for assigning three project leaders (Jackson, Ellis, Smith) to three clients (1, 2, 3). 2. It gives the profit per unit for each project leader-client combination and defines the objective function and constraints. 3. The Excel solver solution assigns Ellis to Client 1, Jackson to Client 2, and Smith to Client 3, achieving a minimum total profit of 64 days.

Uploaded by

Ira Grace De Castro
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
115 views2 pages

Caed101 de Castro Acn1 Assignment Problem

1. The document presents a linear programming model to minimize the total profit for assigning three project leaders (Jackson, Ellis, Smith) to three clients (1, 2, 3). 2. It gives the profit per unit for each project leader-client combination and defines the objective function and constraints. 3. The Excel solver solution assigns Ellis to Client 1, Jackson to Client 2, and Smith to Client 3, achieving a minimum total profit of 64 days.

Uploaded by

Ira Grace De Castro
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Ira Grace B. De Castro.

ACN1 | CAED101

Table 1. Profit per Unit for Each Plant-Customer Alternative


Client
Project Leader 1 2 3
Jackson 10 16 32
Ellis 14 22 40
Smith 22 24 34

Fig.1. Network Presentation


Objective Function
Min 10x11 + 16x12 + 32x13 + 14x21 + 22x22 + 40x23 + 22x31 + 24x32 + 34x33

s.t.
x11 + x12 + x13 ≤ 1 Jackson’s Assignment
x21 + x22 + x23 ≤ 1 Ellis’ Assignment
x31 + x32 + x33 ≤ 1 Smith’s Assignment
x11 + x21 + x31 = 1 Client 1
x12 + x22 + x32 = 1 Client 2
x13 + x23 + x33 = 1 Client 3
x11 + x12 + x13 + x21 + x22 + x23 + x31 + x32 + x33 ≥ 0

Fig.2. Linear Programming Model

EXCEL SOLVER – LINEAR PROGRAMMING

Variables Objective
Jackson Minimize 64
x 11 0
x 12 1 Constraints
x 13 0 No. Equality
1 1 ≤ 1
2 1 ≤ 1
Ellis 3 1 ≤ 1
x 21 1 4 1 = 1
x 22 0 5 1 = 1
x 23 0 6 1 = 1

Project Leader Assigned Client Days


Smith
Jackson 2 16
x 31 0 Elli 1 14
x 32 0 Smith 3 34
x 33 1 Total 64

You might also like