Show that f ( <msubsup> x 1 &#x2217;<!-- ∗ --> </msubsup> , . .

Paul Duran

Paul Duran

Answered question

2022-05-09

Show that f ( x 1 , . . . x n ) = max { f ( x 1 , . . . , x n ) : ( x 1 , . . . , x n ) Ω } if and only if f ( x 1 , . . . x n ) = min { f ( x 1 , . . . , x n ) : ( x 1 , . . . , x n ) Ω }
I am not exactly sure how to approach this problem -- it is very general, so I can't assume anything about the shape of f. It seems obvious that flipping the max problem with a negative turns it into a min problem. Thoughts?

Answer & Explanation

allstylekvsvi

allstylekvsvi

Beginner2022-05-10Added 16 answers

Follow the chain of equivalences here:
f ( x 1 , . . . , x n ) = max { f ( x 1 , . . . , x n ) : ( x 1 , . . . , x n ) Ω } ( x 1 , . . . , x n ) Ω  and  ( x 1 , . . . , x n ) Ω , f ( x 1 , . . . x n ) f ( x 1 , . . . , x n ) ( x 1 , . . . , x n ) Ω  and  ( x 1 , . . . , x n ) Ω , f ( x 1 , . . . , x n ) f ( x 1 , . . . , x n ) f ( x 1 , . . . , x n ) = min { f ( x 1 , . . . , x n ) : ( x 1 , . . . , x n ) Ω } .

Do you have a similar question?

Recalculate according to your conditions!

New Questions in High school geometry

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?