0% found this document useful (0 votes)
20 views

Assignment Problem

This document presents a linear programming problem with 4 decision variables (A1, B1, C1, D1) and constraints on their maximum contributions. The objective is to maximize contributions subject to the given constraints. It provides the coefficients for the variables and constraints in two scenarios. The optimal solution for both scenarios is 0 for all variables, with an overall cost of 0.

Uploaded by

Kuro Neko
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
20 views

Assignment Problem

This document presents a linear programming problem with 4 decision variables (A1, B1, C1, D1) and constraints on their maximum contributions. The objective is to maximize contributions subject to the given constraints. It provides the coefficients for the variables and constraints in two scenarios. The optimal solution for both scenarios is 0 for all variables, with an overall cost of 0.

Uploaded by

Kuro Neko
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 6

DV A1 B1 C1 D1 A2 B2 C2 D2

Contribution 11 8 10 7 6 5 3 8
Solution 0 0 0 0 0 0 0 0
Cost 0

Subject to:
1 1 1 1
1 1 1 1

1 1
1 1
1 1
1 1
A3 B3 C3 D3 A4 B4 C4 D4
4 8 10 9 11 10 5 7
0 0 0 0 0 0 0 0

0
0
1 1 1 1 0
1 1 1 1 0
1 1 0
1 1 0
1 1 0
1 1 0
= 1
= 1
= 1
= 1
= 1
= 1
= 1
= 1
DV A1 B1 C1 D1 A2 B2 C2 D2 A3
100 125 115 100 120 135 115 120 155
Solution 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0

1 0 1 1
1 1 1 1
1
1 1 1
1 1
1 1
1 1

Cost = 0
B3 C3 D3
150 140 130
0 0 0
0 0 0

0 <= 160
0 <= 160
1 1 1 0 <= 140
0= 180
1 0= 75
1 0= 100
1 0= 85
A B C D
110,000 80,000 100,000 70,000
60,000 50,000 30,000 80,000
40,000 80,000 100,000 90,000
110,000 100,000 50,000 70,000

A B C D Total
0 0 0 0 0= 1
0 0 0 0 0= 1
0 0 0 0 0= 1
0 0 0 0 0= 1
Total 0 0 0 0
= = = =
1 1 1 1

Cost 0

You might also like