Linear Bilevel Programming With Upper Level Constraints Depending on the Lower Level Solution
|
|
- Candice Ruth Jenkins
- 5 years ago
- Views:
Transcription
1 Linear Bilevel Programming With Upper Level Constraints Depending on the Lower Level Solution Ayalew Getachew Mersha and Stephan Dempe October 17, 2005 Abstract Focus in the paper is on the definition of linear bilevel programming problems, the existence of optimal solutions and necessary as well as sufficient optimality conditions. In the papers [9] and [10] the authors claim to suggest a refined definition of linear bilevel programming problems and related optimality conditions. Mainly their attempt reduces to shifting upper level constraints involving both the upper and the lower level variables into the lower level. We investigate such a shift in more details and show that it is not allowed in general. We show that an optimal solution of the bilevel programm exists under the conditions in [10] if we add the assumption that the inducible region is not empty. The necessary optimality condition reduces to check optimality in one linear programming problem. Optimality of one feasible point for a certain number of linear programs implies optimality for the bilevel problem. 1 Introduction The bilevel programming problem is an optimization problem whose constraints are (in part) determined by an other optimization problem. In other words it is an hierarchical optimization problem consisting of two levels, the Department of Mathematics and Computer Science, Technical University Bergakademie Freiberg, Germany Department of Mathematics and Computer Science, Technical University Bergakademie Freiberg, Germany 1
2 first of which (the leader s level) is dominant over the other (the follower s one). The order of the play is very important. The choice of the dominant level limits or highly affects the choice or strategy of the lower level. Knowing the selection of the leader, the follower solves an ordinary parametric optimization problem. Anticipating the reaction of the follower the leader intends to find such values for his variables which together with the follower s reaction minimize his objective function. Hence, bilevel programming can be used to describe models for decision making situations where an hierarchy exists. Due to the hierarchical structure the bilevel programming problem is not convex and not differentiable. These problems have attainted large interest both from the theoretical as well as from the practical points of view, see [1], [2], [3] and the references therein. Bilevel programming problems are sensitive with respect to the addition of constraints to the lower level. Even the addition of a constraint which is not active at an optimal solution can change the problem drastically [7]. In this paper focus is on the shift of constraints between the upper and the lower level problems. Usually the position of constraints in the modelling phase depends strongly on the application under consideration. Problems with upper level constraints involving both the upper and the lower level variables (called connecting constraints in what follows) can arise e.g. if the leader is not willing (or able) to accept certain optimal solutions of the follower. This may be strongly related to the existence of multiple optimal lower level solutions or not. We will show, that the shift of such connecting constraints can change the problem essentially. This shows that the ideas in the papers [9] and [10] being essentially based on the shift of constraints violate the modelling procedure. Next we give conditions guaranteeing the existence of optimal solutions of the bilevel programming problem with connecting constraints (which is the main aim in [10]). The paper is then closed with optimality conditions for such problems thus generalizing (or correcting) the results in [9]. 2 Formulation of bilevel programming problems In this paper we follow mainly the definition given by Bard [1]: 2
3 min c 1 x + d 1 y x subject to (1) where y solves subject A 1 x + B 1 y b 1 to min y c 2 x + d 2 y A 2 x + B 2 y b 2, (2) where x R n, y R m, c 1, c 2 R n, d 1, d 2 R m, b 1 R p, b 2 R q. The only difference is the appearance of the quotation marks around the minimum operator in the upper level objective function. These are used to express certain ambiguity of the problem formulation in the case of nonunique lower level solutions. We will come back to this problem later. Based on these we get the following definitions (see [1]): 1. Constraint set of the problem M = {(x, y) : A 1 x + B 1 y b 1, A 2 x + B 2 y b 2 } 2. Feasible set for the follower for each x M(x) = {y : B 2 y b 2 A 2 x} 3. Projection of M onto the leader s decision space M(X) = {x : y, A 1 x + B 1 y b 1, A 2 x + B 2 y b 2 } 4. Follower rational reaction set for x M(X), Ψ L (x) = Argmin y 5. Inducible region {c 2 x + d 2 y : y M(x)} IR = {(x, y) : (x, y) M, y Ψ L (x)}. The inducible region is the most important object since it defines the feasible set at least in the case when the lower level problem has unique optimal solutions for all values of x. Then the quotation marks can be dropped. Note that the constraints A 2 x + B 2 y b 2 can be dropped in the set M since they are satisfied necessarily by an optimal solution y Ψ L (x) of problem (2). 3
4 Definition 1 Consider problem (1), (2) and assume that the rational reaction set of the follower consists of at most one point for all x M(X): Ψ L (x) 1 for all x M(X). Then, a point (x, y) IR is an optimal solution of problem (1), (2) if c 1 x + d 1 y c 1 x + d 1 y (x, y) IR. The situation is a little bit different in the case when the lower level problem can have multiple optimal solutions. The difficulty is due to an unclear value of the leader s objective function (and feasibility of the point (x, y)) prior to the publication of the optimal solution taken by the follower. If the leader has control over x only he is then not able to predict this value and hence he cannot find a best decision. There are mainly two ways out of this situation discussed in the literature: the optimistic (or weak) and the pessimistic (or strong) formulation of the bilevel programming problem, see e.g. [2],[4],[5]. The pessimistic formulation needs to be selected if the leader is not able to influence the follower in the sense that he can ask the follower to select one preferable solution out of Ψ L (x). Then, the leader is forced to protect himself against bad selections of the follower. But, if the leader can influence the follower s selection he is able to motivate the follower to select a point y Argmin {c 1 x + d 1 y : y Ψ L (x)}, y i.e. a best solution in Ψ L (x) from the leader s point of view. The resulting problem is equivalent to the following one provided this has an optimal solution [6]: min {c 1x + d 1 y : (x, y) IR}. (3) x,y Hence, we get the following definition of an optimal solution: Definition 2 Consider problem (1), (2) in the optimistic formulation, i.e. consider problem (3). Then, a point (x, y) IR is an optimal solution if c 1 x + d 1 y c 1 x + d 1 y (x, y) IR. The point (x, y) IR is a local optimal solution for (3) provided that this inequality is valid for all (x, y) IR sufficiently close to (x, y). This implies now that the problem with uniquely solvable lower level problems is a special case of the optimistic formulation and we need only to consider the last one when searching for sufficient conditions for the existence of an optimal solution. 4
5 3 Existence of optimal solution Consider the assumption A1: M is a nonempty compact set. Then we have the following lemma. Lemma 1 If A1 holds then the set IR is closed. Proof: Since M is not empty there is at least one parameter value x M(X) with M(x). By compactness, Ψ L (x). Consider a sequence {(x k, y k )} k=1 IR converging to (x, y). Then, by well-known results of linear parametric optimization [8], y Ψ L (x). Hence, (x, y) IR showing the proof. q.e.d. The same result has been shown e.g. in [1] under the additional assumption that the lower level problem has at most one optimal solution for all parameter values. Corollary 2 If assumption A1 is satisfied and there do not exist connecting constraints, then problem (1),(2) has an optimal solution. The proof follows from the Weierstraß Theorem since IR is a nonempty compact set in this case. The main idea in the papers [10] reduces to shifting connecting constraints to the lower level to get the existence of an optimal solution. They use the following example with the intention to motivate that the problem formulation (1),(2) is not correct. Example 1 Consider the following example subject to where y solves min x 0 x 8y 5x + 2y 33 x + 2y 9 subject to min y 0 y 7x + 3y 5 x + y 15. 5
6 Clearly M is a non-empty, compact set. But the bilevel problem has no solution since IR =. If we shift the upper level constraints to the lower level then M remains closed and bounded. Moreover, the resulting problem has solution. Therefore, from this example one can see that one needs more assumptions besides non-emptiness and compactness of M to guarantee the existence of a solution. Namely, Lemma 1 does not imply that the set IR =. A2: IR is non-empty. Lemma 3 If A1 and A2 are satisfied then IR is non-empty and is the finite union of compact polyhedral sets. The proof follows since the graph grph Ψ L ( ) of Ψ L ( ) is polyhedral [8] and IR is equal to the intersection of two polyhedral sets. Corollary 4 If A1 and A2 are satisfied and Ψ L (x) 1 for all x M(X), then IR describes a piecewise linear function. Corollary 5 If A1 and A2 are satisfied then IR is equal to the union of faces of the polyhedral set M. Theorem 6 If A1 and A2 are satisfied problem (3) has a solution. Proof: By Lemma 1, IR is closed and due to IR M it is also bounded. By A2 it is also not empty. Hence, problem (3) consists in minimizing a continuous function over a compact non-empty set, which implies the proof by Weierstraß s Theorem. q.e.d. However, unlike in the optimistic case the existence of a solution in the pessimistic case is generally not guaranteed even under the above assumptions [2]. 4 The effect of shifting constraints from one level to the other on the solution of BLP As we tried to indicate in the previous section, it is easy to see that the model may completely change if constraints are shifted from one level to the other. Different authors have already noticed this. See [1],[2] and others. 6
7 Figure 1: The problem with upper level connecting constraints. The feasible set IR is depicted in bold lines. Global optimal solution at point C, local optimal solution at point A. However, as we mentioned above recently [10] reported a result based on shifted constraints. The following simple example shows that the optimal solution of bilevel linear optimization problem may be not longer optimal if the constraints are shifted from one level to the other. Example 2 Consider the problem subject to where y solves subject to min x 2y x 2x 3y 12 x + y 14 min y y 3x + y 3 3x + y 30 The optimal solution for this problem is (x, y) = (8, 6) (see fig. 1). But if we shift the two upper level constraints to the lower level we get ( x, ỹ) = (6, 8) as an optimal solution (see fig. 2). So it is easy to see from this example that if we shift constraints from the upper level to the lower one, the optimal solution obtained prior to shifting is no more optimal. Hence ideas based on shifting constraints from one level to another will lead to a solution which may not be a solution prior to shifting constraints. 7
8 Figure 2: The problem without upper level connecting constraints. The feasible set IR is depicted in bold lines. Global optimal solution at point B. 5 Optimality Conditions The following lemma gives the necessary condition: Lemma 7 [1] [2] A necessary condition that (x, y ) solves the optimistic linear bilevel programming problem (3) locally is that there exists a vector λ such that (x, y, λ ) locally solves min c 1 x + d 1 y subject to A 1 x + B 1 y b 1 A 2 x + B 2 y b 2 B 2 λ + d 2 = 0 λ (b 2 A 2 x B 2 y) = 0 λ 0 (4) This result is a simple consequence from duality of linear programming (i.e. that the Karush-Kuhn-Tucker conditions are sufficient and necessary optimality conditions in linear programming). Moreover, this result is valid for all optimal solutions of the dual linear programming problem to (2). However, the opposite implication is not true in general if the optimal solution of the dual to (2) is not uniquely determined, cf. fig. 3. The reason for this is that new variables have been added to the optimistic bilevel programming problem (3). 8
9 The above problem can be investigated by decomposing it into a system which can be handled by linear programming. For this take any index set Ĩ with {i : λ i > 0} Ĩ {i : (A 2x + B 2 y b 2 ) i = 0} and consider min c 1 x + d 1 y subject to A 1 x + B 1 y b 1 A 2 x + B 2 y b 2 B 2 λ + d 2 = 0 (A 2 x + B 2 y b 2 ) i = 0, i Ĩ λ i = 0, i / Ĩ λ 0 (5) Here, the matrix (B 2 ) i Ĩ has full row rank. Then, if (x, y ) a local optimal solution of (3), (x, y, λ ) is a global optimal solution of (5). Now consider min c 1 x + d 1 y subject to A 1 x + B 1 y b 1 A 2 x + B 2 y b 2 (A 2 x + B 2 y b 2 ) i = 0, i Ĩ where the dual variable λ is a solution of (6) B 2 λ + d 2 = 0 λ i = 0, i / Ĩ (7) λ 0 with sets Ĩ D(x, y) := {I : λ 0, B T 2 λ + d 2 = 0, λ i = 0, i / I, (A 2 x + B 2 y b 2 ) i = 0, i I, (B 2 ) i Ĩ has full rank}. Then, if (x, y ) is a local optimal solution of (3), (x, y ) is an optimal solution of problem (6) for all Ĩ D(x, y ). Moreover, if (x, y ) is an optimal solution of (6) for all Ĩ D(x, y ) then (x, y ) is a local optimal solution of (3). Fig. 3 illustrates this. If (x, y, λ ) is a local optimal solution of problem (4) then each point (x, y, λ) in a sufficient small neighborhood of (x, y, λ ) cannot have a smaller objective function value. The neighborhood is shown in the left picture of fig. 3. By duality this neighborhood is associated to a facet of M corresponding to some part of IR (the part on the right-hand side of the point (x 0, y 0 )). The point (x 0, y 0 ) is the optimal solution of the problem (6) for the set I corresponding to λ 0. But, the point (x 0, y 0 ) is not optimal for (3). 9
10 Figure 3: Necessary optimality condition for MPEC is not sufficient for bilevel problem Theorem 8 The point (x, y ) is an optimal solution of the problem (3) if and only if it is an optimal solution of the problem (6) for all Ĩ D(x, y ). Proof: Since the Karush-Kuhn-Tucker conditions are necessary and sufficient optimality conditions for the lower level problem, local optimality of (x, y ) for the bilevel programming problem implies that (x, y, λ ) is an optimal solution for the problems (6) for each solution λ for (7). To show the if part of the theorem assume that (x, y ) IR is not an optimal solution of (3). Then there exists a sequence {(x n, y n )} converging to (x, y ) with (x n, y n ) IR, c 1 x n + d 1 y n < c 1 x + d 1 y for all n. Since (x n, y n ) IR, A 1 x n + B 1 y n b 1, y n Ψ(x n ), i.e λ n 0, B 2 λ n + d 2 = 0, λ n (b 2 A 2 x n B 2 y n ) = 0. Here, λ n can be taken as vertex of {λ 0 : B 2 λ + d 2 = 0, λ T (b 2 A 2 x n B 2 y n ) = 0.} Hence also as a vertex of {λ 0 : B 2 λ + d 2 = 0, λ i = 0, for i / I n } 10
11 for some set I n satisfying (b 2 A 2 x n B 2 y n ) i = 0, i I n. Since the number of different sets I {1, 2,...q} is finite there exists an infinite subsequence of {(x n, y n, λ n )} with λ n is a vertex of {λ 0 : B 2 λ + d 2 = 0, λ i = 0, for i / Î} for a fixed set Î satisfying (b 2 A 2 x B 2 y ) i = 0, i I for all n. This means that Î D(x, y ). This shows that (x, y ) can not an optimal solution of (6) for this set Î. q.e.d. 6 Conclusion In this paper we have discussed conditions under which the existence of an optimal solution of the linear bilevel programming problem is guaranteed. If the optimistic case is considered and the inducible region IR is not empty and compact an optimal solution of the bilevel programming problem exists. Ideas being based on shifting constraints between the upper and the lower level problems violate the modelling procedure. One example illustrates this fact is given in this paper. Necessary and sufficient optimality condition are derived using the Karush-Kuhn-Tucker reformulation of the optimistic bilevel programming problem. References [1] J.F. Bard. Practical Bilevel Optimization: Algorithms and Applications. Kluwer Academic Publishers, Dordrecht, [2] S. Dempe. Foundations of Bilevel Programming. Kluwer Academie Publishers, Dordrecht, [3] S. Dempe. Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization, 52: , [4] P. Loridan and J. Morgan. Least-norm regularization for weak two-level optimization problems. In Optimization, Optimal Control and Partial Differential Equations, volume 107 of International Series of Numerical Mathematics, pages Birkhäuser Verlag, Basel, [5] P. Loridan and J. Morgan. Weak via strong Stackelberg problem: New results. Journal of Global Optimization, 8: ,
12 [6] B. Luderer. Über der Äquivalenz nichtlinearer Optimierungsaufgaben. Wissenschaftliche Zeitschrift der TH Karl-MarxStadt, 26: , [7] C.M. Macal and A.P. Hurter. Dependence of bilevel mathematical programs on irrelevant constraints. 24: , [8] F. Nožička, J. Guddat, H. Hollatz, and B. Bank. Theorie der linearen parametrischen Optimierung. Akademie-Verlag, [9] C. Shi, G. Zhang, and J. Lu. An extended Kuhn-Tucker approach for linear bilevel programming. Appl. Math. Comput., 162:51 63, [10] C. Shi, G. Zhang, and J. Lu. On the definition of linear bilevel programming solution. Appl. Math. Comput., 160: ,
Pessimistic bilevel linear optimization
Pessimistic bilevel linear optimization S. Dempe, G. Luo 2, S. Franke. TU Bergakademie Freiberg, Germany, Institute of Numerical Mathematics and Optimization 2. Guangdong University of Finance, China,
More informationPessimistic Bilevel Linear Optimization
Journal of Nepal Mathematical Society (JNMS), Vol., Issue (208); S. Dempe, G. Luo, S. Franke S. Dempe, G. Luo 2, S. Franke 3 TU Bergakademie Freiberg, Germany, Institute of Numerical Mathematics and Optimization
More informationPreprint Stephan Dempe, Alina Ruziyeva The Karush-Kuhn-Tucker optimality conditions in fuzzy optimization ISSN
Fakultät für Mathematik und Informatik Preprint 2010-06 Stephan Dempe, Alina Ruziyeva The Karush-Kuhn-Tucker optimality conditions in fuzzy optimization ISSN 1433-9307 Stephan Dempe, Alina Ruziyeva The
More informationAn Introduction to Bilevel Programming
An Introduction to Bilevel Programming Chris Fricke Department of Mathematics and Statistics University of Melbourne Outline What is Bilevel Programming? Origins of Bilevel Programming. Some Properties
More informationMath 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).........................
More informationA Note on Smoothing Mathematical Programs with Equilibrium Constraints
Applied Mathematical Sciences, Vol. 3, 2009, no. 39, 1943-1956 A Note on Smoothing Mathematical Programs with Equilibrium Constraints M. A. Tawhid Department of Mathematics and Statistics School of Advanced
More informationInteger Programming Theory
Integer Programming Theory Laura Galli October 24, 2016 In the following we assume all functions are linear, hence we often drop the term linear. In discrete optimization, we seek to find a solution x
More informationGraphs that have the feasible bases of a given linear
Algorithmic Operations Research Vol.1 (2006) 46 51 Simplex Adjacency Graphs in Linear Optimization Gerard Sierksma and Gert A. Tijssen University of Groningen, Faculty of Economics, P.O. Box 800, 9700
More informationCombined Reformulation of Bilevel Programming Problems
Schedae Informaticae Vol. 21 (2012): 65 79 doi: 10.4467/20838476SI.12.005.0815 Combined Reformulation of Bilevel Programming Problems Maria Pilecka Department of Mathematics and Computer Science, TU Bergakademie
More informationLecture 5: Duality Theory
Lecture 5: Duality Theory Rajat Mittal IIT Kanpur The objective of this lecture note will be to learn duality theory of linear programming. We are planning to answer following questions. What are hyperplane
More informationMathematical and Algorithmic Foundations Linear Programming and Matchings
Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis
More information11 Linear Programming
11 Linear Programming 11.1 Definition and Importance The final topic in this course is Linear Programming. We say that a problem is an instance of linear programming when it can be effectively expressed
More information1. Lecture notes on bipartite matching February 4th,
1. Lecture notes on bipartite matching February 4th, 2015 6 1.1.1 Hall s Theorem Hall s theorem gives a necessary and sufficient condition for a bipartite graph to have a matching which saturates (or matches)
More informationBilinear 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
More informationStability of closedness of convex cones under linear mappings
Stability of closedness of convex cones under linear mappings Jonathan M. Borwein and Warren B. Moors 1 Abstract. In this paper we reconsider the question of when the continuous linear image of a closed
More informationCS522: Advanced Algorithms
Lecture 1 CS5: Advanced Algorithms October 4, 004 Lecturer: Kamal Jain Notes: Chris Re 1.1 Plan for the week Figure 1.1: Plan for the week The underlined tools, weak duality theorem and complimentary slackness,
More informationGate Sizing by Lagrangian Relaxation Revisited
Gate Sizing by Lagrangian Relaxation Revisited Jia Wang, Debasish Das, and Hai Zhou Electrical Engineering and Computer Science Northwestern University Evanston, Illinois, United States October 17, 2007
More informationConvexity: 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
More informationAlgorithms for finding the minimum cycle mean in the weighted directed graph
Computer Science Journal of Moldova, vol.6, no.1(16), 1998 Algorithms for finding the minimum cycle mean in the weighted directed graph D. Lozovanu C. Petic Abstract In this paper we study the problem
More informationDM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini
DM545 Linear and Integer Programming Lecture 2 The Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. 4. Standard Form Basic Feasible Solutions
More informationCollege of Computer & Information Science Fall 2007 Northeastern University 14 September 2007
College of Computer & Information Science Fall 2007 Northeastern University 14 September 2007 CS G399: Algorithmic Power Tools I Scribe: Eric Robinson Lecture Outline: Linear Programming: Vertex Definitions
More informationarxiv: v3 [math.oc] 3 Nov 2016
BILEVEL POLYNOMIAL PROGRAMS AND SEMIDEFINITE RELAXATION METHODS arxiv:1508.06985v3 [math.oc] 3 Nov 2016 JIAWANG NIE, LI WANG, AND JANE J. YE Abstract. A bilevel program is an optimization problem whose
More informationAn Exact Penalty Function Approach for Solving the Linear Bilevel Multiobjective Programming Problem
Filomat 29:4 (2015), 773 779 DOI 10.2298/FIL1504773L Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat An Exact Penalty Function
More informationAdvanced Operations Research Techniques IE316. Quiz 2 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 2 Review Dr. Ted Ralphs IE316 Quiz 2 Review 1 Reading for The Quiz Material covered in detail in lecture Bertsimas 4.1-4.5, 4.8, 5.1-5.5, 6.1-6.3 Material
More informationThe Branch-and-Sandwich Algorithm for Mixed-Integer Nonlinear Bilevel Problems
The Branch-and-Sandwich Algorithm for Mixed-Integer Nonlinear Bilevel Problems Polyxeni-M. Kleniati and Claire S. Adjiman MINLP Workshop June 2, 204, CMU Funding Bodies EPSRC & LEVERHULME TRUST OUTLINE
More informationBounded subsets of topological vector spaces
Chapter 2 Bounded subsets of topological vector spaces In this chapter we will study the notion of bounded set in any t.v.s. and analyzing some properties which will be useful in the following and especially
More information3 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
More information1. Lecture notes on bipartite matching
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans February 5, 2017 1. Lecture notes on bipartite matching Matching problems are among the fundamental problems in
More informationDivision 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
More informationA Little Point Set Topology
A Little Point Set Topology A topological space is a generalization of a metric space that allows one to talk about limits, convergence, continuity and so on without requiring the concept of a distance
More informationFACES OF CONVEX SETS
FACES OF CONVEX SETS VERA ROSHCHINA Abstract. We remind the basic definitions of faces of convex sets and their basic properties. For more details see the classic references [1, 2] and [4] for polytopes.
More informationLinear & Conic Programming Reformulations of Two-Stage Robust Linear Programs
1 / 34 Linear & Conic Programming Reformulations of Two-Stage Robust Linear Programs Erick Delage CRC in decision making under uncertainty Department of Decision Sciences HEC Montreal (joint work with
More informationComputation of the Constrained Infinite Time Linear Quadratic Optimal Control Problem
Computation of the Constrained Infinite Time Linear Quadratic Optimal Control Problem July 5, Introduction Abstract Problem Statement and Properties In this paper we will consider discrete-time linear
More informationFace Width and Graph Embeddings of face-width 2 and 3
Face Width and Graph Embeddings of face-width 2 and 3 Instructor: Robin Thomas Scribe: Amanda Pascoe 3/12/07 and 3/14/07 1 Representativity Recall the following: Definition 2. Let Σ be a surface, G a graph,
More informationSubmodularity Reading Group. Matroid Polytopes, Polymatroid. M. Pawan Kumar
Submodularity Reading Group Matroid Polytopes, Polymatroid M. Pawan Kumar http://www.robots.ox.ac.uk/~oval/ Outline Linear Programming Matroid Polytopes Polymatroid Polyhedron Ax b A : m x n matrix b:
More informationConvex Geometry arising in Optimization
Convex Geometry arising in Optimization Jesús A. De Loera University of California, Davis Berlin Mathematical School Summer 2015 WHAT IS THIS COURSE ABOUT? Combinatorial Convexity and Optimization PLAN
More informationCS675: Convex and Combinatorial Optimization Spring 2018 Consequences of the Ellipsoid Algorithm. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Spring 2018 Consequences of the Ellipsoid Algorithm Instructor: Shaddin Dughmi Outline 1 Recapping the Ellipsoid Method 2 Complexity of Convex Optimization
More information2 A topological interlude
2 A topological interlude 2.1 Topological spaces Recall that a topological space is a set X with a topology: a collection T of subsets of X, known as open sets, such that and X are open, and finite intersections
More informationIntroduction 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
More informationarxiv: v1 [math.co] 15 Dec 2009
ANOTHER PROOF OF THE FACT THAT POLYHEDRAL CONES ARE FINITELY GENERATED arxiv:092.2927v [math.co] 5 Dec 2009 VOLKER KAIBEL Abstract. In this note, we work out a simple inductive proof showing that every
More informationTwo Characterizations of Hypercubes
Two Characterizations of Hypercubes Juhani Nieminen, Matti Peltola and Pasi Ruotsalainen Department of Mathematics, University of Oulu University of Oulu, Faculty of Technology, Mathematics Division, P.O.
More informationIn 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}
More informationLecture 2 September 3
EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give
More informationResearch Interests Optimization:
Mitchell: Research interests 1 Research Interests Optimization: looking for the best solution from among a number of candidates. Prototypical optimization problem: min f(x) subject to g(x) 0 x X IR n Here,
More informationSection 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
More information1 Inference for Boolean theories
Scribe notes on the class discussion on consistency methods for boolean theories, row convex constraints and linear inequalities (Section 8.3 to 8.6) Speaker: Eric Moss Scribe: Anagh Lal Corrector: Chen
More informationarxiv: v1 [math.co] 27 Feb 2015
Mode Poset Probability Polytopes Guido Montúfar 1 and Johannes Rauh 2 arxiv:1503.00572v1 [math.co] 27 Feb 2015 1 Max Planck Institute for Mathematics in the Sciences, Inselstraße 22, 04103 Leipzig, Germany,
More informationarxiv: v2 [math.co] 23 Jan 2018
CONNECTIVITY OF CUBICAL POLYTOPES HOA THI BUI, GUILLERMO PINEDA-VILLAVICENCIO, AND JULIEN UGON arxiv:1801.06747v2 [math.co] 23 Jan 2018 Abstract. A cubical polytope is a polytope with all its facets being
More informationLecture 2 - Introduction to Polytopes
Lecture 2 - Introduction to Polytopes Optimization and Approximation - ENS M1 Nicolas Bousquet 1 Reminder of Linear Algebra definitions Let x 1,..., x m be points in R n and λ 1,..., λ m be real numbers.
More informationLagrangian Relaxation: An overview
Discrete Math for Bioinformatics WS 11/12:, by A. Bockmayr/K. Reinert, 22. Januar 2013, 13:27 4001 Lagrangian Relaxation: An overview Sources for this lecture: D. Bertsimas and J. Tsitsiklis: Introduction
More informationFully discrete Finite Element Approximations of Semilinear Parabolic Equations in a Nonconvex Polygon
Fully discrete Finite Element Approximations of Semilinear Parabolic Equations in a Nonconvex Polygon Tamal Pramanick 1,a) 1 Department of Mathematics, Indian Institute of Technology Guwahati, Guwahati
More informationNew optimality conditions for the semivectorial bilevel optimization problem
New optimality conditions for the semivectorial bilevel optimization problem November 3, 2011 STEPHAN DEMPE 1, NAZIH GADHI 2 and ALAIN B. ZEMKOHO 1 Abstract. The paper is concerned with the optimistic
More information2. Optimization problems 6
6 2.1 Examples... 7... 8 2.3 Convex sets and functions... 9 2.4 Convex optimization problems... 10 2.1 Examples 7-1 An (NP-) optimization problem P 0 is defined as follows Each instance I P 0 has a feasibility
More informationLinear 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
More informationEfficient Evolutionary Algorithm for Single-Objective Bilevel Optimization
Efficient Evolutionary Algorithm for Single-Objective Bilevel Optimization Ankur Sinha, Pekka Malo Dept. of Information and Service Economy Aalto University School of Business, Finland Firstname.Lastname@aalto.fi
More informationOPERATIONS 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
More informationConsistency and Set Intersection
Consistency and Set Intersection Yuanlin Zhang and Roland H.C. Yap National University of Singapore 3 Science Drive 2, Singapore {zhangyl,ryap}@comp.nus.edu.sg Abstract We propose a new framework to study
More informationPowered by TCPDF (
Powered by TCPDF (www.tcpdf.org) Title ON HICKS' COMPOSITE COMMODITY THEOREM Sub Title Author 長名, 寛明 (OSANA, Hiroaki) Publisher Keio Economic Society, Keio University Publication year 1982 Jtitle Keio
More informationLinear Programming Duality and Algorithms
COMPSCI 330: Design and Analysis of Algorithms 4/5/2016 and 4/7/2016 Linear Programming Duality and Algorithms Lecturer: Debmalya Panigrahi Scribe: Tianqi Song 1 Overview In this lecture, we will cover
More informationCrossing Families. Abstract
Crossing Families Boris Aronov 1, Paul Erdős 2, Wayne Goddard 3, Daniel J. Kleitman 3, Michael Klugerman 3, János Pach 2,4, Leonard J. Schulman 3 Abstract Given a set of points in the plane, a crossing
More informationLecture Notes 2: The Simplex Algorithm
Algorithmic Methods 25/10/2010 Lecture Notes 2: The Simplex Algorithm Professor: Yossi Azar Scribe:Kiril Solovey 1 Introduction In this lecture we will present the Simplex algorithm, finish some unresolved
More informationLecture 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
More informationVertex 3-colorability of claw-free graphs
Algorithmic Operations Research Vol.2 (27) 5 2 Vertex 3-colorability of claw-free graphs Marcin Kamiński a Vadim Lozin a a RUTCOR - Rutgers University Center for Operations Research, 64 Bartholomew Road,
More informationDual-fitting analysis of Greedy for Set Cover
Dual-fitting analysis of Greedy for Set Cover We showed earlier that the greedy algorithm for set cover gives a H n approximation We will show that greedy produces a solution of cost at most H n OPT LP
More informationOn Covering a Graph Optimally with Induced Subgraphs
On Covering a Graph Optimally with Induced Subgraphs Shripad Thite April 1, 006 Abstract We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number
More informationREVIEW OF FUZZY SETS
REVIEW OF FUZZY SETS CONNER HANSEN 1. Introduction L. A. Zadeh s paper Fuzzy Sets* [1] introduces the concept of a fuzzy set, provides definitions for various fuzzy set operations, and proves several properties
More informationLecture 6: Faces, Facets
IE 511: Integer Programming, Spring 2019 31 Jan, 2019 Lecturer: Karthik Chandrasekaran Lecture 6: Faces, Facets Scribe: Setareh Taki Disclaimer: These notes have not been subjected to the usual scrutiny
More informationConvex Optimization. Lijun Zhang Modification of
Convex Optimization Lijun Zhang zlj@nju.edu.cn http://cs.nju.edu.cn/zlj Modification of http://stanford.edu/~boyd/cvxbook/bv_cvxslides.pdf Outline Introduction Convex Sets & Functions Convex Optimization
More informationLinear Programming and its Applications
Linear Programming and its Applications Outline for Today What is linear programming (LP)? Examples Formal definition Geometric intuition Why is LP useful? A first look at LP algorithms Duality Linear
More informationGeneral properties of staircase and convex dual feasible functions
General properties of staircase and convex dual feasible functions JÜRGEN RIETZ, CLÁUDIO ALVES, J. M. VALÉRIO de CARVALHO Centro de Investigação Algoritmi da Universidade do Minho, Escola de Engenharia
More informationBILEVEL PROGRAMMING - A SURVEY
Chapter 1 BILEVEL PROGRAMMING - A SURVEY Stephan Dempe Technical University Bergakademie Freiberg, Germany dempe@math.tu-freiberg.de Abstract Bilevel programming problems are hierarchical optimization
More informationOn the null space of a Colin de Verdière matrix
On the null space of a Colin de Verdière matrix László Lovász 1 and Alexander Schrijver 2 Dedicated to the memory of François Jaeger Abstract. Let G = (V, E) be a 3-connected planar graph, with V = {1,...,
More informationProgramming, numerics and optimization
Programming, numerics and optimization Lecture C-4: Constrained optimization Łukasz Jankowski ljank@ippt.pan.pl Institute of Fundamental Technological Research Room 4.32, Phone +22.8261281 ext. 428 June
More informationLinear Programming in Small Dimensions
Linear Programming in Small Dimensions Lekcija 7 sergio.cabello@fmf.uni-lj.si FMF Univerza v Ljubljani Edited from slides by Antoine Vigneron Outline linear programming, motivation and definition one dimensional
More information1 Linear programming relaxation
Cornell University, Fall 2010 CS 6820: Algorithms Lecture notes: Primal-dual min-cost bipartite matching August 27 30 1 Linear programming relaxation Recall that in the bipartite minimum-cost perfect matching
More informationNew Penalty Approaches for Bilevel Optimization Problems arising in Transportation Network Design
New Penalty Approaches for Bilevel Optimization Problems arising in Transportation Network Design Jörg Fliege, Konstantinos Kaparis, & Huifu Xu Melbourne, 2013 Contents 1 Problem Statement 2 A Slight Detour:
More informationGeneralized Nash Equilibrium Problem: existence, uniqueness and
Generalized Nash Equilibrium Problem: existence, uniqueness and reformulations Univ. de Perpignan, France CIMPA-UNESCO school, Delhi November 25 - December 6, 2013 Outline of the 7 lectures Generalized
More informationAdvanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material
More informationA Reduction of Conway s Thrackle Conjecture
A Reduction of Conway s Thrackle Conjecture Wei Li, Karen Daniels, and Konstantin Rybnikov Department of Computer Science and Department of Mathematical Sciences University of Massachusetts, Lowell 01854
More informationParameterization. Michael S. Floater. November 10, 2011
Parameterization Michael S. Floater November 10, 2011 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to generate from point
More informationLATIN SQUARES AND THEIR APPLICATION TO THE FEASIBLE SET FOR ASSIGNMENT PROBLEMS
LATIN SQUARES AND THEIR APPLICATION TO THE FEASIBLE SET FOR ASSIGNMENT PROBLEMS TIMOTHY L. VIS Abstract. A significant problem in finite optimization is the assignment problem. In essence, the assignment
More informationAn FPTAS for minimizing the product of two non-negative linear cost functions
Math. Program., Ser. A DOI 10.1007/s10107-009-0287-4 SHORT COMMUNICATION An FPTAS for minimizing the product of two non-negative linear cost functions Vineet Goyal Latife Genc-Kaya R. Ravi Received: 2
More informationApplied Lagrange Duality for Constrained Optimization
Applied Lagrange Duality for Constrained Optimization Robert M. Freund February 10, 2004 c 2004 Massachusetts Institute of Technology. 1 1 Overview The Practical Importance of Duality Review of Convexity
More informationMatching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.
18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have
More informationShannon Switching Game
EECS 495: Combinatorial Optimization Lecture 1 Shannon s Switching Game Shannon Switching Game In the Shannon switching game, two players, Join and Cut, alternate choosing edges on a graph G. Join s objective
More informationarxiv: v1 [math.co] 7 Dec 2018
SEQUENTIALLY EMBEDDABLE GRAPHS JACKSON AUTRY AND CHRISTOPHER O NEILL arxiv:1812.02904v1 [math.co] 7 Dec 2018 Abstract. We call a (not necessarily planar) embedding of a graph G in the plane sequential
More informationLecture 4 Duality and Decomposition Techniques
Lecture 4 Duality and Decomposition Techniques Jie Lu (jielu@kth.se) Richard Combes Alexandre Proutiere Automatic Control, KTH September 19, 2013 Consider the primal problem Lagrange Duality Lagrangian
More informationOn the number of distinct directions of planes determined by n points in R 3
On the number of distinct directions of planes determined by n points in R 3 Rom Pinchasi August 27, 2007 Abstract We show that any set of n points in R 3, that is not contained in a plane, determines
More information2 The Fractional Chromatic Gap
C 1 11 2 The Fractional Chromatic Gap As previously noted, for any finite graph. This result follows from the strong duality of linear programs. Since there is no such duality result for infinite linear
More informationGlobal Minimization via Piecewise-Linear Underestimation
Journal of Global Optimization,, 1 9 (2004) c 2004 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Global Minimization via Piecewise-Linear Underestimation O. L. MANGASARIAN olvi@cs.wisc.edu
More informationIntroduction to optimization
Introduction to optimization G. Ferrari Trecate Dipartimento di Ingegneria Industriale e dell Informazione Università degli Studi di Pavia Industrial Automation Ferrari Trecate (DIS) Optimization Industrial
More information4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 Mathematical programming (optimization) problem: min f (x) s.t. x X R n set of feasible solutions with linear objective function
More informationLower estimate of the square-to-linear ratio for regular Peano curves
DOI 10.1515/dma-2014-0012 Discrete Math. Appl. 2014; 24 (3):123 12 Konstantin E. Bauman Lower estimate of the square-to-linear ratio for regular Peano curves Abstract: We prove that the square-to-linear
More information12.1 Formulation of General Perfect Matching
CSC5160: Combinatorial Optimization and Approximation Algorithms Topic: Perfect Matching Polytope Date: 22/02/2008 Lecturer: Lap Chi Lau Scribe: Yuk Hei Chan, Ling Ding and Xiaobing Wu In this lecture,
More informationmaximize c, x subject to Ax b,
Lecture 8 Linear programming is about problems of the form maximize c, x subject to Ax b, where A R m n, x R n, c R n, and b R m, and the inequality sign means inequality in each row. The feasible set
More informationMathematical 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
More informationOptimality 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 May 10, 2017 Abstract We consider the problem of minimizing
More informationIn this lecture, we ll look at applications of duality to three problems:
Lecture 7 Duality Applications (Part II) In this lecture, we ll look at applications of duality to three problems: 1. Finding maximum spanning trees (MST). We know that Kruskal s algorithm finds this,
More informationarxiv: v1 [math.na] 20 Sep 2016
arxiv:1609.06236v1 [math.na] 20 Sep 2016 A Local Mesh Modification Strategy for Interface Problems with Application to Shape and Topology Optimization P. Gangl 1,2 and U. Langer 3 1 Doctoral Program Comp.
More information1.1 What is Microeconomics?
1.1 What is Microeconomics? Economics is the study of allocating limited resources to satisfy unlimited wants. Such a tension implies tradeoffs among competing goals. The analysis can be carried out at
More information