Professional Documents
Culture Documents
M. Kerem YKSEL
HW #1 (due 30.09.2015)
1. The Method of Least Squares If we are given n data points in the
plane: (x1 ; y1 );
; (xn ; yn ); and a straight line whose equation is given
by y = mx + b, then we can write the aggregate distance from the n points
to the line as
S = (mx1 + b
y1 )2 +
+ (mxn + b
yn )2 :
n
X
(mxi + b
yi )2 :
i=1
The line which best ts the n data points should be the line whose parameters m and b minimize the total discrepency S.
Given the above scheme, nd the equation of the line which best ts the
data points: f(0; 4); (3; 4); (6; 6); (5; 0)g :
1. Synder and Nicholson (hereafter, SN), 2.3: Suppose that f (x; y) = xy.
Find the maximum value for f if x and y are constrained to sum to 1.
Solve this problem in two ways: by substitution and by using the Lagrange
multiplier method.
2. SN, 2.4: The dual problem to the one described in Problem 2.3 is
minimize x + y
subject to xy = 0:25:
Solve this problem using the Lagrangian technique. Then compare the
value you get for the Lagrange multiplier with the value you got in Problem
2.3. Explain the relationship between the two solutions.
3. SN, 2.7: Consider the following constrained maximization problem:
maximize y = x1 + 5lnx2
subject to k x1 x2 = 0;
where k is a constant that can be assigned any specic value.
(a) Show that if k = 10, this problem can be solved as one involving only
equality constraints.
(b) Show that solving this problem for k = 4 requires that x1 =
1.
and
recall:
Denition 1 Lef f : S
Rn ! R be a function dened on a convex set S. The the lower
contour set LK of f is dened as
LK = fx 2 S : f (x)
Kg:
t)y)
2I