Undergrad Discrete Optimization Problem?

Click For Summary
The discussion revolves around maximizing the expression A = M! / (r_1! r_2!) under the constraints M = r_1 + r_2 and r_1 = M - 2r_2. It is established that the maximum occurs when r_2 equals half of r_1, specifically r_2 = 1/2 r_1. The participants explore how to derive this result analytically, suggesting the use of the ratio R(r) = A(r+1) / A(r) to identify when the ratio transitions from greater than one to less than one. Additionally, it is noted that the condition r_1 = M/2 is only valid for even M, while for odd M, the maximum occurs at the two nearest integers to M/2. The conversation emphasizes the analytical approach to discrete optimization problems.
iScience
Messages
466
Reaction score
5
Consider the expression:$$A = \frac{ M! }{ r_1!\ r_2! }$$

where M = r_1 + r_2,
where r_1 = (M - 2r_2)

$$A = \frac{ (r_1 + r_2)! }{ r_1!\ r_2! } \\ \ \\ \
= \frac{ ((M-2r_2) + r_2)! }{ (M-2r_2)!\ (r_2)! } \\ \ \\ \
= \frac{ (M-r_2)! }{ (M-2r_2)!\ r_2! }

$$

Then, for a given M, A maximum occurs at : r_2 = \frac{1}{2}r_1.
I know this because I can generate a table algorithmically. But I'd like to know how to arrive here analytically. Any pointers would be appreciated.
 
Mathematics news on Phys.org
Given that ##M = r_1 + r_2## and ##r_1 = (M - 2r_2)##, then if we substitute the second expression for ##M## in the first expression, we get ##M = M - r_2##, implying that ##r_2 = 0##. Then ##A ≡ 1##.
 
tnich said:
Given that ##M = r_1 + r_2## and ##r_1 = (M - 2r_2)##, then if we substitute the second expression for ##M## in the first expression, we get ##M = M - r_2##, implying that ##r_2 = 0##. Then ##A ≡ 1##.
Maybe you meant to say ##r_1 = M - r_2##
 
iScience said:
Consider the expression:$$A = \frac{ M! }{ r_1!\ r_2! }$$

where M = r_1 + r_2,
where r_1 = (M - 2r_2)

$$A = \frac{ (r_1 + r_2)! }{ r_1!\ r_2! } \\ \ \\ \
= \frac{ ((M-2r_2) + r_2)! }{ (M-2r_2)!\ (r_2)! } \\ \ \\ \
= \frac{ (M-r_2)! }{ (M-2r_2)!\ r_2! }

$$

Then, for a given M, A maximum occurs at : r_2 = \frac{1}{2}r_1.
I know this because I can generate a table algorithmically. But I'd like to know how to arrive here analytically. Any pointers would be appreciated.

For
$$ A(r) = \frac{M!}{r! (M-r)!},$$
look at the ratio
$$R(r) = \frac{A(r+1)}{A(r)}$$
and examine when ##R(r)## goes from ##R>1## to ##R < 1## as ##r## increases.

BTW: having ##r_1 = \frac{M}{2}## is possible only if ##M## is even; if ##M## is odd, the solution will be at the two neighboring integers to ##M/2.##
 
Here is a little puzzle from the book 100 Geometric Games by Pierre Berloquin. The side of a small square is one meter long and the side of a larger square one and a half meters long. One vertex of the large square is at the center of the small square. The side of the large square cuts two sides of the small square into one- third parts and two-thirds parts. What is the area where the squares overlap?

Similar threads

Replies
6
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
4K
  • · Replies 12 ·
Replies
12
Views
2K
Replies
5
Views
14K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 16 ·
Replies
16
Views
2K
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K