0% found this document useful (0 votes)
53 views6 pages

Solution A3

The document contains several linear programming problems with decision variables, objective functions to minimize or maximize, and constraints. It includes problems about allocating supplies from different locations to meet demand, assigning professors to courses, distributing products from warehouses to distributors, and scheduling full-time and part-time workers across time periods. The problems provide data on capacities, costs or values, and inequality constraints to be satisfied by the optimal solution.

Uploaded by

api-26315128
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
53 views6 pages

Solution A3

The document contains several linear programming problems with decision variables, objective functions to minimize or maximize, and constraints. It includes problems about allocating supplies from different locations to meet demand, assigning professors to courses, distributing products from warehouses to distributors, and scheduling full-time and part-time workers across time periods. The problems provide data on capacities, costs or values, and inequality constraints to be satisfied by the optimal solution.

Uploaded by

api-26315128
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
You are on page 1/ 6

Problem data

Boston Dallas LosAngeles St. Paul Capacity


Denver 7 11 8 13 100
Atlanta 20 17 12 10 100
Chicago 8 18 13 16 150
Demand 50 70 60 80

Decision variables
Boston Dallas LosAngeles St. Paul
Denver 0 0 0 10
Atlanta 50 0 50 0
Chicago 0 70 10 70

Objective function
max 4240

Constraints
Supplier LHS Type RHS
Denver 10 <= 100
Atlanta 100 <= 100
Chicago 150 <= 150
Demand Boston Dallas LosAngeles St. Paul
LHS 50 70 60 80
Type = = = =
RHS 50 70 60 80
Problem data
UG MBA MS PhD
Prof A 2.8 2.2 3.3 3
Prof B 3.2 3 3.6 3.6
Prof C 3.3 3.2 3.5 3.5
Prof D 3.2 2.8 2.5 -

Decision variables
UG MBA MS PhD
Prof A 0 0 1 0
Prof B 0 0 0 1
Prof C 0 1 0 0
Prof D 1 0 0 0

Objective function
max 13.3

Constraints
Courses UG MBA MS PhD
LHS 1 1 1 1
Type = = = =
RHS 1 1 1 1
Professor LHS Type RHS
Prof A 1= 1
Prof B 1= 1
Prof C 1= 1
Prof D 1= 1
D cannot be assigned to PhD course
0= 0
Poblem Data Warehouse
Plant Albany Portsmouth Capacity
Augusta 7 5 300
Tuppler Lake 3 4 100
Distributor
Warehouse Boston New York Philadelphia
Albany 8 5 7
Portsmouth 5 6 10
Demand 150 100 150

Decision variables
Albany Portsmouth
Augusta 50 250
Tuppler Lake 100 0
Boston New York Philadelphia
Albany 0 0 150
Portsmouth 150 100 0

Objective function
min 4300

Constraints
Plant LHS Type RHS
Augusta 300 <= 300
Tuppler Lake 100 <= 100
Warehouse Albany Portsmouth
LHS 0 0
Type = =
RHS 0 0
Distributor Boston New York Philadelphia
LHS 150 100 150
Type = = =
RHS 150 100 150
Decision variables
9:00am 10:00am 11:00am Noon 1:00pm 2:00pm 3:00pm
Full-timer 0 0 0
Part-timer 6 3 0 5 1 0 6

Objective function
min 672

Constraints
Time LHS Type RHS
9-10am 6 >= 6
10-11am 9 >= 4
11-Noon 9 >= 8
Noon-1pm 14 >= 10
1-2pm 9 >= 9
2-3pm 6 >= 6
3-4pm 12 >= 4
4-5pm 7 >= 7
5-6pm 6 >= 6
6-7pm 6 >= 6
Decision variables
9:00am 10:00am 11:00am Noon 1:00pm 2:00pm 3:00pm
Full-timer 0 0 0
Part-timer 6 3 0 5 1 0 6

Objective function
min 672

Constraints
Time LHS Type RHS
9-10am 6 >= 6
10-11am 9 >= 4
11-Noon 9 >= 8
Noon-1pm 14 >= 10
1-2pm 9 >= 9
2-3pm 6 >= 6
3-4pm 12 >= 4
4-5pm 7 >= 7
5-6pm 6 >= 6
6-7pm 6 >= 6
Decision variables
9:00am 10:00am 11:00am Noon 1:00pm 2:00pm 3:00pm
Full-timer 1 0 4
Part-timer 5 4 0 1 0 0 2

Objective function
min 909

Constraints
Time LHS Type RHS
9-10am 6 >= 6
10-11am 10 >= 4
11-Noon 14 >= 8
Noon-1pm 15 >= 10
1-2pm 9 >= 9
2-3pm 6 >= 6
3-4pm 4 >= 4
4-5pm 7 >= 7
5-6pm 6 >= 6
6-7pm 6 >= 6
Full-timer1 1 >= 1
Fulltimer 2 4 >= 1
Falltimer 3 5 >= 5

You might also like