# Applied Lagrange Duality for Constrained Optimization

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Applied Lagrange Duality for Constrained Optimization Robert M. Freund February 10, 2004 c 2004 Massachusetts Institute of Technology. 1

2 1 Overview The Practical Importance of Duality Review of Convexity A Separating Hyperplane Theorem Definition of the Dual Problem Steps in the Construction of the Dual Problem Examples of Dual Constructions The Dual is a Concave Maximization Problem Weak Duality The Column Geometry of the Primal and Dual Problems Strong Duality Duality Strategies Illustration of Lagrange Duality in Discrete Optimization 2 The Practical Importance of Duality Duality arises in nonlinear (and linear) optimization models in a wide variety of settings. Some immediate examples of duality are in: Models of electrical networks. The current flows are primal variables and the voltage differences are the dual variables that arise in consideration of optimization (and equilibrium) in electrical networks. Models of economic markets. In these models, the primal variables are production levels and consumption levels, and the dual variables are prices of goods and services. Structural design. In these models, the tensions on the beams are primal variables, and the nodal displacements are the dual variables. 2

3 Nonlinear (and linear) duality is very useful. For example, dual problems and their solutions are used in connection with: Identifying near-optimal solutions. A good dual solution can be used to bound the values of primal solutions, and so can be used to actually identify when a primal solution is near-optimal. Proving optimality. Using a strong duality theorem, one can prove optimality of a primal solution by constructing a dual solution with the same objective function value. Sensitivity analysis of the primal problem. The dual variable on a constraint represents the incremental change in the optimal solution value per unit increase in the RHS of the constraint. Karush-Kuhn-Tucker (KKT) conditions. The optimal solution to the dual problem is a vector of KKT multipliers. Convergence of improvement algorithms. The dual problem is often used in the convergence analysis of algorithms. Good Structure. Quite often, the dual problem has some good mathematical, geometric, or computational structure that can exploited in computing solutions to both the primal and the dual problem. Other uses, too Review of Convexity 3.1 Local and Global Optima of a Function The ball centered at x with radius ɛ is the set: B( x, ɛ) :={x x x ɛ}. Consider the following optimization problem over the set F: P : min x or max x f (x) x F 3

4 We have the following definitions of local/global, strict/non-strict minima/maxima. Definition 3.1 x F is a local minimum of P if there exists ɛ > 0 such that f(x) f(y) for all y B(x, ɛ) F. Definition 3.2 x F is a global minimum of P if f(x) f(y) for all y F. Definition 3.3 x F is a strict local minimum of P if there exists ɛ > 0 such that f(x) < f(y) for all y B(x, ɛ) F, y x. Definition 3.4 x F is a strict global minimum of P if f(x) < f(y) for all y F, y = x. Definition 3.5 x F is a local maximum of P if there exists ɛ > 0 such that f(x) f(y) for all y B(x, ɛ) F. Definition 3.6 x F is a global maximum of P if f(x) f(y) for all y F. Definition 3.7 x F is a strict local maximum of P if there exists ɛ > 0 such that f(x) > f(y) for all y B(x, ɛ) F, y = x. Definition 3.8 x F is a strict global maximum of P if f(x) > f(y) for all y F, y = x. The phenomenon of local versus global optima is illustrated in Figure Convex Sets and Functions Convex sets and convex functions play an extremely important role in the study of optimization models. We start with the definition of a convex set: Definition 3.9 A subset S R n is a convex set if for any λ [0, 1]. x, y S λx +(1 λ)y S 4

5 F Figure 1: Illustration of local versus global optima. Figure 2: Illustration of convex and non-convex sets. Figure 3: Illustration of the intersection of convex sets. 5

6 Figure 4: Illustration of convex and strictly convex functions. Figure 2 shows a convex set and a non-convex set. Proposition 3.1 If S, T are convex sets, then S T is a convex set. This proposition is illustrated in Figure 3. Proposition 3.2 The intersection of any collection of convex sets is a convex set. We now turn our attention to convex functions, defined below. Definition 3.10 A function f (x) is a convex function if f (λx +(1 λ)y) λf (x)+(1 λ)f (y) for all x and y and for all λ [0, 1]. Definition 3.11 A function f (x) is a strictly convex function if f (λx +(1 λ)y) < λf (x)+(1 λ)f (y) for all x and y, x = y, andforall λ (0, 1). Figure 4 illustrates convex and strictly convex functions. Now consider the following optimization problem, where the feasible region is simply described as the set F : 6

7 P : minimize x f(x) x F Theorem 3.1 Suppose that F is a convex set, f : F R is a convex function, and x is a local minimum of P. Then x is a global minimum of f over F. Proof: Suppose x is not a global minimum, i.e., there exists y F for which f(y) < f( x). Let y(λ) = λx+(1 λ)y, which is a convex combination of x and y for λ [0, 1] (and therefore, y(λ) F for λ [0, 1]). Note that y(λ) x as λ 1. From the convexity of f( ), f(y(λ)) = f(λx+(1 λ)y) λf( x)+(1 λ)f(y) < λf( x)+(1 λ)f( x) = f( x) for all λ (0, 1). Therefore, f(y(λ)) < f( x) for all λ (0, 1), and so x is not a local minimum, resulting in a contradiction. q.e.d. Some examples of convex functions of one variable are: f(x) = ax + b f(x) = x 2 + bx + c f(x) = x f(x) = ln(x) for x>0 f(x) = 1 for x >0 x f(x) = e x 7

8 Figure 5: Illustration of concave and strictly concave functions. 3.3 Concave Functions and Maximization The opposite of a convex function is a concave function, defined below: Definition 3.12 A function f (x) is a concave function if f (λx +(1 λ)y) λf (x)+(1 λ)f (y) for all x and y and for all λ [0, 1]. Definition 3.13 A function f (x) is a strictly concave function if f (λx +(1 λ)y) > λf (x)+(1 λ)f (y) for all x and y, x = y, andforall λ (0, 1). Figure 5 illustrates concave and strictly concave functions. Now consider the maximization problem P : P : maximize x f (x) x F Theorem 3.2 Suppose that F is a convex set, f : F R is a concave function, and x is a local maximum of P. Then x is a global maximum of f over F. 8

9 3.4 Convex Programs Now consider the optimization problem P which might be either a minimization problem or a maximization problem: P : min x or max x f (x) x F Definition 3.14 We call P a convex program if F is a convex set, and we are minimizing and f (x) is a convex function, or we are maximizing and f (x)is a concave function. Then from the above theorems, every local optima of the objective function of a convex program is a global optima of the objective function. The class of convex programs is the class of well-behaved optimization problems. 3.5 Linear Functions, Convexity, and Concavity Proposition 3.3 A linear function f (x) = a T x + b is both convex and concave. Proposition 3.4 If f (x) is both convex and concave, then f (x) is a linear function. These properties are illustrated in Figure 6. 9

10 Figure 6: A linear function is convex and concave. 4 A Separating Hyperplane Theorem The main tool that is used in developing duality, analyzing dual problems, etc., is the separating hyperplane theorem for convex sets. This theorem states that a point outside of a convex set can be separated from the set by hyperplane. The theorem is intuitively obvious, and is very easy to prove. Theorem 4.1 Strong Separating Hyperplane Theorem: Suppose that S is a convex set in R n, and that we are given a point x/ S. Then there exists a vector u 0 and a scalar α for which the following hold: u T x>α for all x S ut x<α This is illustrated in Figure 7. A weaker version of this theorem is as follows: Theorem 4.2 Weak Separating Hyperplane Theorem: Suppose that S is a convex set in R n, and that we are given a point x/ S or x S. Then there exists a vector u 0 and a scalar α for which the following hold: u T x α for all x S ut x α 10

11 S x utx = α Figure 7: Illustration of strong separation of a point from a convex set. x S utx = α Figure 8: Illustration of weak separation of a point from a convex set. This is illustrated in Figure 8. Now consider the following simple primal and dual problems, that will be prototypical of the geometry of duality that we will develop in this lecture. Primal : minimum x height of x x S, x L 11

12 Dual : maximum π intercept of line π with L line π lies below S This is illustrated in Figure 9. z L S π Figure 9: Illustration intersecting line dual. r 5 Definition of the Dual Problem Recall the basic constrained optimization model: 12

13 OP : minimum x f(x) g 1 (x) 0, =. g m (x) 0, x P, In this model, we have f(x) : R Rand g i (x) : R n n R,i =1,...,m. Of course, we can always convert the constraints to be, and so for now we will presume that our problem is of the form: OP : z = minimum x f(x) g 1 (x) 0,. g m (x) 0, x P, Here P could be any set, such as: P = R n P = {x x 0} 13

14 P = {x g i (x) 0,i = m +1,...,m+ k} { } P = x x Z+ n P = {x Ax b} Let z denote the optimal objective value of OP. For a nonnegative vector u, form the Lagrangian function: m T L(x, u) := f(x)+ u g(x) = f(x)+ u i g i (x) i=1 by taking the constraints out of the body of the model, and placing them in the objective function with costs/prices/multipliers u i for i = 1,...,m. We then solve the presumably easier problem: L (u) := minimum x f(x)+ u T g(x) x P The function L (u) is called the dual function. We presume that computing L (u) isaneasytask. The dual problem is then defined to be: D: v =maximum u L (u) u 0 14

15 6 Steps in the Construction of the Dual Problem We start with the primal problem: OP : z = minimum x f(x) g i (x) 0, i =1,...,m, x P, Constructing the dual involves a three-step process: Step 1. Create the Lagrangian Step 2. Create the dual function: T L(x, u) := f(x)+ u g(x). L (u) := minimum x f(x)+ u T g(x) x P Step 3. Create the dual problem: D: v =maximum u L (u) u 0 15

16 7 Examples of Dual Constructions of Optimization Problems 7.1 The Dual of a Linear Problem Consider the linear optimization problem: LP : minimum x T c x Ax b What is the dual of this problem? 7.2 The Dual of a Binary Integer Problem Consider the binary integer problem: T IP : minimum x c x Ax b x j {0, 1}, j =1,...,n. What is the dual of this problem? 7.3 The Dual of a Log-Barrier Problem Consider the following logarithmic barrier problem: 3 BP : minimum x1,x 2,x 3 5x 1 +7x 2 4x 3 ln(x j ) j=1 x 1 +3x 2 +12x 3 =37 x 1 > 0, x 2 > 0, x 3 > 0. What is the dual of this problem? 16

17 7.4 The Dual of a Quadratic Problem Consider the quadratic optimization problem: 1 QP : minimum x 2 x T Qx + ct x Ax b where Q is SPSD (symmetric and positive semi-definite). What is the dual of this problem? 7.5 Remarks on Problems with Different Formats of Constraints Suppose that our problem has some inequality and equality constraints. Then just as in the case of linear optimization, we assign nonnegative dual variables u i to constraints of the form g i (x) 0, unrestricted dual variables u i to equality constraints g i (x) = 0, and non-positive dual variables u i to constraints of the form g i (x) 0. For example, suppose our problem is: OP : minimum x f(x) g i (x) 0, i L g i (x) 0, i G g i (x) = 0, i E x P, Then we form the Lagrangian: 17

18 T L(x, u) := f(x)+ u g(x) = f(x)+ u i g i (x)+ u i g i (x)+ u i g i (x) and construct the dual function L (u): i L i G i E L (u) := minimum x f(x)+ u T g(x) x P The dual problem is then defined to be: D: maximum u L (u) u i 0, i L u i 0, i G > u i <, i E For simplicity, we presume that the constraints of OP are of the form g i (x) 0. This is only for ease of notation, as the results we develop pertain to the general case just described. 8 The Dual is a Concave Maximization Problem We start with the primal problem: 18

19 OP : minimum x f(x) g i (x) 0, i =1,...,m x P, We create the Lagrangian: and the dual function: T L(x, u) := f(x)+ u g(x) L (u) := minimum x f(x)+ u T g(x) x P The dual problem then is: D: maximum u L (u) u 0 Theorem 8.1 The dual function L (u) is a concave function. Proof: Let u 1 0 and u 2 0 be two values of the dual variables, and let 19

20 u = λu 1 +(1 λ)u 2, where λ [0, 1]. Then L (u) = min x P f(x)+ u T g(x) [ ] [ ] = min T T x P λ f(x)+ u 1 g(x) +(1 λ) f(x)+ u 2 g(x) [ ] [ ] λ min T T x P f(x)+ u 1 g(x) +(1 λ) min x P (f(x)+ u 2 g(x) = λl (u 1 )+(1 λ)l (u 2 ). Therefore we see that L (u) is a concave function. q.e.d. 9 Weak Duality Let z and v be the optimal values of the primal and the dual problems: OP : z = minimum x f(x) g i (x) 0, i =1,...,m x P, D: v =maximum u L (u) u 0 Theorem 9.1 Weak Duality Theorem: If x is feasible for OP and u is feasible for D, then f( x) L ( u) 20

21 In particular, z v. Proof: If x is feasible for OP and u is feasible for D, then Therefore z v. q.e.d. T f( x) f( x)+ u g( x) min f(x)+ u g(x) = L ( u). x P T 10 The Column Geometry of the Primal and Dual Problems For this section only, we will assume that our constraints are all equality constraints, and so our problems are: OP : z = minimum x f(x) g i (x) = 0, i =1,...,m x P, D: v =maximum u L (u) > u < 0 where L (u) := minimum x f(x)+ u T g(x) x P 21

22 Let us consider the primal problem from a resource-cost point of view. For each x P, we have an array of resources and costs associated with x, namely: r 1 g 1 (x) ( ) r 2 g 2 (x) ( ) r g(x) =. = = z.. f(x) r g m (x) m z f(x) We can think of each of these arrays as an array of resources and cost in R m+1. If we plot all of these arrays over all values of x P, we will obtain a region in R m+1, which we will call the region S: { } m+1 S := (r, z) R (r, z) =(g(x),f(x)) for some x P. This region is illustrated in Figure 10. z L = {( r, z ) r = 0 } S H r 1 r 2 r = 0 Figure 10: The column geometry of the primal and dual problem. 22

23 Where is the feasible region of the primal in this problem? Well, we are in the wrong space to observe this. But notice that the figure contains the origin and a vertical line L going up from the origin. The points on this vertical line have resource utilization of 0, and their costs are their heights on the vertical line. Therefore, every point in the intersection of S and L corresponds to a feasible solution, and the feasible solution with the lowest cost corresponds to the lowest point on the intersection of S and L. We re-state this for emphasis: Every point in the intersection S of and L corresponds to a feasible solution of OP, and the feasible solution with the lowest cost corresponds to the lowest point in the intersection S of and L. This lowest value is exactly the value of the primal problem, namely z. In Figure 10, notice that there is also drawn a hyperplane H, and that this hyperplane H lies below the region S. Suppose that we try to find that hyperplane H lying below S whose intersection with L is as large as possible. Let us formulate this problem mathematically. We will let { } m+1 H = H u,α = (r, z) R z + u T r = α. The line L is: { } m+1 L = (r, z) R r = 0. The intersection of H u,α with L is: and it occurs at the point H L (r, z) =(0,α). Then the problem of determining the hyperplane H u,α lying below S whose intersection with L is the highest is: 23

24 maximum u,α α H u,α lies below S = maximum u,α α z + u T r α, for all (r, z) S = maximum u,α α f (x)+ u T g(x) α, for all x P = maximum u,α α L (u) α, = maximum u L (u) and this last expression is exactly the dual problem (for the special case of this section). Therefore: The dual problem corresponds to finding that hyperplane H u,α lying below S whose intersection with L is the highest. This highest value is exactly the value of the dual problem, namely v. 24

25 11 Strong Duality When the set S is a convex set, then generally speaking, we would expect z = v, that is, the primal and the dual have identical optimal objective function values. When the set S is not convex, we would not necessarily expect this to happen, see the illustrations in Figures 11 and 12. z L S r = 0 H r Figure 11: The column geometry of the dual problem when S is convex. z L z* v* S H r Figure 12: The column geometry of the dual problem when S is not convex. As it turns out, convexity is the key to strong duality. When the problem OP is a convex program, then strong duality will hold in general, as the following theorem states: 25

26 Theorem 11.1 Strong Duality Theorem: Suppose that OP is a convex optimization problem, that is, all constraints of OP are of the gform i (x) 0,i =1,...,m, f(x) as well as g i (x) are convex functions, i = 1,...,m,and P is a convex set. Then under very mild additional conditions, z = v. 12 Duality Strategies 12.1 Dualizing Bad Constraints Suppose we wish to solve: OP : minimum x T c x Ax b Nx g. Suppose that optimization over the constraints Nx g is easy, but that the addition of the constraints Ax b makes the problem much more difficult. This can happen, for example, when the constraints Nx g are network constraints, and when Ax b are non-network constraints in the model. Let and re-write OP as: P = {x Nx g} OP : minimum x T c x Ax b x P. The Lagrangian is: 26

27 T L(x, u) = c x + u T (Ax b) = u T b +(c T + u T A)x, and the dual function is: L (u) := minimum x u T b +(c T + u T A)x x P. Notice that L (u) is easy to evaluate for any value of u, and so we can attempt to solve OP by designing an algorithm to solve the dual problem: D: maximum u L (u) u Dualizing A Large Problem into Many Small Problems Suppose we wish to solve: OP : minimum 1 2 (c 1 ) T x 1 +(c 2 ) T x 2 x,x B 1 x 1 +B 2 x 2 d A 1 x 1 b 1 A 2 x 2 b 2 Notice here that if it were not for the constraints B 1 x 1 + B 2 x 2 d, that we would be able to separate the problem into two separate problems. Let us dualize on these constraints. Let: { } 1 P = (x,x 2 ) A 1 x 1 b 1,A 2 x 2 b 2 27

28 and re-write OP as: OP : minimum 1 2 (c 1 ) T x 1 +(c 2 ) T x 2 x,x B 1 x 1 +B 2 x 2 d (x 1,x 2 ) P The Lagrangian is: L(x, u) = (c 1 ) T x 1 +(c 2 ) T x 2 + u T (B 1 x 1 + B 2 x 2 d) and the dual function is: 2 = u T d +((c 1 ) T + u T B 1 )x 1 +((c 2 ) T + u T B 2 )x, L (u) = minimum 2 x 1,x 2 ut d +((c 1 ) T + u T B 1 )x 1 +((c 2 ) T + u T B 2 )x (x 1,x 2 ) P which can be re-written as: L (u) = u T d + minimum A 1 x 1 b 1 ((c1 ) T + u T B 1 )x 1 + minimum A 2 x 2 b 2 ((c2 ) T + u T B 2 )x 2 Notice once again that L (u) is easy to evaluate for any value of u, and so we can attempt to solve OP by designing an algorithm to solve the dual problem: D: maximum u L (u) u 0 28

29 13 Illustration of Lagrange Duality in Discrete Optimization In order to suggest the computational power of duality theory and to illustrate duality constructs in discrete optimization, let us consider the simple constrained shortest path problem portrayed in Figure Figure 13: A constrained shortest path problem. The objective in this problem is to find the shortest (least cost) path from node 1 to node 6 subject to the constraint that the chosen path uses exactly four arcs. In an applied context the network might contain millions of nodes and arcs and billions of paths. For example, in one application setting that can be solved using the ideas considered in this discussion, each arc would have both a travel cost and travel time (which for our example is 1 for each arc). The objective is to find the least cost path between a given pair of nodes from all those paths whose travel time does not exceed a prescribed limit (which in our example is 4 and must be met exactly). Table 1 shows that only three paths, namely , , and between nodes 1 and 6 contain exactly four arcs. Since path has the least cost of these three paths (at a cost of 5), this path is the optimal solution of the constrained shortest path problem. Now suppose that we have available an efficient algorithm for solving 29

30 Path Number of Arcs Cost Table 1: Paths from node 1 to node 6. (unconstrained) shortest path problems (indeed, such algorithms are readily available in practice), and that we wish to use this algorithm to solve the given problem. Let us first formulate the constrained shortest path problem as an integer program: CSPP : z =min xij x 12 +x 13 +x 23 +x 24 +3x 34 +2x 35 +x 54 +x 46 +3x 56 x 12 +x 13 +x 23 +x 24 +x 34 +x 35 +x 54 +x 46 +x 56 = 4 x 12 +x 13 = 1 x 12 x 23 x 24 = 0 x 13 +x 23 x 34 x 35 = 0 x 24 +x 34 +x 54 x 46 = 0 x 35 x 54 x 56 = 0 x 46 +x 56 = 1 x ij {0, 1} for all x ij. 30

31 In this formulation, x ij is a binary variable indicating whether or not arc i j is chosen as part of the optimal path. The first constraint in this formulation specifies that the optimal path must contain exactly four arcs. The remaining constraints are the familiar constraints describing a shortest path problem. They indicate that one unit of flow is available at node 1 and must be sent to node 6; nodes 2, 3, 4, and 5 act as intermediate nodes that neither generate nor consume flow. Since the decision variables x ij must be integer, any feasible solution to these constraints traces out a path from node 1 to node 6. The objective function determines the cost of any such path. Notice that if we eliminate the first constraint from this problem, then the problem becomes an unconstrained shortest path problem that can be solved by our available algorithm. Suppose, for example, that we dualize the first (the complicating) constraint by moving it to the objective function multiplied by a Lagrange multiplier u. The objective function then becomes: minimum xij c ij x ij + u 4 x ij i,j i,j and collecting the terms, the modified problem becomes: 31

32 L (u) =min xij (1 u)x 12 +(1 u)x 13 +(1 u)x 23 +(1 u)x 24 +(3 u)x 34 +(2 u)x 35 +(1 u)x 54 +(1 u)x 46 +(3 u)x 56 +4u x 12 +x 13 = 1 x 12 x 23 x 24 = 0 x 13 +x 23 x 34 x 35 = 0 x 24 +x 34 +x 54 x 46 = 0 x 35 x 54 x 56 = 0 x 46 +x 56 = 1 x ij {0, 1} for all x ij. Let L (u) denote the optimal objective function value of this problem, for any given multiplier u. Notice that for a fixed value of u, 4u is a constant and the problem becomes a shortest path problem with modified arc costs given by c ij = c ij u. Note that for a fixed value of u, this problem can be solved by our available algorithm for the shortest path problem. Also notice that for any fixed value of u, L (u) is a lower bound on the optimal objective value z to the constrained shortest path problem defined by the original formulation. To obtain the best lower bounds, we need to solve the Lagrangian dual problem: 32

33 D: v =maximum u L (u) < u > 0 To relate this problem to the earlier material on duality, let the decision set P be given by the set of feasible paths, namely the solutions of: x 12 +x 13 = 1 x 12 x 23 x 24 = 0 x 13 +x 23 x 34 x 35 = 0 x ij {0, 1} for all x ij. x 24 +x 34 +x 54 x 46 = 0 x 35 x 54 x 56 = 0 x 46 +x 56 = 1 Of course, this set will be a finite (discrete) set. That is, P is the set of paths connecting node 1 to node 6. Suppose that we plot the cost z and the number of arcs r used in each of these paths, see Figure 14. We obtain the seven dots in this figure corresponding to the seven paths listed in Table 1. Now, because our original problem was formulated as a minimization problem, the geometric dual is obtained by finding the line that lies on or below these dots and that has the largest intercept with the feasibility line. Note from Figure 14 that the optimal value of the dual is v =4.5, whereas the optimal value of the original primal problem is z =5. In this example, because the cost-resource set is not convex (it is simply the seven dots), we encounter a duality gap. In general, integer optimization 33

34 z (cost) conv( S) z* = 5 v* = r (number of arcs) Figure 14: Resources and costs. models will usually have such duality gaps, but they are typically not very large in practice. Nevertheless, the dual bounding information provided by v z can be used in branch and bound procedures to devise efficient algorithms for solving integer optimization models. It might be useful to re-cap. The original constrained shortest path problem might be very difficult to solve directly (at least when there are hundreds of thousands of nodes and arcs). Duality theory permits us to relax (eliminate) the complicating constraint and to solve a much easier Lagrangian shortest path problem with modified arc costs c ij = c ij u. Solving for any u generates a lower bound L (u) onthe value z to the original problem. Finding the best lower bound max u L (u) requires that we develop an efficient procedure for solving for the optimal u. Duality theory permits us to replace a single and difficult problem (in this instance, a constrained shortest-path problem) with a sequence of much easier problems (in this instance, a number of unconstrained shortest path problems), one for each value of u encountered in our search procedure. Practice on a wide variety of problem applications has shown that the dual problem and subsequent branch and bound procedures can be extremely effective in many 34

35 applications. To conclude this discussion, note from Figure 14 that the optimal value for u in the dual problem is u = 1.5. Also note that if we subtract u = 1.5 from the cost of every arc in the network, then the shortest path (with respect to the modified costs) has cost 1.5. Both paths and are shortest paths for this modified problem. Adding 4u = =6 to the modified shortest path cost of 1.5 gives a value of =4.5 which equals v. Note that if we permitted the flow in the original problem to be split among multiple paths (i.e., formulate the problem as a linear optimization problem instead of as an integer optimization problem), then the optimal solution would send one half of the flow on both paths and and incur a cost of: = In general, the value of the dual problem is always identical to the value of the original (primal) problem if we permit convex combinations of primal solutions. This equivalence between convexification and dualization is easy to see geometrically. 35

### Introduction to Constrained Optimization

Introduction to Constrained Optimization Duality and KKT Conditions Pratik Shah {pratik.shah [at] lnmiit.ac.in} The LNM Institute of Information Technology www.lnmiit.ac.in February 13, 2013 LNMIIT MLPR

### Mathematical Programming and Research Methods (Part II)

Mathematical Programming and Research Methods (Part II) 4. Convexity and Optimization Massimiliano Pontil (based on previous lecture by Andreas Argyriou) 1 Today s Plan Convex sets and functions Types

### Convexity. 1 X i is convex. = b is a hyperplane in R n, and is denoted H(p, b) i.e.,

Convexity We ll assume throughout, without always saying so, that we re in the finite-dimensional Euclidean vector space R n, although sometimes, for statements that hold in any vector space, we ll say

### Introduction to Mathematical Programming IE406. Lecture 20. Dr. Ted Ralphs

Introduction to Mathematical Programming IE406 Lecture 20 Dr. Ted Ralphs IE406 Lecture 20 1 Reading for This Lecture Bertsimas Sections 10.1, 11.4 IE406 Lecture 20 2 Integer Linear Programming An integer

### PRIMAL-DUAL INTERIOR POINT METHOD FOR LINEAR PROGRAMMING. 1. Introduction

PRIMAL-DUAL INTERIOR POINT METHOD FOR LINEAR PROGRAMMING KELLER VANDEBOGERT AND CHARLES LANNING 1. Introduction Interior point methods are, put simply, a technique of optimization where, given a problem

### Lecture 7: Support Vector Machine

Lecture 7: Support Vector Machine Hien Van Nguyen University of Houston 9/28/2017 Separating hyperplane Red and green dots can be separated by a separating hyperplane Two classes are separable, i.e., each

### MA4254: Discrete Optimization. Defeng Sun. Department of Mathematics National University of Singapore Office: S Telephone:

MA4254: Discrete Optimization Defeng Sun Department of Mathematics National University of Singapore Office: S14-04-25 Telephone: 6516 3343 Aims/Objectives: Discrete optimization deals with problems of

### A Short SVM (Support Vector Machine) Tutorial

A Short SVM (Support Vector Machine) Tutorial j.p.lewis CGIT Lab / IMSC U. Southern California version 0.zz dec 004 This tutorial assumes you are familiar with linear algebra and equality-constrained optimization/lagrange

### Convexity: an introduction

Convexity: an introduction Geir Dahl CMA, Dept. of Mathematics and Dept. of Informatics University of Oslo 1 / 74 1. Introduction 1. Introduction what is convexity where does it arise main concepts and

### Math 5593 Linear Programming Lecture Notes

Math 5593 Linear Programming Lecture Notes Unit II: Theory & Foundations (Convex Analysis) University of Colorado Denver, Fall 2013 Topics 1 Convex Sets 1 1.1 Basic Properties (Luenberger-Ye Appendix B.1).........................

### Numerical Optimization

Convex Sets Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Let x 1, x 2 R n, x 1 x 2. Line and line segment Line passing through x 1 and x 2 : {y

### 5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY

5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY 5.1 DUALITY Associated with every linear programming problem (the primal) is another linear programming problem called its dual. If the primal involves

### we wish to minimize this function; to make life easier, we may minimize

Optimization and Lagrange Multipliers We studied single variable optimization problems in Calculus 1; given a function f(x), we found the extremes of f relative to some constraint. Our ability to find

### Unconstrained Optimization

Unconstrained Optimization Joshua Wilde, revised by Isabel Tecu, Takeshi Suzuki and María José Boccardi August 13, 2013 1 Denitions Economics is a science of optima We maximize utility functions, minimize

### Linear Programming. Larry Blume. Cornell University & The Santa Fe Institute & IHS

Linear Programming Larry Blume Cornell University & The Santa Fe Institute & IHS Linear Programs The general linear program is a constrained optimization problem where objectives and constraints are all

### LECTURE 13: SOLUTION METHODS FOR CONSTRAINED OPTIMIZATION. 1. Primal approach 2. Penalty and barrier methods 3. Dual approach 4. Primal-dual approach

LECTURE 13: SOLUTION METHODS FOR CONSTRAINED OPTIMIZATION 1. Primal approach 2. Penalty and barrier methods 3. Dual approach 4. Primal-dual approach Basic approaches I. Primal Approach - Feasible Direction

### This lecture: Convex optimization Convex sets Convex functions Convex optimization problems Why convex optimization? Why so early in the course?

Lec4 Page 1 Lec4p1, ORF363/COS323 This lecture: Convex optimization Convex sets Convex functions Convex optimization problems Why convex optimization? Why so early in the course? Instructor: Amir Ali Ahmadi

### Lagrange multipliers October 2013

Lagrange multipliers 14.8 14 October 2013 Example: Optimization with constraint. Example: Find the extreme values of f (x, y) = x + 2y on the ellipse 3x 2 + 4y 2 = 3. 3/2 1 1 3/2 Example: Optimization

### MATH3016: OPTIMIZATION

MATH3016: OPTIMIZATION Lecturer: Dr Huifu Xu School of Mathematics University of Southampton Highfield SO17 1BJ Southampton Email: h.xu@soton.ac.uk 1 Introduction What is optimization? Optimization is

### Sparse Optimization Lecture: Proximal Operator/Algorithm and Lagrange Dual

Sparse Optimization Lecture: Proximal Operator/Algorithm and Lagrange Dual Instructor: Wotao Yin July 2013 online discussions on piazza.com Those who complete this lecture will know learn the proximal

### Open and Closed Sets

Open and Closed Sets Definition: A subset S of a metric space (X, d) is open if it contains an open ball about each of its points i.e., if x S : ɛ > 0 : B(x, ɛ) S. (1) Theorem: (O1) and X are open sets.

### Linear programming and duality theory

Linear programming and duality theory Complements of Operations Research Giovanni Righini Linear Programming (LP) A linear program is defined by linear constraints, a linear objective function. Its variables

### Lecture 4: Convexity

10-725: Convex Optimization Fall 2013 Lecture 4: Convexity Lecturer: Barnabás Póczos Scribes: Jessica Chemali, David Fouhey, Yuxiong Wang Note: LaTeX template courtesy of UC Berkeley EECS dept. Disclaimer:

### Lagrangian Multipliers

Università Ca Foscari di Venezia - Dipartimento di Management - A.A.2017-2018 Mathematics Lagrangian Multipliers Luciano Battaia November 15, 2017 1 Two variables functions and constraints Consider a two

### Programs. Introduction

16 Interior Point I: Linear Programs Lab Objective: For decades after its invention, the Simplex algorithm was the only competitive method for linear programming. The past 30 years, however, have seen

### Topology and Topological Spaces

Topology and Topological Spaces Mathematical spaces such as vector spaces, normed vector spaces (Banach spaces), and metric spaces are generalizations of ideas that are familiar in R or in R n. For example,

### COMS 4771 Support Vector Machines. Nakul Verma

COMS 4771 Support Vector Machines Nakul Verma Last time Decision boundaries for classification Linear decision boundary (linear classification) The Perceptron algorithm Mistake bound for the perceptron

### Optimality certificates for convex minimization and Helly numbers

Optimality certificates for convex minimization and Helly numbers Amitabh Basu Michele Conforti Gérard Cornuéjols Robert Weismantel Stefan Weltge October 20, 2016 Abstract We consider the problem of minimizing

### IE 5531: Engineering Optimization I

IE 5531: Engineering Optimization I Lecture 3: Linear Programming, Continued Prof. John Gunnar Carlsson September 15, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 15, 2010

### Lecture 25 Nonlinear Programming. November 9, 2009

Nonlinear Programming November 9, 2009 Outline Nonlinear Programming Another example of NLP problem What makes these problems complex Scalar Function Unconstrained Problem Local and global optima: definition,

### Locally convex topological vector spaces

Chapter 4 Locally convex topological vector spaces 4.1 Definition by neighbourhoods Let us start this section by briefly recalling some basic properties of convex subsets of a vector space over K (where

### 16.410/413 Principles of Autonomy and Decision Making

16.410/413 Principles of Autonomy and Decision Making Lecture 17: The Simplex Method Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology November 10, 2010 Frazzoli (MIT)

### Convex sets and convex functions

Convex sets and convex functions Convex optimization problems Convex sets and their examples Separating and supporting hyperplanes Projections on convex sets Convex functions, conjugate functions ECE 602,

### Support Vector Machines. James McInerney Adapted from slides by Nakul Verma

Support Vector Machines James McInerney Adapted from slides by Nakul Verma Last time Decision boundaries for classification Linear decision boundary (linear classification) The Perceptron algorithm Mistake

### Lecture 2. Topology of Sets in R n. August 27, 2008

Lecture 2 Topology of Sets in R n August 27, 2008 Outline Vectors, Matrices, Norms, Convergence Open and Closed Sets Special Sets: Subspace, Affine Set, Cone, Convex Set Special Convex Sets: Hyperplane,

### OPERATIONS RESEARCH. Linear Programming Problem

OPERATIONS RESEARCH Chapter 1 Linear Programming Problem Prof. Bibhas C. Giri Department of Mathematics Jadavpur University Kolkata, India Email: bcgiri.jumath@gmail.com 1.0 Introduction Linear programming

### 6. Lecture notes on matroid intersection

Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans May 2, 2017 6. Lecture notes on matroid intersection One nice feature about matroids is that a simple greedy algorithm

### Section Notes 5. Review of Linear Programming. Applied Math / Engineering Sciences 121. Week of October 15, 2017

Section Notes 5 Review of Linear Programming Applied Math / Engineering Sciences 121 Week of October 15, 2017 The following list of topics is an overview of the material that was covered in the lectures

### Discrete Optimization. Lecture Notes 2

Discrete Optimization. Lecture Notes 2 Disjunctive Constraints Defining variables and formulating linear constraints can be straightforward or more sophisticated, depending on the problem structure. The

### Discrete Optimization 2010 Lecture 5 Min-Cost Flows & Total Unimodularity

Discrete Optimization 2010 Lecture 5 Min-Cost Flows & Total Unimodularity Marc Uetz University of Twente m.uetz@utwente.nl Lecture 5: sheet 1 / 26 Marc Uetz Discrete Optimization Outline 1 Min-Cost Flows

### Machine Learning for Signal Processing Lecture 4: Optimization

Machine Learning for Signal Processing Lecture 4: Optimization 13 Sep 2015 Instructor: Bhiksha Raj (slides largely by Najim Dehak, JHU) 11-755/18-797 1 Index 1. The problem of optimization 2. Direct optimization

### 9. Support Vector Machines. The linearly separable case: hard-margin SVMs. The linearly separable case: hard-margin SVMs. Learning objectives

Foundations of Machine Learning École Centrale Paris Fall 25 9. Support Vector Machines Chloé-Agathe Azencot Centre for Computational Biology, Mines ParisTech Learning objectives chloe agathe.azencott@mines

### Problem set 2. Problem 1. Problem 2. Problem 3. CS261, Winter Instructor: Ashish Goel.

CS261, Winter 2017. Instructor: Ashish Goel. Problem set 2 Electronic submission to Gradescope due 11:59pm Thursday 2/16. Form a group of 2-3 students that is, submit one homework with all of your names.

### / Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang

600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang 9.1 Linear Programming Suppose we are trying to approximate a minimization

### In this chapter we introduce some of the basic concepts that will be useful for the study of integer programming problems.

2 Basics In this chapter we introduce some of the basic concepts that will be useful for the study of integer programming problems. 2.1 Notation Let A R m n be a matrix with row index set M = {1,...,m}

### The Simplex Algorithm

The Simplex Algorithm Uri Feige November 2011 1 The simplex algorithm The simplex algorithm was designed by Danzig in 1947. This write-up presents the main ideas involved. It is a slight update (mostly

### Tuesday, April 10. The Network Simplex Method for Solving the Minimum Cost Flow Problem

. Tuesday, April The Network Simplex Method for Solving the Minimum Cost Flow Problem Quotes of the day I think that I shall never see A poem lovely as a tree. -- Joyce Kilmer Knowing trees, I understand

### Bilinear Programming

Bilinear Programming Artyom G. Nahapetyan Center for Applied Optimization Industrial and Systems Engineering Department University of Florida Gainesville, Florida 32611-6595 Email address: artyom@ufl.edu

### 1.7 The Heine-Borel Covering Theorem; open sets, compact sets

1.7 The Heine-Borel Covering Theorem; open sets, compact sets This section gives another application of the interval halving method, this time to a particularly famous theorem of analysis, the Heine Borel

### Introduction to Optimization

Introduction to Optimization Second Order Optimization Methods Marc Toussaint U Stuttgart Planned Outline Gradient-based optimization (1st order methods) plain grad., steepest descent, conjugate grad.,

### Division of the Humanities and Social Sciences. Convex Analysis and Economic Theory Winter Separation theorems

Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 8: Separation theorems 8.1 Hyperplanes and half spaces Recall that a hyperplane in

### Lecture 16 October 23, 2014

CS 224: Advanced Algorithms Fall 2014 Prof. Jelani Nelson Lecture 16 October 23, 2014 Scribe: Colin Lu 1 Overview In the last lecture we explored the simplex algorithm for solving linear programs. While

### David G. Luenberger Yinyu Ye. Linear and Nonlinear. Programming. Fourth Edition. ö Springer

David G. Luenberger Yinyu Ye Linear and Nonlinear Programming Fourth Edition ö Springer Contents 1 Introduction 1 1.1 Optimization 1 1.2 Types of Problems 2 1.3 Size of Problems 5 1.4 Iterative Algorithms

### arxiv: v1 [math.co] 12 Dec 2017

arxiv:1712.04381v1 [math.co] 12 Dec 2017 Semi-reflexive polytopes Tiago Royer Abstract The Ehrhart function L P(t) of a polytope P is usually defined only for integer dilation arguments t. By allowing

### 60 2 Convex sets. {x a T x b} {x ã T x b}

60 2 Convex sets Exercises Definition of convexity 21 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 θ 1x 1 + + θ k x k C (The definition of convexity

### minimize ½(x 1 + 2x 2 + x 32 ) subject to x 1 + x 2 + x 3 = 5

minimize ½(x 1 2 + 2x 2 2 + x 32 ) subject to x 1 + x 2 + x 3 = 5 In this Chapter We will study a new theory for constrained optimization Local optimality condition Easier to implement Deeper insights

### Module 1 Lecture Notes 2. Optimization Problem and Model Formulation

Optimization Methods: Introduction and Basic concepts 1 Module 1 Lecture Notes 2 Optimization Problem and Model Formulation Introduction In the previous lecture we studied the evolution of optimization

### Lagrangian Multipliers

Università Ca Foscari di Venezia - Dipartimento di Economia - A.A.2016-2017 Mathematics (Curriculum Economics, Markets and Finance) Lagrangian Multipliers Luciano Battaia November 15, 2017 1 Two variables

### Convex Optimization - Chapter 1-2. Xiangru Lian August 28, 2015

Convex Optimization - Chapter 1-2 Xiangru Lian August 28, 2015 1 Mathematical optimization minimize f 0 (x) s.t. f j (x) 0, j=1,,m, (1) x S x. (x 1,,x n ). optimization variable. f 0. R n R. objective

### A CLASS OF INDIRECT UTILITY FUNCTIONS PREDICTING GIFFEN BEHAVIOUR. P.G. MOFFATT, School of Economics, University of East Anglia, UK.

A CLASS OF INDIRECT UTILITY FUNCTIONS PREDICTING GIFFEN BEHAVIOUR P.G. MOFFATT, School of Economics, University of East Anglia, UK September 2010 Abstract The problem of recognising Giffen behaviour is

### Integer Programming ISE 418. Lecture 1. Dr. Ted Ralphs

Integer Programming ISE 418 Lecture 1 Dr. Ted Ralphs ISE 418 Lecture 1 1 Reading for This Lecture N&W Sections I.1.1-I.1.4 Wolsey Chapter 1 CCZ Chapter 2 ISE 418 Lecture 1 2 Mathematical Optimization Problems

### Approximation Algorithms

Approximation Algorithms Group Members: 1. Geng Xue (A0095628R) 2. Cai Jingli (A0095623B) 3. Xing Zhe (A0095644W) 4. Zhu Xiaolu (A0109657W) 5. Wang Zixiao (A0095670X) 6. Jiao Qing (A0095637R) 7. Zhang

### Preferred directions for resolving the non-uniqueness of Delaunay triangulations

Preferred directions for resolving the non-uniqueness of Delaunay triangulations Christopher Dyken and Michael S. Floater Abstract: This note proposes a simple rule to determine a unique triangulation

### Lecture 2: August 31

10-725/36-725: Convex Optimization Fall 2016 Lecture 2: August 31 Lecturer: Lecturer: Ryan Tibshirani Scribes: Scribes: Lidan Mu, Simon Du, Binxuan Huang 2.1 Review A convex optimization problem is of

### Stochastic Separable Mixed-Integer Nonlinear Programming via Nonconvex Generalized Benders Decomposition

Stochastic Separable Mixed-Integer Nonlinear Programming via Nonconvex Generalized Benders Decomposition Xiang Li Process Systems Engineering Laboratory Department of Chemical Engineering Massachusetts

### Lecture 15: The subspace topology, Closed sets

Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology

### Lecture Notes: Constraint Optimization

Lecture Notes: Constraint Optimization Gerhard Neumann January 6, 2015 1 Constraint Optimization Problems In constraint optimization we want to maximize a function f(x) under the constraints that g i (x)

### arxiv: v1 [math.co] 25 Sep 2015

A BASIS FOR SLICING BIRKHOFF POLYTOPES TREVOR GLYNN arxiv:1509.07597v1 [math.co] 25 Sep 2015 Abstract. We present a change of basis that may allow more efficient calculation of the volumes of Birkhoff

### AM 121: Intro to Optimization Models and Methods Fall 2017

AM 121: Intro to Optimization Models and Methods Fall 2017 Lecture 10: Dual Simplex Yiling Chen SEAS Lesson Plan Interpret primal simplex in terms of pivots on the corresponding dual tableau Dictionaries

### Constrained Optimization and Lagrange Multipliers

Constrained Optimization and Lagrange Multipliers MATH 311, Calculus III J. Robert Buchanan Department of Mathematics Fall 2011 Constrained Optimization In the previous section we found the local or absolute

### Approximation Algorithms: The Primal-Dual Method. My T. Thai

Approximation Algorithms: The Primal-Dual Method My T. Thai 1 Overview of the Primal-Dual Method Consider the following primal program, called P: min st n c j x j j=1 n a ij x j b i j=1 x j 0 Then the

### Solvers for Mixed Integer Programming /425 Declarative Methods - J. Eisner 1

Solvers for Mixed Integer Programming 600.325/425 Declarative Methods - J. Eisner 1 Relaxation: A general optimization technique Want: x* = argmin x f(x) subject to x S S is the feasible set Start by getting:

### 3 No-Wait Job Shops with Variable Processing Times

3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select

### Lagrangean Methods bounding through penalty adjustment

Lagrangean Methods bounding through penalty adjustment thst@man.dtu.dk DTU-Management Technical University of Denmark 1 Outline Brief introduction How to perform Lagrangean relaxation Subgradient techniques

### Convex Optimization CMU-10725

Convex Optimization CMU-10725 Ellipsoid Methods Barnabás Póczos & Ryan Tibshirani Outline Linear programs Simplex algorithm Running time: Polynomial or Exponential? Cutting planes & Ellipsoid methods for

### Support Vector Machines

Support Vector Machines SVM Discussion Overview. Importance of SVMs. Overview of Mathematical Techniques Employed 3. Margin Geometry 4. SVM Training Methodology 5. Overlapping Distributions 6. Dealing

Lagrange multipliers From Wikipedia, the free encyclopedia In mathematical optimization problems, Lagrange multipliers, named after Joseph Louis Lagrange, is a method for finding the local extrema of a

### Delay-minimal Transmission for Energy Constrained Wireless Communications

Delay-minimal Transmission for Energy Constrained Wireless Communications Jing Yang Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, M0742 yangjing@umd.edu

### 21-256: Lagrange multipliers

21-256: Lagrange multipliers Clive Newstead, Thursday 12th June 2014 Lagrange multipliers give us a means of optimizing multivariate functions subject to a number of constraints on their variables. Problems

### Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives

In general, if f is a function of two variables x and y, suppose we let only x vary while keeping y fixed, say y = b, where b is a constant. By the definition of a derivative, we have Then we are really

### Delay-Constrained Optimized Packet Aggregation in High-Speed Wireless Networks

Teymoori P, Yazdani N. Delay-constrained optimized packet aggregation in high-speed wireless networks. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 28(3): 525 539 May 2013. DOI 10.1007/s11390-013-1353-1

### Winter 2012 Math 255 Section 006. Problem Set 7

Problem Set 7 1 a) Carry out the partials with respect to t and x, substitute and check b) Use separation of varibles, i.e. write as dx/x 2 = dt, integrate both sides and observe that the solution also

### Pick s Theorem and Lattice Point Geometry

Pick s Theorem and Lattice Point Geometry 1 Lattice Polygon Area Calculations Lattice points are points with integer coordinates in the x, y-plane. A lattice line segment is a line segment that has 2 distinct

### CS6841: Advanced Algorithms IIT Madras, Spring 2016 Lecture #1: Properties of LP Optimal Solutions + Machine Scheduling February 24, 2016

CS6841: Advanced Algorithms IIT Madras, Spring 2016 Lecture #1: Properties of LP Optimal Solutions + Machine Scheduling February 24, 2016 Lecturer: Ravishankar Krishnaswamy Scribe: Anand Kumar(CS15M010)

### Computational Methods. Constrained Optimization

Computational Methods Constrained Optimization Manfred Huber 2010 1 Constrained Optimization Unconstrained Optimization finds a minimum of a function under the assumption that the parameters can take on

### Polynomial-Time Approximation Algorithms

6.854 Advanced Algorithms Lecture 20: 10/27/2006 Lecturer: David Karger Scribes: Matt Doherty, John Nham, Sergiy Sidenko, David Schultz Polynomial-Time Approximation Algorithms NP-hard problems are a vast

### 1 The Traveling Salesperson Problem (TSP)

CS 598CSC: Approximation Algorithms Lecture date: January 23, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im In the previous lecture, we had a quick overview of several basic aspects of approximation

### Network Flows. 7. Multicommodity Flows Problems. Fall 2010 Instructor: Dr. Masoud Yaghini

In the name of God Network Flows 7. Multicommodity Flows Problems 7.2 Lagrangian Relaxation Approach Fall 2010 Instructor: Dr. Masoud Yaghini The multicommodity flow problem formulation: We associate nonnegative

### Math 233. Lagrange Multipliers Basics

Math 233. Lagrange Multipliers Basics Optimization problems of the form to optimize a function f(x, y, z) over a constraint g(x, y, z) = k can often be conveniently solved using the method of Lagrange

### EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 6

EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 6 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 19, 2012 Andre Tkacenko

### Optimization Methods: Optimization using Calculus Kuhn-Tucker Conditions 1. Module - 2 Lecture Notes 5. Kuhn-Tucker Conditions

Optimization Methods: Optimization using Calculus Kuhn-Tucker Conditions Module - Lecture Notes 5 Kuhn-Tucker Conditions Introduction In the previous lecture the optimization of functions of multiple variables

### 11. APPROXIMATION ALGORITHMS

Coping with NP-completeness 11. APPROXIMATION ALGORITHMS load balancing center selection pricing method: weighted vertex cover LP rounding: weighted vertex cover generalized load balancing knapsack problem

### Assignment 3b: The traveling salesman problem

Chalmers University of Technology MVE165 University of Gothenburg MMG631 Mathematical Sciences Linear and integer optimization Optimization with applications Emil Gustavsson Assignment information Ann-Brith

### COM Optimization for Communications Summary: Convex Sets and Convex Functions

1 Convex Sets Affine Sets COM524500 Optimization for Communications Summary: Convex Sets and Convex Functions A set C R n is said to be affine if A point x 1, x 2 C = θx 1 + (1 θ)x 2 C, θ R (1) y = k θ

### In what follows, we will focus on Voronoi diagrams in Euclidean space. Later, we will generalize to other distance spaces.

Voronoi Diagrams 4 A city builds a set of post offices, and now needs to determine which houses will be served by which office. It would be wasteful for a postman to go out of their way to make a delivery

### Introduction to Optimization Problems and Methods

Introduction to Optimization Problems and Methods wjch@umich.edu December 10, 2009 Outline 1 Linear Optimization Problem Simplex Method 2 3 Cutting Plane Method 4 Discrete Dynamic Programming Problem Simplex

### Network flows and Menger s theorem

Network flows and Menger s theorem Recall... Theorem (max flow, min cut strong duality). Let G be a network. The maximum value of a flow equals the minimum capacity of a cut. We prove this strong duality

### All lecture slides will be available at CSC2515_Winter15.html

CSC2515 Fall 2015 Introduc3on to Machine Learning Lecture 9: Support Vector Machines All lecture slides will be available at http://www.cs.toronto.edu/~urtasun/courses/csc2515/ CSC2515_Winter15.html Many