Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

A professor will assign research papers to his students as a partial fulfilment of the requirements of a graduate course. There are six students enrolled in the course and each student will be assigned exactly two research papers. The professor has selected twelve research papers and also determined the expected workload (in hours) required to read,understand and present each of these papers.

An important concern of the professor in organizing the assignments is to be fair to all students by keeping the variance of student workloads as small as possible. Let $v_n$ be the workload associated with the $n$'th research paper,and suppose that a student's workload is the sum of the workloads associated with the research papers he/she is responsible for.

For instance, the total workload of a student responsible for the 1'st and 5'th paper is equal to $v_1+v_5$. Formulate an IP to determine how to assign papers to students to minimize the variance of students workloads. Note that, for a given set of values $\{x_1,x_2,..,x_n\}$ the variance is a non-linear expression defined as

$$\operatorname{Variance}=\sum_{i=1}^n (x_i - \overline x)$$

where $\overline x$ is the arithmetic mean.

share|cite|improve this question

Note that $\overline x=2\overline v$ does not dpend on the assignment chosen. Therefore we can simply minimize $\sum x_i^2$, which is just $\sum v_i^2$ plus the sum of all products $2v_iv_j$ where papers $i,j$ are assigned to the same student. Note that the difference between $v_1v_2+v_3v_4$ and $v_1v_4+v_3v_2$ is $(v_1-v_3)(v_4-v_2)$, hence in an optimal assignment $(v_1-v_3)(v_4-v_2)\ge 0$ whenever $(v_1,v_2)$, $(v_3,v_4)$ are assignments to two students. If wlog. $v_1\le v_2$ and $v_3\le v_4$, this implies $v_1< v_3\le v_4< v_2$ or $v_1=v_3$ or $v_2=v_4$. This suggests that the $i$th student should get the $i$th hardest and the $i$th simplest assignment (at least if all $v_i$ are distinct, but this strategy is also optimal in case ofsome equal $v_i$'s as can be seen by modifying these $v_i$ by some small $\epsilon$)

share|cite|improve this answer

$\min \sum_{i=1}^6 (x_i- \overline x)^2$

dec. variables $x$ $\to$ number of workload which assigned to each student

constraints $x_1 + x_2 +\cdots+x_6 = v_1 + v_2 +\cdots+v_{12}$

control my solution please

share|cite|improve this answer
I would define a characteristic function $\mathbf{1}_i$ for the i-th student that is 1 if the i-th student will be assigned on that paper, 0 otherwise. Then calculate $x_i=\sum_{i=1}^6 \mathbf{1}_i \cdot v_i$. This way the problem is to find the best characteristic function. – Vitalij Zadneprovskij Apr 30 '12 at 19:35
thanks a lot @Vitalij Zadneprovskij – SolNiger Apr 30 '12 at 20:32

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.