Min max problem: length of pipe from 2 towns to the river

In summary, the conversation involves finding the minimum or maximum distance between two cities for a pipe to connect them, and how to minimize the sum of the lengths of the pipe. The conversation also discusses the relationship between the sum of lengths and the sum of squares of lengths, and provides a hint on how to solve the problem.
  • #1
Karol
1,380
22

Homework Statement


Capture2.JPG


Homework Equations


Minimum/Maximum occurs when the first derivative=0

The Attempt at a Solution


Capture.JPG

$$l_1^2+l_2^2=(a^2+x^2)+[b^2+(d-x)^2]=a^2+b^2+x^2+\left[ \sqrt{c^2-(b-a)^2}-x \right]^2$$
$$(l_1^2+l_2^2)'=2x+2\left[ \sqrt{c^2-(b-a)^2}-x \right](-1)$$
$$(l_1^2+l_2^2)'=0~~\rightarrow~~x=\frac{1}{2}\sqrt{c^2-(b-a)^2}=\frac{d}{2}$$
The minimum (or maximum?) distance is when the station is in the middle of the vertical distance between the cities
The total pipe's distance is:
$$Dist=\sqrt{l_1}+\sqrt{l_2}=\sqrt{a^2+x^2}+\sqrt{b^2+x^2}=\sqrt{a^2+\frac{d^2}{4}}+\sqrt{b^2+\frac{d^2}{4}}$$
It doesn't give ##~\sqrt{c^2-4ab}##
 

Attachments

  • Capture2.JPG
    Capture2.JPG
    22.4 KB · Views: 508
  • Capture.JPG
    Capture.JPG
    4.8 KB · Views: 516
Physics news on Phys.org
  • #2
You are supposed to minimise the sum of the lengths (i.e., ##L_1 + L_2##) not the sum of the squares of the lengths (##L_1^2 + L_2^2##).
 
  • #3
Hint: Imagine b is on the other side but d is still the same.
 
  • #4
Orodruin said:
You are supposed to minimise the sum of the lengths (i.e., ##L_1 + L_2##) not the sum of the squares of the lengths (##L_1^2 + L_2^2##).
But if the square of the lenghts is minimum then the length is also minimum
I will think about the hint that b is on the other side
 
  • #5
Karol said:
But if the square of the lenghts is minimum then the length is also minimum
No, this is not true. It is true for a single length, not for the sum of lengths.
 
  • #6
To expand a bit on that. Note that
$$
(L^2)' = 2LL'
$$
so, for a single length, ##L' = 0## if ##(L^2)' = 0##. However, you have the sum of two lengths and
$$
((L_1+L_2)^2)' = 2(L_1+L_2) (L_1+L_2)' = [L_1^2 + L_2^2 + 2L_1 L_2]' = (L_1^2 + L_2^2)' + 2(L_1 L_2' + L_1' L_2).
$$
Note that ##(L_1^2 + L_2^2)' = 0## no longer guarantees that ##(L_1 + L_2)' = 0## as there are additional terms on the right-hand side.
 
  • #7
verty said:
Hint: Imagine b is on the other side but d is still the same.
Capture.JPG

$$\frac{a}{x}=\frac{b}{\sqrt{c^2-(b-a)^2}-x}~\rightarrow~x=\frac{a\sqrt{c^2-(b-a)^2}}{a+b}$$
$$l_1+l_2=...=\sqrt{c^2+4ab}$$
 

Attachments

  • Capture.JPG
    Capture.JPG
    6.2 KB · Views: 473
  • #8
Karol said:
View attachment 229938
$$\frac{a}{x}=\frac{b}{\sqrt{c^2-(b-a)^2}-x}~\rightarrow~x=\frac{a\sqrt{c^2-(b-a)^2}}{a+b}$$
$$l_1+l_2=...=\sqrt{c^2+4ab}$$

You are given a,b,c. Your first task is to find d. Then find L1+L2 when it is the shortest configuration.
 
  • #9
verty said:
You are given a,b,c. Your first task is to find d. Then find L1+L2 when it is the shortest configuration.
I think the ##\ldots = \sqrt{c^2 + 4ab}## means he solved it ...
 

Related to Min max problem: length of pipe from 2 towns to the river

1. What is a min max problem?

A min max problem is a type of optimization problem where the objective is to minimize the maximum value of a set of variables while satisfying certain constraints.

2. How does the length of pipe from 2 towns to the river relate to a min max problem?

In this scenario, the length of pipe can be seen as the variable that needs to be minimized while ensuring that the pipe reaches both towns and the river. This fits the criteria of a min max problem.

3. What are the constraints in this min max problem?

The constraints in this problem would include the distance between the two towns, the location of the river, and any other physical limitations that may affect the placement of the pipe.

4. How is this min max problem solved?

The first step in solving a min max problem is to identify the objective function and constraints. Then, various mathematical techniques such as linear programming, gradient descent, or brute force algorithms can be used to find the optimal solution.

5. Can real-world problems be modeled as min max problems?

Yes, many real-world problems involving optimization and resource allocation can be modeled as min max problems. These include transportation planning, resource management, and facility location problems.

Similar threads

  • Calculus and Beyond Homework Help
Replies
8
Views
1K
  • Calculus and Beyond Homework Help
Replies
5
Views
894
  • Calculus and Beyond Homework Help
Replies
20
Views
482
Replies
9
Views
733
  • Calculus and Beyond Homework Help
Replies
15
Views
2K
  • Calculus and Beyond Homework Help
Replies
12
Views
3K
  • Introductory Physics Homework Help
Replies
7
Views
797
  • Calculus and Beyond Homework Help
2
Replies
36
Views
4K
  • Calculus and Beyond Homework Help
Replies
5
Views
1K
  • Calculus and Beyond Homework Help
2
Replies
47
Views
2K
Back
Top