hdu 4091 整数规划

hdu 4091 整数规划

Problem Description

Some brave warriors come to a lost village. They are very lucky and find a lot of treasures and a big treasure chest, but with angry zombies.
The warriors are so brave that they decide to defeat the zombies and then bring all the treasures back. A brutal long-drawn-out battle lasts from morning to night and the warriors find the zombies are undead and invincible.
Of course, the treasures should not be left here. Unfortunately, the warriors cannot carry all the treasures by the treasure chest due to the limitation of the capacity of the chest. Indeed, there are only two types of treasures: emerald and sapphire. All of the emeralds are equal in size and value, and with infinite quantities. So are sapphires.
Being the priest of the warriors with the magic artifact: computer, and given the size of the chest, the value and size of each types of gem, you should compute the maximum value of treasures our warriors could bring back.

Input

There are multiple test cases. The number of test cases T (T <= 200) is given in the first line of the input file. For each test case, there is only one line containing five integers N, S1, V1, S2, V2, denoting the size of the treasure chest is N and the size and value of an emerald is S1 and V1, size and value of a sapphire is S2, V2. All integers are positive and fit in 32-bit signed integers.

Output

For each test case, output a single line containing the case number and the maximum total value of all items that the warriors can carry with the chest.

Sample Input

2
100 1 1 2 2
100 34 34 5 3

Sample Output

Case #1: 100
Case #2: 86

题目分析

$$\begin{gathered} \max Z=V_1{x}_1+V_2{x}_2 \\ \{\begin{array}{c}{S}_1{x}_1+S_2{x}_2\le N\\ x_1\ge 0,x_2\ge 0\\ x_1和x_2都是整数\end{array} \end{gathered}$$
$$\begin{gathered} \max Z=x_1+2x_2 \\ \{\begin{array}{c}{x}_1+2x_2\le 100\\ x_1\ge 0,x_2\ge 0\\ x_1和x_2都是整数\end{array} \end{gathered}$$
松弛问题：
$$\begin{gathered} \max Z=x_1+2x_2 \\ \{\begin{array}{c}{x}_1+2x_2\le 100\\ x_1\ge 0,x_2\ge 0\end{array} \end{gathered}$$

$x_B$	$x_1$	$x_2$	$x_3$	$b$
$x_3$	1	2	1	100
${\lambda }_j$	1	2	0

$x_3$出基，$x_2$进基，

$x_B$	$x_1$	$x_2$	$x_3$	$b$
$x_3$	0.5	1	0.5	50
${\lambda }_j$	-1	0	-1

则最优解为$(x_1,x_2)=(0,50)$，最优值为$2\times 50=100$
$$\begin{gathered} \max Z=34x_1+3x_2 \\ \{\begin{array}{c}34x_1+5x_2\le 100\\ x_1\ge 0,x_2\ge 0\\ x_1和x_2都是整数\end{array} \end{gathered}$$松弛问题：
$$\begin{gathered} \max Z=34x_1+3x_2 \\ \{\begin{array}{c}34x_1+5x_2\le 100\\ x_1\ge 0,x_2\ge 0\end{array} \end{gathered}$$

$x_B$	$x_1$	$x_2$	$x_3$	$b$
$x_3$	34	5	1	100
${\lambda }_j$	34	3	0

$x_3$出基，$x_1$进基，

$x_B$	$x_1$	$x_2$	$x_3$	$b$
$x_3$	1	$\frac{5}{34}$	$\frac{1}{34}$	$\frac{100}{34}$
${\lambda }_j$	0	-2	-1

则最优解为$(x_1,x_2)=(\frac{100}{34},0)$，不是整数解。
分支定界法：加入约束$x_1\le 2$，因为$34\times 3>100$不满足第一条约束，所以约束$x_1\ge 3$不考虑
$$\begin{gathered} \max Z=34x_1+3x_2 \\ \{\begin{array}{c}34x_1+5x_2\le 100\\ x_1\le 2\\ x_1\ge 0,x_2\ge 0\end{array} \end{gathered}$$

$x_B$	$x_1$	$x_2$	$x_3$	$x_4$	$b$
$x_3$	34	5	1	0	100
$x_4$	1	0	0	1	2
${\lambda }_j$	34	3	0	0

$x_4$出基，$x_1$进基

$x_B$	$x_1$	$x_2$	$x_3$	$x_4$	$b$
$x_3$	0	5	1	-34	32
$x_1$	1	0	0	1	2
${\lambda }_j$	0	3	0	-34

$x_3$出基，$x_2$进基

$x_B$	$x_1$	$x_2$	$x_3$	$x_4$	$b$
$x_2$	0	1	$\frac{1}{5}$	$\frac{-34}{5}$	$\frac{32}{5}$
$x_1$	1	0	0	1	2
${\lambda }_j$	0	0	$\frac{-3}{5}$	$\frac{-68}{34}$

则最优解为$(x_1,x_2)=(2,\frac{32}{5})$，不是整数解。
分支定界法：加入约束$x_2\le 6$，因为$34\times 2+5\times 7>100$不满足第一条约束，所以约束$x_2\ge 7$不考虑
$$\begin{gathered} \max Z=34x_1+3x_2 \\ \{\begin{array}{c}34x_1+5x_2\le 100\\ x_1\le 2\\ x_2\le 6\\ x_1\ge 0,x_2\ge 0\end{array} \end{gathered}$$

$x_B$	$x_1$	$x_2$	$x_3$	$x_4$	$x_5$	$b$
$x_3$	34	5	1	0	0	100
$x_4$	1	0	0	1	0	2
$x_5$	0	1	0	0	1	6
${\lambda }_j$	34	3	0	0	0

$x_4$出基，$x_1$进基

$x_B$	$x_1$	$x_2$	$x_3$	$x_4$	$x_5$	$b$
$x_3$	0	5	1	-34	0	32
$x_1$	1	0	0	1	0	2
$x_5$	0	1	0	1	1	6
${\lambda }_j$	0	3	0	-34	0

$x_5$出基，$x_2$进基

$x_B$	$x_1$	$x_2$	$x_3$	$x_4$	$x_5$	$b$
$x_3$	0	0	1	-39	0	2
$x_1$	1	0	0	1	0	2
$x_2$	0	1	0	1	1	6
${\lambda }_j$	0	0	0	-37	-3

最优解为$(x_1,x_2)=(2,6)$，最优值为$34\times 2+3\times 6=68+18=86$

单纯形法模板
上面是实现思路，代码有空来补。