Recall that there are two different possible outputs when solving a minimization problem. first we can find the value f such that f(x) > f for all . second, we can find the value y such that f(1) > f(y) for all x #y. the first of these is called the minimum of f(i) and is denoted f = min,( the second is called the argmin of f(x) and is denoted y = argmin, (f). in other words, the argmin is the value of 1 at which the minimum occurs, f= f(y). the max and argmar are defined similarly and have to do with the maximum of f. which of the following is true? save your answer in a7.dat. if more than one is true, save a string containing both letters with the earliest letter in the alphabet coming first. for example, if the correct answers are g and j, use a7 = 'g''; save('a7.dat','a7','-ascii').
a min (f(i)) = -(x))
b argmin, = -argmax ((1))
c min (f(x)) = (x))
d argmin, (f(x)) = -argmax (-f()
e argmin, (f(2)) = argmax (
f min (f(2)) = -max ( loturen optimization problems