linear programming problem optimization L ph we want to max
linear programming problem (optimization)
L = p/h
we want to maximize L by minimizing h. p will be a constant value.
h is the sum of hours worked by employees.
p is the number of products; which will be given, for example we can say it is 10,000.
workers must work between 3 and 6 hours.
We have 15 workers each with a productivity rank between 1 and 5
a.) what if h = 8,000 and L = 122. How many hours should be allocate to each worker in order to meet the goal of 122?
please provide the decision variables, objection function, and constraints in standard form.
| workers | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| productivity rank | 5 | 5 | 5 | 4 | 4 | 4 | 4 | 4 | 4 | 3 | 3 | 3 | 2 | 2 | 1 |
Solution
if h =8000
then its not possible to solve problem.
Because h<= 15*6 =90
