Site icon I Am Nasirene

Solving Linear Programming Problems

Lecture 1 continued…

Work Scheduling Problem

1st – The decision variables relate to staff working for the week. How many people are working per day. So let x be the number of people working per day, for a week so 7 days , i.e. greater than and equal to 1 till day 7. No fractions apply so it has to be an integer.

x1, x2, x3, x4, x5, x6, x7 1<=x<=7 x must be an integer – no fractions/

2nd – Objective function: Reduce the amount of staff that has to work, taking into account union rules.

Minimise x1+x2+x3+x4+x5+x6+x7

3rd – What restrictions are they applying? So detail the constraints.

They give you the number of people working daily, but the union says that the people cannot work straight through for 7 days, they have a 2 day break in between: so

The idea being to have 5 days that are consecutive with 2 days break in the centre. These are or can be greater than and equal to the number of people they have working per day.

Industrial Problem – similar to profit maximisation

The constraint is time. Ensure that the time units stays consistent throughout the calculation.

Advertising

Monthly to maximise total exposure for advertising.

What is known?

Portfolio Optimisation Problem

Increasing your return based on the

Eg. Total investment amount is R300 000. (x+y)less than or equal to R300000. Return to be greater than 0. Portfolio A earns 4% interest, risk 8. 0.04x Portfolio B earns 6% interest, risk 10. 0.06y. 0.04x + 0.06y greater than a return of 0. : 0.04x +0.06y>0…. 8x + 10y less than or equal to 9 for risk. Risk you want is a max of 9.

Ok done – going to do the next two examples offline and then drink up my hot water.

Exit mobile version