EE364a Homework 1 solutions
|
|
- Barry Rose
- 7 years ago
- Views:
Transcription
1 EE364a, Winter Prof. S. Boyd EE364a Homework 1 solutions 2.1 Let C R n be a convex set, with x 1,...,x k C, and let θ 1,...,θ k R satisfy θ i 0, θ 1 + +θ k = 1. Show that θ 1 x 1 + +θ k x k C. (The definition of convexity is that this holds for k = 2; you must show it for arbitrary k.) Hint. Use induction on k. Solution. This is readily shown by induction from the definition of convex set. We illustrate the idea for k = 3, leaving the general case to the reader. Suppose that x 1,x 2,x 3 C, and θ 1 + θ 2 + θ 3 = 1 with θ 1,θ 2,θ 3 0. We will show that y = θ 1 x 1 + θ 2 x 2 + θ 3 x 3 C. At least one of the θ i is not equal to one; without loss of generality we can assume that θ 1 1. Then we can write y = θ 1 x 1 + (1 θ 1 )(µ 2 x 2 + µ 3 x 3 ) where µ 2 = θ 2 /(1 θ 1 ) and µ 2 = θ 3 /(1 θ 1 ). Note that µ 2,µ 3 0 and µ 1 + µ 2 = θ 2 + θ 3 1 θ 1 = 1 θ 1 1 θ 1 = 1. Since C is convex and x 2,x 3 C, we conclude that µ 2 x 2 + µ 3 x 3 C. Since this point and x 1 are in C, y C. 2.2 Show that a set is convex if and only if its intersection with any line is convex. Show that a set is affine if and only if its intersection with any line is affine. Solution. We prove the first part. The intersection of two convex sets is convex. Therefore if S is a convex set, the intersection of S with a line is convex. Conversely, suppose the intersection of S with any line is convex. Take any two distinct points x 1 and x 2 S. The intersection of S with the line through x 1 and x 2 is convex. Therefore convex combinations of x 1 and x 2 belong to the intersection, hence also to S. 2.5 What is the distance between two parallel hyperplanes {x R n a T x = b 1 } and {x R n a T x = b 2 }? Solution. The distance between the two hyperplanes is b 1 b 2 / a 2. To see this, consider the construction in the figure below. 1
2 x 2 = (b 2 / a 2 )a a x 1 = (b 1 / a 2 )a a T x = b 2 a T x = b 1 The distance between the two hyperplanes is also the distance between the two points x 1 and x 2 where the hyperplane intersects the line through the origin and parallel to the normal vector a. These points are given by x 1 = (b 1 / a 2 2)a, x 2 = (b 2 / a 2 2)a, and the distance is x 1 x 2 2 = b 1 b 2 / a Voronoi description of halfspace. Let a and b be distinct points in R n. Show that the set of all points that are closer (in Euclidean norm) to a than b, i.e., {x x a 2 x b 2 }, is a halfspace. Describe it explicitly as an inequality of the form c T x d. Draw a picture. Solution. Since a norm is always nonnegative, we have x a 2 x b 2 if and only if x a 2 2 x b 2 2, so x a 2 2 x b 2 2 (x a) T (x a) (x b) T (x b) x T x 2a T x + a T a x T x 2b T x + b T b 2(b a) T x b T b a T a. Therefore, the set is indeed a halfspace. We can take c = 2(b a) and d = b T b a T a. This makes good geometric sense: the points that are equidistant to a and b are given by a hyperplane whose normal is in the direction b a. 2.8 Which of the following sets S are polyhedra? If possible, express S in the form S = {x Ax b, Fx = g}. (a) S = {y 1 a 1 + y 2 a 2 1 y 1 1, 1 y 2 1}, where a 1,a 2 R n. (b) S = {x R n x 0, 1 T x = 1, n x i a i = b 1, n x i a 2 i = b 2 }, where a 1,...,a n R and b 1,b 2 R. 2
3 (c) S = {x R n x 0, x T y 1 for all y with y 2 = 1}. (d) S = {x R n x 0, x T y 1 for all y with n y i = 1}. Solution. (a) S is a polyhedron. It is the parallelogram with corners a 1 + a 2, a 1 a 2, a 1 + a 2, a 1 a 2, as shown below for an example in R 2. c2 a 2 a 1 c 1 For simplicity we assume that a 1 and a 2 are independent. We can express S as the intersection of three sets: S 1 : the plane defined by a 1 and a 2 S 2 = {z + y 1 a 1 + y 2 a 2 a T 1 z = a T 2 z = 0, 1 y 1 1}. This is a slab parallel to a 2 and orthogonal to S 1 S 3 = {z + y 1 a 1 + y 2 a 2 a T 1 z = a T 2 z = 0, 1 y 2 1}. This is a slab parallel to a 1 and orthogonal to S 1 Each of these sets can be described with linear inequalities. S 1 can be described as v T k x = 0, k = 1,...,n 2 where v k are n 2 independent vectors that are orthogonal to a 1 and a 2 (which form a basis for the nullspace of the matrix [a 1 a 2 ] T ). Let c 1 be a vector in the plane defined by a 1 and a 2, and orthogonal to a 2. For example, we can take Then x S 2 if and only if c 1 = a 1 at 1 a 2 a a c T 1 a 1 c T 1 x c T 1 a 1. 3
4 Similarly, let c 2 be a vector in the plane defined by a 1 and a 2, and orthogonal to a 1, e.g., Then x S 3 if and only if c 2 = a 2 at 2 a 1 a a c T 2 a 2 c T 2 x c T 2 a 2. Putting it all together, we can describe S as the solution set of 2n linear inequalities vk T x 0, k = 1,...,n 2 vk T x 0, k = 1,...,n 2 c T 1 x c T 1 a 1 c T 1 x c T 1 a 1 c T 2 x c T 2 a 2 c T 2 x c T 2 a 2. (b) S is a polyhedron, defined by linear inequalities x k 0 and three equality constraints. (c) S is not a polyhedron. It is the intersection of the unit ball {x x 2 1} and the nonnegative orthant R n +. This follows from the following fact, which follows from the Cauchy-Schwarz inequality: x T y 1 for all y with y 2 = 1 x 2 1. Although in this example we define S as an intersection of halfspaces, it is not a polyhedron, because the definition requires infinitely many halfspaces. (d) S is a polyhedron. S is the intersection of the set {x x k 1, k = 1,...,n} and the nonnegative orthant R n +. This follows from the following fact: x T y 1 for all y with y i = 1 x i 1, i = 1,...,n. We can prove this as follows. First suppose that x i 1 for all i. Then x T y = i x i y i i x i y i i y i = 1 if i y i = 1. Conversely, suppose that x is a nonzero vector that satisfies x T y 1 for all y with i y i = 1. In particular we can make the following choice for y: let k be an index for which x k = max i x i, and take y k = 1 if x k > 0, y k = 1 if x k < 0, and y i = 0 for i k. With this choice of y we have x T y = i x i y i = y k x k = x k = max i x i. 4
5 Therefore we must have max i x i 1. All this implies that we can describe S by a finite number of linear inequalities: it is the intersection of the nonnegative orthant with the set {x 1 x 1}, i.e., the solution of 2n linear inequalities x i 0, i = 1,...,n x i 1, i = 1,...,n. Note that as in part (c) the set S was given as an intersection of an infinite number of halfspaces. The difference is that here most of the linear inequalities are redundant, and only a finite number are needed to characterize S. None of these sets are affine sets or subspaces, except in some trivial cases. For example, the set defined in part (a) is a subspace (hence an affine set), if a 1 = a 2 = 0; the set defined in part (b) is an affine set if n = 1 and S = {1}; etc Hyperbolic sets. Show that the hyperbolic set {x R 2 + x 1 x 2 1} is convex. As a generalization, show that {x R n + n x i 1} is convex. Hint. If a,b 0 and 0 θ 1, then a θ b 1 θ θa + (1 θ)b; see Solution. (a) We prove the first part without using the hint. Consider a convex combination z of two points (x 1,x 2 ) and (y 1,y 2 ) in the set. If x y, then z = θx + (1 θ)y y and obviously z 1 z 2 y 1 y 2 1. Similar proof if y x. Suppose y x and x y, i.e., (y 1 x 1 )(y 2 x 2 ) < 0. Then (θx 1 + (1 θ)y 1 )(θx 2 + (1 θ)y 2 ) = θ 2 x 1 x 2 + (1 θ) 2 y 1 y 2 + θ(1 θ)x 1 y 2 + θ(1 θ)x 2 y 1 = θx 1 x 2 + (1 θ)y 1 y 2 θ(1 θ)(y 1 x 1 )(y 2 x 2 ) 1. (b) Assume that i x i 1 and i y i 1. Using the inequality in the hint, we have (θx i + (1 θ)y i ) x θ iyi 1 θ = ( i i 2.12 Which of the following sets are convex? x i ) θ ( i (a) A slab, i.e., a set of the form {x R n α a T x β}. y i ) 1 θ 1. (b) A rectangle, i.e., a set of the form {x R n α i x i β i, i = 1,...,n}. A rectangle is sometimes called a hyperrectangle when n > 2. (c) A wedge, i.e., {x R n a T 1 x b 1, a T 2 x b 2 }. 5
6 (d) The set of points closer to a given point than a given set, i.e., where S R n. {x x x 0 2 x y 2 for all y S} (e) The set of points closer to one set than another, i.e., where S,T R n, and {x dist(x,s) dist(x,t)}, dist(x,s) = inf{ x z 2 z S}. (f) The set {x x + S 2 S 1 }, where S 1,S 2 R n with S 1 convex. (g) The set of points whose distance to a does not exceed a fixed fraction θ of the distance to b, i.e., the set {x x a 2 θ x b 2 }. You can assume a b and 0 θ 1. Solution. (a) A slab is an intersection of two halfspaces, hence it is a convex set and a polyhedron. (b) As in part (a), a rectangle is a convex set and a polyhedron because it is a finite intersection of halfspaces. (c) A wedge is an intersection of two halfspaces, so it is convex and a polyhedron. It is a cone if b 1 = 0 and b 2 = 0. (d) This set is convex because it can be expressed as {x x x 0 2 x y 2 }, y S i.e., an intersection of halfspaces. (Recall from exercise 2.7 that, for fixed y, the set {x x x 0 2 x y 2 } is a halfspace.) (e) In general this set is not convex, as the following example in R shows. With S = { 1, 1} and T = {0}, we have {x dist(x,s) dist(x,t)} = {x R x 1/2 or x 1/2} which clearly is not convex. 6
7 (f) This set is convex. x + S 2 S 1 if x + y S 1 for all y S 2. Therefore {x x + S 2 S 1 } = the intersection of convex sets S 1 y. (g) The set is convex, in fact a ball. {x x a 2 θ x b 2 } = {x x a 2 2 θ 2 x b 2 2} y S 2 {x x + y S 1 } = y S 2 (S 1 y), = {x (1 θ 2 )x T x 2(a θ 2 b) T x + (a T a θ 2 b T b) 0} If θ = 1, this is a halfspace. If θ < 1, it is a ball with center x 0 and radius R given by {x (x x 0 ) T (x x 0 ) R 2 }, x 0 = a ( θ2 b θ 2 1 θ, R = b 2 2 a 2 ) 1/2 2 + x 2 1 θ Some sets of probability distributions. Let x be a real-valued random variable with prob(x = a i ) = p i, i = 1,...,n, where a 1 < a 2 < < a n. Of course p R n lies in the standard probability simplex P = {p 1 T p = 1, p 0}. Which of the following conditions are convex in p? (That is, for which of the following conditions is the set of p P that satisfy the condition convex?) (a) α E f(x) β, where E f(x) is the expected value of f(x), i.e., E f(x) = n p i f(a i ). (The function f : R R is given.) (b) prob(x > α) β. (c) E x 3 αe x. (d) E x 2 α. (e) E x 2 α. (f) var(x) α, where var(x) = E(x E x) 2 is the variance of x. (g) var(x) α. (h) quartile(x) α, where quartile(x) = inf{β prob(x β) 0.25}. (i) quartile(x) α. Solution. We first note that the constraints p i 0, i = 1,...,n, define halfspaces, and n p i = 1 defines a hyperplane, so P is a polyhedron. The first five constraints are, in fact, linear inequalities in the probabilities p i. 7
8 (a) E f(x) = n p i f(a i ), so the constraint is equivalent to two linear inequalities α p i f(a i ) β. (b) prob(x α) = i: a i α p i, so the constraint is equivalent to a linear inequality i: a i α p i β. (c) The constraint is equivalent to a linear inequality p i ( a 3 i α a i ) 0. (d) The constraint is equivalent to a linear inequality p i a 2 i α. (e) The constraint is equivalent to a linear inequality p i a 2 i α. The first five constraints therefore define convex sets. (f) The constraint var(x) = E x 2 (E x) 2 = p i a 2 i ( p i a i ) 2 α is not convex in general. As a counterexample, we can take n = 2, a 1 = 0, a 2 = 1, and α = 1/5. p = (1, 0) and p = (0, 1) are two points that satisfy var(x) α, but the convex combination p = (1/2, 1/2) does not. (g) This constraint is equivalent to a 2 ip i + ( a i p i ) 2 = b T p + p T Ap α where b i = a 2 i and A = aa T. This defines a convex set, since the matrix aa T is positive semidefinite. Let us denote quartile(x) = f(p) to emphasize it is a function of p. The figure illustrates the definition. It shows the cumulative distribution for a distribution p with f(p) = a 2. 8
9 p 1 + p p n 1 prob(x β) 1 p 1 + p p 1 a 1 a 2 a n β (h) The constraint f(p) α is equivalent to prob(x β) < 0.25 for all β < α. If α a 1, this is always true. Otherwise, define k = max{i a i < α}. This is a fixed integer, independent of p. The constraint f(p) α holds if and only if k prob(x a k ) = p i < This is a strict linear inequality in p, which defines an open halfspace. (i) The constraint f(p) α is equivalent to prob(x β) 0.25 for all β α. Here, let us define k = max{i a i α}. Again, this is a fixed integer, independent of p. The constraint f(p) α holds if and only if k prob(x a k ) = p i If α a 1, then no p satisfies f(p) α, which means that the set is empty. 9
2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationLectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain
Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n real-valued matrix A is said to be an orthogonal
More informationWhat is Linear Programming?
Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More informationNotes on Symmetric Matrices
CPSC 536N: Randomized Algorithms 2011-12 Term 2 Notes on Symmetric Matrices Prof. Nick Harvey University of British Columbia 1 Symmetric Matrices We review some basic results concerning symmetric matrices.
More information(Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties
Lecture 1 Convex Sets (Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties 1.1.1 A convex set In the school geometry
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the
More informationConvex analysis and profit/cost/support functions
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
More informationSection 1.1. Introduction to R n
The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to
More informationThe Graphical Method: An Example
The Graphical Method: An Example Consider the following linear program: Maximize 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2 0, where, for ease of reference,
More informationLargest Fixed-Aspect, Axis-Aligned Rectangle
Largest Fixed-Aspect, Axis-Aligned Rectangle David Eberly Geometric Tools, LLC http://www.geometrictools.com/ Copyright c 1998-2016. All Rights Reserved. Created: February 21, 2004 Last Modified: February
More informationSection 1.4. Lines, Planes, and Hyperplanes. The Calculus of Functions of Several Variables
The Calculus of Functions of Several Variables Section 1.4 Lines, Planes, Hyperplanes In this section we will add to our basic geometric understing of R n by studying lines planes. If we do this carefully,
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More informationOn Minimal Valid Inequalities for Mixed Integer Conic Programs
On Minimal Valid Inequalities for Mixed Integer Conic Programs Fatma Kılınç Karzan June 27, 2013 Abstract We study mixed integer conic sets involving a general regular (closed, convex, full dimensional,
More informationSolutions to Math 51 First Exam January 29, 2015
Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number
More informationMathematical Methods of Engineering Analysis
Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More informationCross product and determinants (Sect. 12.4) Two main ways to introduce the cross product
Cross product and determinants (Sect. 12.4) Two main ways to introduce the cross product Geometrical definition Properties Expression in components. Definition in components Properties Geometrical expression.
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More information1.3. DOT PRODUCT 19. 6. If θ is the angle (between 0 and π) between two non-zero vectors u and v,
1.3. DOT PRODUCT 19 1.3 Dot Product 1.3.1 Definitions and Properties The dot product is the first way to multiply two vectors. The definition we will give below may appear arbitrary. But it is not. It
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationEigenvalues, Eigenvectors, Matrix Factoring, and Principal Components
Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components The eigenvalues and eigenvectors of a square matrix play a key role in some important operations in statistics. In particular, they
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationLinear Algebra I. Ronald van Luijk, 2012
Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.
More information18.06 Problem Set 4 Solution Due Wednesday, 11 March 2009 at 4 pm in 2-106. Total: 175 points.
806 Problem Set 4 Solution Due Wednesday, March 2009 at 4 pm in 2-06 Total: 75 points Problem : A is an m n matrix of rank r Suppose there are right-hand-sides b for which A x = b has no solution (a) What
More informationSOLUTIONS TO ASSIGNMENT 1 MATH 576
SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts
More informationLecture 2: Homogeneous Coordinates, Lines and Conics
Lecture 2: Homogeneous Coordinates, Lines and Conics 1 Homogeneous Coordinates In Lecture 1 we derived the camera equations λx = P X, (1) where x = (x 1, x 2, 1), X = (X 1, X 2, X 3, 1) and P is a 3 4
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More information3. Convex functions. basic properties and examples. operations that preserve convexity. the conjugate function. quasiconvex functions
3. Convex functions Convex Optimization Boyd & Vandenberghe basic properties and examples operations that preserve convexity the conjugate function quasiconvex functions log-concave and log-convex functions
More informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationChapter 6. Cuboids. and. vol(conv(p ))
Chapter 6 Cuboids We have already seen that we can efficiently find the bounding box Q(P ) and an arbitrarily good approximation to the smallest enclosing ball B(P ) of a set P R d. Unfortunately, both
More informationSelected practice exam solutions (part 5, item 2) (MAT 360)
Selected practice exam solutions (part 5, item ) (MAT 360) Harder 8,91,9,94(smaller should be replaced by greater )95,103,109,140,160,(178,179,180,181 this is really one problem),188,193,194,195 8. On
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
More information1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 005-06-15 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
More informationLinear Programming I
Linear Programming I November 30, 2003 1 Introduction In the VCR/guns/nuclear bombs/napkins/star wars/professors/butter/mice problem, the benevolent dictator, Bigus Piguinus, of south Antarctica penguins
More information26 Linear Programming
The greatest flood has the soonest ebb; the sorest tempest the most sudden calm; the hottest love the coldest end; and from the deepest desire oftentimes ensues the deadliest hate. Th extremes of glory
More informationChapter 20. Vector Spaces and Bases
Chapter 20. Vector Spaces and Bases In this course, we have proceeded step-by-step through low-dimensional Linear Algebra. We have looked at lines, planes, hyperplanes, and have seen that there is no limit
More informationISOMETRIES OF R n KEITH CONRAD
ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x
More informationTHE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING
THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING 1. Introduction The Black-Scholes theory, which is the main subject of this course and its sequel, is based on the Efficient Market Hypothesis, that arbitrages
More informationInner product. Definition of inner product
Math 20F Linear Algebra Lecture 25 1 Inner product Review: Definition of inner product. Slide 1 Norm and distance. Orthogonal vectors. Orthogonal complement. Orthogonal basis. Definition of inner product
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationDot product and vector projections (Sect. 12.3) There are two main ways to introduce the dot product
Dot product and vector projections (Sect. 12.3) Two definitions for the dot product. Geometric definition of dot product. Orthogonal vectors. Dot product and orthogonal projections. Properties of the dot
More informationα = u v. In other words, Orthogonal Projection
Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v
More information24. The Branch and Bound Method
24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no
More informationOrthogonal Projections
Orthogonal Projections and Reflections (with exercises) by D. Klain Version.. Corrections and comments are welcome! Orthogonal Projections Let X,..., X k be a family of linearly independent (column) vectors
More information. P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2
4. Basic feasible solutions and vertices of polyhedra Due to the fundamental theorem of Linear Programming, to solve any LP it suffices to consider the vertices (finitely many) of the polyhedron P of the
More informationMath 312 Homework 1 Solutions
Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please
More informationMetric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
More informationBaltic Way 1995. Västerås (Sweden), November 12, 1995. Problems and solutions
Baltic Way 995 Västerås (Sweden), November, 995 Problems and solutions. Find all triples (x, y, z) of positive integers satisfying the system of equations { x = (y + z) x 6 = y 6 + z 6 + 3(y + z ). Solution.
More informationMath 215 HW #6 Solutions
Math 5 HW #6 Solutions Problem 34 Show that x y is orthogonal to x + y if and only if x = y Proof First, suppose x y is orthogonal to x + y Then since x, y = y, x In other words, = x y, x + y = (x y) T
More information5.3 The Cross Product in R 3
53 The Cross Product in R 3 Definition 531 Let u = [u 1, u 2, u 3 ] and v = [v 1, v 2, v 3 ] Then the vector given by [u 2 v 3 u 3 v 2, u 3 v 1 u 1 v 3, u 1 v 2 u 2 v 1 ] is called the cross product (or
More informationis in plane V. However, it may be more convenient to introduce a plane coordinate system in V.
.4 COORDINATES EXAMPLE Let V be the plane in R with equation x +2x 2 +x 0, a two-dimensional subspace of R. We can describe a vector in this plane by its spatial (D)coordinates; for example, vector x 5
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationMAT 200, Midterm Exam Solution. a. (5 points) Compute the determinant of the matrix A =
MAT 200, Midterm Exam Solution. (0 points total) a. (5 points) Compute the determinant of the matrix 2 2 0 A = 0 3 0 3 0 Answer: det A = 3. The most efficient way is to develop the determinant along the
More informationTHE BANACH CONTRACTION PRINCIPLE. Contents
THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,
More informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
More informationMATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column
More informationby the matrix A results in a vector which is a reflection of the given
Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that
More informationLinear Programming. Solving LP Models Using MS Excel, 18
SUPPLEMENT TO CHAPTER SIX Linear Programming SUPPLEMENT OUTLINE Introduction, 2 Linear Programming Models, 2 Model Formulation, 4 Graphical Linear Programming, 5 Outline of Graphical Procedure, 5 Plotting
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More informationMA 408 Computer Lab Two The Poincaré Disk Model of Hyperbolic Geometry. Figure 1: Lines in the Poincaré Disk Model
MA 408 Computer Lab Two The Poincaré Disk Model of Hyperbolic Geometry Put your name here: Score: Instructions: For this lab you will be using the applet, NonEuclid, created by Castellanos, Austin, Darnell,
More informationON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES.
ON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES. O. N. KARPENKOV Introduction. A series of properties for ordinary continued fractions possesses multidimensional
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationUnique Factorization
Unique Factorization Waffle Mathcamp 2010 Throughout these notes, all rings will be assumed to be commutative. 1 Factorization in domains: definitions and examples In this class, we will study the phenomenon
More information1 The Line vs Point Test
6.875 PCP and Hardness of Approximation MIT, Fall 2010 Lecture 5: Low Degree Testing Lecturer: Dana Moshkovitz Scribe: Gregory Minton and Dana Moshkovitz Having seen a probabilistic verifier for linearity
More informationL 2 : x = s + 1, y = s, z = 4s + 4. 3. Suppose that C has coordinates (x, y, z). Then from the vector equality AC = BD, one has
The line L through the points A and B is parallel to the vector AB = 3, 2, and has parametric equations x = 3t + 2, y = 2t +, z = t Therefore, the intersection point of the line with the plane should satisfy:
More informationALMOST COMMON PRIORS 1. INTRODUCTION
ALMOST COMMON PRIORS ZIV HELLMAN ABSTRACT. What happens when priors are not common? We introduce a measure for how far a type space is from having a common prior, which we term prior distance. If a type
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationLinear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued.
Linear Programming Widget Factory Example Learning Goals. Introduce Linear Programming Problems. Widget Example, Graphical Solution. Basic Theory:, Vertices, Existence of Solutions. Equivalent formulations.
More information12.5 Equations of Lines and Planes
Instructor: Longfei Li Math 43 Lecture Notes.5 Equations of Lines and Planes What do we need to determine a line? D: a point on the line: P 0 (x 0, y 0 ) direction (slope): k 3D: a point on the line: P
More informationCHAPTER 9. Integer Programming
CHAPTER 9 Integer Programming An integer linear program (ILP) is, by definition, a linear program with the additional constraint that all variables take integer values: (9.1) max c T x s t Ax b and x integral
More informationCompletely Positive Cone and its Dual
On the Computational Complexity of Membership Problems for the Completely Positive Cone and its Dual Peter J.C. Dickinson Luuk Gijben July 3, 2012 Abstract Copositive programming has become a useful tool
More informationMaster s Theory Exam Spring 2006
Spring 2006 This exam contains 7 questions. You should attempt them all. Each question is divided into parts to help lead you through the material. You should attempt to complete as much of each problem
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationChapter 6. Orthogonality
6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be
More informationLecture 2: August 29. Linear Programming (part I)
10-725: Convex Optimization Fall 2013 Lecture 2: August 29 Lecturer: Barnabás Póczos Scribes: Samrachana Adhikari, Mattia Ciollaro, Fabrizio Lecci Note: LaTeX template courtesy of UC Berkeley EECS dept.
More informationSpecial Situations in the Simplex Algorithm
Special Situations in the Simplex Algorithm Degeneracy Consider the linear program: Maximize 2x 1 +x 2 Subject to: 4x 1 +3x 2 12 (1) 4x 1 +x 2 8 (2) 4x 1 +2x 2 8 (3) x 1, x 2 0. We will first apply the
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
More informationx1 x 2 x 3 y 1 y 2 y 3 x 1 y 2 x 2 y 1 0.
Cross product 1 Chapter 7 Cross product We are getting ready to study integration in several variables. Until now we have been doing only differential calculus. One outcome of this study will be our ability
More informationDate: April 12, 2001. Contents
2 Lagrange Multipliers Date: April 12, 2001 Contents 2.1. Introduction to Lagrange Multipliers......... p. 2 2.2. Enhanced Fritz John Optimality Conditions...... p. 12 2.3. Informative Lagrange Multipliers...........
More information4: SINGLE-PERIOD MARKET MODELS
4: SINGLE-PERIOD MARKET MODELS Ben Goldys and Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2015 B. Goldys and M. Rutkowski (USydney) Slides 4: Single-Period Market
More informationOptimisation et simulation numérique.
Optimisation et simulation numérique. Lecture 1 A. d Aspremont. M2 MathSV: Optimisation et simulation numérique. 1/106 Today Convex optimization: introduction Course organization and other gory details...
More informationSurface bundles over S 1, the Thurston norm, and the Whitehead link
Surface bundles over S 1, the Thurston norm, and the Whitehead link Michael Landry August 16, 2014 The Thurston norm is a powerful tool for studying the ways a 3-manifold can fiber over the circle. In
More informationLecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method
Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming
More informationVector Spaces 4.4 Spanning and Independence
Vector Spaces 4.4 and Independence October 18 Goals Discuss two important basic concepts: Define linear combination of vectors. Define Span(S) of a set S of vectors. Define linear Independence of a set
More informationConvex Rationing Solutions (Incomplete Version, Do not distribute)
Convex Rationing Solutions (Incomplete Version, Do not distribute) Ruben Juarez rubenj@hawaii.edu January 2013 Abstract This paper introduces a notion of convexity on the rationing problem and characterizes
More information1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.
Introduction Linear Programming Neil Laws TT 00 A general optimization problem is of the form: choose x to maximise f(x) subject to x S where x = (x,..., x n ) T, f : R n R is the objective function, S
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
More informationAnswer Key for California State Standards: Algebra I
Algebra I: Symbolic reasoning and calculations with symbols are central in algebra. Through the study of algebra, a student develops an understanding of the symbolic language of mathematics and the sciences.
More informationSection 6.1 - Inner Products and Norms
Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,
More informationArrangements And Duality
Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,
More information