[商管] OR 一題線性規劃
Three students have decided to collaborate on two homework sets.
Assume that the homework sets are divisible so that it is possible
for any student to do any fraction of a homework set(and if the
student does x amount of a homework set it takes x times as long as
doing the entire assignment). The number of hours to complete each
homework set is given below. These three student are allocating their
time so that the homework set can be completed.
表格
Student/homework H1 H2
S1 10 7
S2 13 2
S3 3 8
(a) Formulate this problem as a linear program where the objective is to
minimize total time spent on the homework assignment.
(b) If we want to minimize the longest working time among all student,
formulate this problem as a lnear program?
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.115.61.137