Algorithms and Data Structures 2014 Exercises and Solutions Week 14
|
|
- Tabitha Rodgers
- 5 years ago
- Views:
Transcription
1 lgorithms and ata tructures 0 xercises and s Week Linear programming. onsider the following linear program. maximize x y 0 x + y 7 x x 0 y 0 x + 3y Plot the feasible region and identify the optimal solution. Just for checking: x = and y =.. cargo plane can carry a maximum weight of 00 tons and a maximum olume of 0 cubic meters. here are three materials to be transported, and the cargo company may choose to carry any amount of each, upto the maximum aailable limits gien below. Material has density tons/cubic meter, maximum aailable amount 0 cubic meters, and reenue e.000 per cubic meter. Material has density tons/cubic meter, maximum aailable amount 30 cubic meters, and reenue e.00 per cubic meter. Material 3 has density 3 tons/cubic meter, maximum aailable amount 0 cubic meters, and reenue e.000 per cubic meter. Write a linear program that optimizes reenue within the constraints. We introduce ariables,, and 3 representing the olumes of the respectie materials. he requested linear program is then gien by maximize ,, You are gien the following points (x i, y i ) in the plane: (, 3), (, ), (3, 7), (, ), (7, ), (8, ), (0, 9). uppose you want to determine a line ax + by = c that approximately passes through these points (it might not contain all the points). Write a linear program to find a line that minimizes the maximum absolute error, being max ax i + by i c 0<i 7
2 We introduce a ariable z to replace the formula max 0<i 7 ax i + by i c. It remains to constrain z such that z = max 0<i 7 ax i + by i c. ince we are minimizing z, it is sufficient to hae z max 0<i 7 ax i + by i c, which is equialent to the requirements z ax i + by i c for 0 < i 7. o get rid of the absolute alues, we split each of those requirements into z ax i + by i c and z ax i by i + c. Note that because z is greater than certain absolute alues, we can add the restriction z 0 without affecting the solution. In standard form, the linear program is gien by maximize z z + x i a + y i b c 0 0<i 7 z + x i a + y i b c 0 0<i 7 a, b, c, z 0.. he following figure shows a graph with four nodes on the left representing boys and four nodes on the right representing girls. here is an edge between a boy and girl if they like each other (for instance, l likes all the girls). his kind of graph, in which the nodes can be partitioned into two groups such that all edges are between the groups, is called bipartite. Is it possible to choose couples so that eeryone has exactly one partner? In graph-theoretic jargon, is there a perfect matching? Write a linear program that soles the matching problem. We turn the graph into a directed graph, choosing to direct the edges towards the girls. urthermore, we add nodes s and t to the graph with for eery boy an edge from s to that boy and for eery girl an edge from that girl to t. or all nodes i and j, we hae a constant c ij that is 0 if there is no edge and if there is an edge from i to j. inally, we introduce ariables f ij for all nodes i and j. he problem has turned into a maximum flow problem (after soling it as such, we simply check if the size of the flow equals the number of boys), where s is the source node, t the sink node, c the capacities and f the flow. hus, the problem can be modelled by a linear program as explained during the lecture.. In the last lecture, we saw the single-source-single-target shortest path problem being formulated as a linear maximization problem. lternatiely, one can derie the following dual minimization ariant: minimize x u w(u, ) (u,) Here, x u = if the edge (u, ) is part of the shortest path, and x u = 0, otherwise. Write down the corresponding constraints. he constraints are x s x s = x t x t =
3 and, for all w / {s, t}, x w x w = 0. Here s is the source node and t is the target node. o make this a linear problem, we need to replace the assertion x u {0, } for all u and by x u 0. Note that there may now be solutions with non-integer alues for some x u. his means that the flow is diided oer multiple paths between certain nodes, but because of the minimization it can only be diided if these paths hae the same length. hus, any path along which all x u are nonzero will be a shortest path.. onert the following linear program into standard form: minimize x + 7x + x 3 x x 3 = 7 3x + x x 0 x 3 0 We first switch from minimization to maximization by multiplying the objectie function by. Now obsere that x has no nonnegatiity constraint, so we replace it by x x. he same goes for x 3, but we can exploit the x 3 0 constraint to simply replace x 3 by x 3. Now we replace the equality constraint. maximize x + x 7x + x 3 x x + x 3 = 7 3x 3x + x x, x, x, x 3 0 maximize x + x 7x + x 3 x x + x 3 7 x x + x 3 7 3x 3x + x x, x, x, x 3 0 inally, we fix the constraints with opposite signs. maximize x + x 7x + x 3 x + x x 3 7 x x + x 3 7 3x + 3x x x, x, x, x onert the following linear program into slack form: maximize x x 3 x + x x 3 7 3x x 8 x + x + x 3 0 x, x, x 3 0
4 What are the basic and nonbasic ariables? irst we conert to standard form. maximize x x 3 x + x x 3 7 3x + x 8 x x x 3 0 x, x, x 3 0 Now we introduce slack ariables x, x, and x and display the program in slack form. z = x x 3 x = 7 x x + x 3 x = 8 + 3x x x = x + x + x 3 hose are the basic ariables. he nonbasic ariables are x, x, and x ole the following linear program using IMPLX maximize 8x +.x x + x 0 x x x, x 0 We first conert to slack form. z = 8x +.x x 3 = 0 x x x = x x = x he ariable x has a positie coefficient in the objectie function. With respect to x, the second constraint is the most restrictie. hus, we substitute x using x = x. z = +.x 8x x 3 = 8 x + x x = x x = x he ariable x has a positie coefficient in the new objectie function, and now the first constraint is the most restrictie. We replace it by x = 8 x 3 + x and substitute x eerywhere else. z = 3.x 3.x x = 8 x 3 + x x = x x = 8 + x 3 x Now all coefficients are negatie, so the basic solution, with x = and x = 8, is optimal.
5 9. or the following network, with edge capacities as shown, find the maximum flow from to, along with a matching cut cut partitions the ertices of a graph into two disjoint subsets, say L and R. he capacity of a cut is the total capacity of the edges from L to R. cut is said to match a flow if the size of the flow is equal to the capacity of the cut. follows. ending a flow of oer the path (,,,, ), the residual graph is as possible choice of the rest of the paths is shown below, along with the additional flow each path admits and the final residual graph that results from all this. Path low (,,,,, ) (,,,, ) (,,, ) (,,,,, ) ogether, the size of the flow is 3. matching cut can be found by taking for L the nodes that in the final residual graph can be reached from, i.e., L = {,, }. 9 3
Network Flow Problems Luis Goddyn, Math 408
Network Flow Problems Luis Goddyn, Math 48 Let D = (V, A) be a directed graph, and let s, t V (D). For S V we write δ + (S) = {u A : u S, S} and δ (S) = {u A : u S, S} for the in-arcs and out-arcs of S
More informationAlgorithms Demands and Bounds. Demands and Bounds. Design and Analysis of Algorithms Andrei Bulatov
Algorithms Demands and Bounds Demands and Bounds Design and Analysis of Algorithms Andrei Bulato Algorithms Demands and Bounds 1- Demands In our flow network model there is only 1 source and sink Can we
More informationMath Mathematical Notation
Math 160 - Mathematical Notation Purpose One goal in any course is to properly use the language of that subject. Finite Mathematics is no different and may often seem like a foreign language. These notations
More informationTheory of Network Communication
Theory of Network Communication Dr. Christian Scheideler Johns Hopkins Uniersity, Sept. 9 2002 Introduction The goal of this lecture is to gie an introduction to the state of the art in the theory of network
More informationA spectral Turán theorem
A spectral Turán theorem Fan Chung Abstract If all nonzero eigenalues of the (normalized) Laplacian of a graph G are close to, then G is t-turán in the sense that any subgraph of G containing no K t+ contains
More informationLecture 1. 1 Overview. 2 Maximum Flow. COMPSCI 532: Design and Analysis of Algorithms August 26, 2015
COMPSCI 532: Design and Analysis of Algorithms August 26, 205 Lecture Lecturer: Debmalya Panigrahi Scribe: Allen Xiao Oeriew In this lecture, we will define the maximum flow problem and discuss two algorithms
More informationNP and NP-Completeness
0/2/206 Algorithms NP-Completeness 7- Algorithms NP-Completeness 7-2 Efficient Certification NP and NP-Completeness By a solution of a decision problem X we understand a certificate witnessing that an
More informationThe Budgeted Minimum Cost Flow Problem with Unit Upgrading Cost
The Budgeted Minimum Cost Flow Problem with Unit Upgrading Cost Christina Büsing Sarah Kirchner Arie Koster Annika Thome October 6, 2015 Abstract The budgeted minimum cost flow problem (BMCF(K)) with unit
More informationA Regularization Framework for Learning from Graph Data
A Regularization Framework for Learning from Graph Data Dengyong Zhou Max Planck Institute for Biological Cybernetics Spemannstr. 38, 7076 Tuebingen, Germany Bernhard Schölkopf Max Planck Institute for
More informationMath 20C. Lecture Examples.
Math 20C. Lecture Eamples. (8//08) Section 2.. Vectors in the plane Definition A ector represents a nonnegatie number and, if the number is not zero, a direction. The number associated ith the ector is
More informationUnit 11: Vectors in the Plane
135 Unit 11: Vectors in the Plane Vectors in the Plane The term ector is used to indicate a quantity (such as force or elocity) that has both length and direction. For instance, suppose a particle moes
More informationSection 6: PRISMATIC BEAMS. Beam Theory
Beam Theory There are two types of beam theory aailable to craft beam element formulations from. They are Bernoulli-Euler beam theory Timoshenko beam theory One learns the details of Bernoulli-Euler beam
More informationLect-19. In this lecture...
19 1 In this lecture... Helmholtz and Gibb s functions Legendre transformations Thermodynamic potentials The Maxwell relations The ideal gas equation of state Compressibility factor Other equations of
More informationOnline Companion to Pricing Services Subject to Congestion: Charge Per-Use Fees or Sell Subscriptions?
Online Companion to Pricing Serices Subject to Congestion: Charge Per-Use Fees or Sell Subscriptions? Gérard P. Cachon Pnina Feldman Operations and Information Management, The Wharton School, Uniersity
More informationDiscrete Optimization 23
Discrete Optimization 23 2 Total Unimodularity (TU) and Its Applications In this section we will discuss the total unimodularity theory and its applications to flows in networks. 2.1 Total Unimodularity:
More informationMCAT Physics - Problem Drill 06: Translational Motion
MCAT Physics - Problem Drill 06: Translational Motion Question No. 1 of 10 Instructions: (1) Read the problem and answer choices carefully () Work the problems on paper as 1. An object falls from rest
More informationWould you risk your live driving drunk? Intro
Martha Casquete Would you risk your lie driing drunk? Intro Motion Position and displacement Aerage elocity and aerage speed Instantaneous elocity and speed Acceleration Constant acceleration: A special
More informationGeostrophy & Thermal wind
Lecture 10 Geostrophy & Thermal wind 10.1 f and β planes These are planes that are tangent to the earth (taken to be spherical) at a point of interest. The z ais is perpendicular to the plane (anti-parallel
More informationDEVIL PHYSICS THE BADDEST CLASS ON CAMPUS AP PHYSICS
DEVIL PHYSICS THE BADDEST CLASS ON CAMPUS AP PHYSICS LSN 7-4: CONSERVATION OF ENERGY AND MOMENTUM IN COLLISIONS LSN 7-5: ELASTIC COLLISIONS IN ONE DIMENSION LSN 7-6: INELASTIC COLLISIONS Questions From
More information- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs
LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs
More informationScalar multiplication and algebraic direction of a vector
Roberto s Notes on Linear Algebra Chapter 1: Geometric ectors Section 5 Scalar multiplication and algebraic direction of a ector What you need to know already: of a geometric ectors. Length and geometric
More informationEfficient solution of interval optimization problem
Math Meth Oper Res (212) 76:273 288 DOI 1.17/s186-12-399- ORIGINAL ARTICLE Efficient solution of interal optimization problem A. K. Bhurjee G. Panda Receied: 6 June 212 / Accepted: 4 August 212 / Published
More informationMinimum cost transportation problem
Minimum cost transportation problem Complements of Operations Research Giovanni Righini Università degli Studi di Milano Definitions The minimum cost transportation problem is a special case of the minimum
More informationFREEWAY WEAVING. Highway Capacity Manual 2000 CHAPTER 24 CONTENTS EXHIBITS
CHAPTER 24 FREEWAY WEAVING CONTENTS I. INTRODUCTION... 24-1 Scope of the Methodology...24-1 Limitations of the Methodology...24-1 II. METHODOLOGY...24-1 LOS...24-2 Weaing Segment Parameters...24-3 Determining
More informationBlue and purple vectors have same magnitude and direction so they are equal. Blue and green vectors have same direction but different magnitude.
A ector is a quantity that has both magnitude and direction. It is represented by an arrow. The length of the ector represents the magnitude and the arrow indicates the direction of the ector. Blue and
More informationarxiv: v2 [math.co] 12 Jul 2009
A Proof of the Molecular Conjecture Naoki Katoh and Shin-ichi Tanigawa arxi:0902.02362 [math.co] 12 Jul 2009 Department of Architecture and Architectural Engineering, Kyoto Uniersity, Kyoto Daigaku Katsura,
More informationMaximum flow problem CE 377K. February 26, 2015
Maximum flow problem CE 377K February 6, 05 REVIEW HW due in week Review Label setting vs. label correcting Bellman-Ford algorithm Review MAXIMUM FLOW PROBLEM Maximum Flow Problem What is the greatest
More informationBAYESIAN PREMIUM AND ASYMPTOTIC APPROXIMATION FOR A CLASS OF LOSS FUNCTIONS
TH USHNG HOUS ROCDNGS OF TH ROMANAN ACADMY Series A OF TH ROMANAN ACADMY Volume 6 Number 3/005 pp 000-000 AYSAN RMUM AND ASYMTOTC AROMATON FOR A CASS OF OSS FUNCTONS Roxana CUMARA Department of Mathematics
More information1 :: Mathematical notation
1 :: Mathematical notation x A means x is a member of the set A. A B means the set A is contained in the set B. {a 1,..., a n } means the set hose elements are a 1,..., a n. {x A : P } means the set of
More informationIsoperimetric problems
CHAPTER 2 Isoperimetric problems 2.1. History One of the earliest problems in geometry was the isoperimetric problem, which was considered by the ancient Greeks. The problem is to find, among all closed
More informationMath 144 Activity #9 Introduction to Vectors
144 p 1 Math 144 ctiity #9 Introduction to Vectors Often times you hear people use the words speed and elocity. Is there a difference between the two? If so, what is the difference? Discuss this with your
More informationOn diamond-free subposets of the Boolean lattice
On diamond-free subposets of the Boolean lattice Lucas Kramer, Ryan R Martin, Michael Young 2 Department of Mathematics, Iowa State Uniersity, Ames, Iowa 500 Abstract The Boolean lattice of dimension two,
More informationFlow Network. The following figure shows an example of a flow network:
Maximum Flow 1 Flow Network The following figure shows an example of a flow network: 16 V 1 12 V 3 20 s 10 4 9 7 t 13 4 V 2 V 4 14 A flow network G = (V,E) is a directed graph. Each edge (u, v) E has a
More informationChapter 7 Network Flow Problems, I
Chapter 7 Network Flow Problems, I Network flow problems are the most frequently solved linear programming problems. They include as special cases, the assignment, transportation, maximum flow, and shortest
More informationLecture #21. c T x Ax b. maximize subject to
COMPSCI 330: Design and Analysis of Algorithms 11/11/2014 Lecture #21 Lecturer: Debmalya Panigrahi Scribe: Samuel Haney 1 Overview In this lecture, we discuss linear programming. We first show that the
More informationA-level Mathematics. MM03 Mark scheme June Version 1.0: Final
-leel Mathematics MM0 Mark scheme 660 June 0 Version.0: Final Mark schemes are prepared by the Lead ssessment Writer and considered, together with the releant questions, by a panel of subject teachers.
More informationTwo Applications of Maximum Flow
Two Applications of Maximum Flow The Bipartite Matching Problem a bipartite graph as a flow network maximum flow and maximum matching alternating paths perfect matchings 2 Circulation with Demands flows
More informationLinear Programming Duality
Summer 2011 Optimization I Lecture 8 1 Duality recap Linear Programming Duality We motivated the dual of a linear program by thinking about the best possible lower bound on the optimal value we can achieve
More information7.5 Bipartite Matching
7. Bipartite Matching Matching Matching. Input: undirected graph G = (V, E). M E is a matching if each node appears in at most edge in M. Max matching: find a max cardinality matching. Bipartite Matching
More informationMagnetism has been observed since roughly 800 B.C. Certain rocks on the Greek peninsula of Magnesia were noticed to attract and repel one another.
1.1 Magnetic ields Magnetism has been obsered since roughly 800.C. Certain rocks on the Greek peninsula of Magnesia were noticed to attract and repel one another. Hence the word: Magnetism. o just like
More informationNotes on Linear Minimum Mean Square Error Estimators
Notes on Linear Minimum Mean Square Error Estimators Ça gatay Candan January, 0 Abstract Some connections between linear minimum mean square error estimators, maximum output SNR filters and the least square
More informationInternational Journal of Scientific & Engineering Research, Volume 7, Issue 11, November-2016 ISSN Nullity of Expanded Smith graphs
85 Nullity of Expanded Smith graphs Usha Sharma and Renu Naresh Department of Mathematics and Statistics, Banasthali Uniersity, Banasthali Rajasthan : usha.sharma94@yahoo.com, : renunaresh@gmail.com Abstract
More informationSome Lecture Notes on Auctions
Some Lecture Notes on Auctions John Morgan February 25 1 Introduction These notes sketch a 1 hour and 5 minute lecture on auctions. The main points are: 1. Set up the basic auction problem. 2. Derie the
More informationarxiv: v1 [math.co] 25 Apr 2016
On the zone complexity of a ertex Shira Zerbib arxi:604.07268 [math.co] 25 Apr 206 April 26, 206 Abstract Let L be a set of n lines in the real projectie plane in general position. We show that there exists
More informationdifferent formulas, depending on whether or not the vector is in two dimensions or three dimensions.
ectors The word ector comes from the Latin word ectus which means carried. It is best to think of a ector as the displacement from an initial point P to a terminal point Q. Such a ector is expressed as
More information6.046 Recitation 11 Handout
6.046 Recitation 11 Handout May 2, 2008 1 Max Flow as a Linear Program As a reminder, a linear program is a problem that can be written as that of fulfilling an objective function and a set of constraints
More informationChapter 5 Solution P5.2-2, 3, 6 P5.3-3, 5, 8, 15 P5.4-3, 6, 8, 16 P5.5-2, 4, 6, 11 P5.6-2, 4, 9
Chapter 5 Solution P5.2-2, 3, 6 P5.3-3, 5, 8, 15 P5.4-3, 6, 8, 16 P5.5-2, 4, 6, 11 P5.6-2, 4, 9 P 5.2-2 Consider the circuit of Figure P 5.2-2. Find i a by simplifying the circuit (using source transformations)
More informationOn resilience of distributed routing in networks under cascade dynamics
On resilience of distributed routing in networks under cascade dynamics Ketan Sala Giacomo Como Munther A. Dahleh Emilio Frazzoli Abstract We consider network flow oer graphs between a single origin-destination
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Recitation 13 10/31/2008. Markov Chains
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/5.085J Fall 008 Recitation 3 0/3/008 Marko Chains Problem 9 from Poisson process exercises in [BT] Fact: If there is a single recurrent class, the frequency
More informationLecture J. 10 Counting subgraphs Kirchhoff s Matrix-Tree Theorem.
Lecture J jacques@ucsd.edu Notation: Let [n] [n] := [n] 2. A weighted digraph is a function W : [n] 2 R. An arborescence is, loosely speaking, a digraph which consists in orienting eery edge of a rooted
More information27 ft 3 adequately describes the volume of a cube with side 3. ft F adequately describes the temperature of a person.
VECTORS The stud of ectors is closel related to the stud of such phsical properties as force, motion, elocit, and other related topics. Vectors allow us to model certain characteristics of these phenomena
More informationPolynomial-Solvability of N P-class Problems
Polynomial-Solability of N P-class Problems Anatoly Panyuko paniukoa@susu.ru arxi:1409.03755 [cs.cc] 24 Aug 2018 Abstract LetHamiltoniancomplement ofthegraphg = (V(G), E(G))betheminimal cardinality set
More information(a) During the first part of the motion, the displacement is x 1 = 40 km and the time interval is t 1 (30 km / h) (80 km) 40 km/h. t. (2.
Chapter 3. Since the trip consists of two parts, let the displacements during first and second parts of the motion be x and x, and the corresponding time interals be t and t, respectiely. Now, because
More informationUNDERSTAND MOTION IN ONE AND TWO DIMENSIONS
SUBAREA I. COMPETENCY 1.0 UNDERSTAND MOTION IN ONE AND TWO DIMENSIONS MECHANICS Skill 1.1 Calculating displacement, aerage elocity, instantaneous elocity, and acceleration in a gien frame of reference
More informationStable Network Flow with Piece-wise Linear Constraints
Stable Network Flow with Piece-wise Linear Constraints Young-San Lin Thành Nguyen Abstract We consider a general stable flow problem in a directed and capacitated network, where each ertex has a strict
More informationarxiv: v1 [math.gt] 2 Nov 2010
CONSTRUCTING UNIVERSAL ABELIAN COVERS OF GRAPH MANIFOLDS HELGE MØLLER PEDERSEN arxi:101105551 [mathgt] 2 No 2010 Abstract To a rational homology sphere graph manifold one can associate a weighted tree
More informationReview of Matrices and Vectors 1/45
Reiew of Matrices and Vectors /45 /45 Definition of Vector: A collection of comple or real numbers, generally put in a column [ ] T "! Transpose + + + b a b a b b a a " " " b a b a Definition of Vector
More informationTowards Green Distributed Storage Systems
Towards Green Distributed Storage Systems Abdelrahman M. Ibrahim, Ahmed A. Zewail, and Aylin Yener Wireless Communications and Networking Laboratory (WCAN) Electrical Engineering Department The Pennsylania
More informationOn Shortest Single/Multiple Path Computation Problems in Fiber-Wireless (FiWi) Access Networks
2014 IEEE 15th International Conference on High Performance Sitching and Routing (HPSR) On Shortest Single/Multiple Path Computation Problems in Fiber-Wireless (FiWi) Access Netorks Chenyang Zhou, Anisha
More informationOptimization Problems in Multiple Subtree Graphs
Optimization Problems in Multiple Subtree Graphs Danny Hermelin Dror Rawitz February 28, 2010 Abstract We study arious optimization problems in t-subtree graphs, the intersection graphs of t- subtrees,
More informationA Geometric Review of Linear Algebra
A Geometric Reiew of Linear Algebra The following is a compact reiew of the primary concepts of linear algebra. I assume the reader is familiar with basic (i.e., high school) algebra and trigonometry.
More informationIntroduction to Thermodynamic Cycles Part 1 1 st Law of Thermodynamics and Gas Power Cycles
Introduction to Thermodynamic Cycles Part 1 1 st Law of Thermodynamics and Gas Power Cycles by James Doane, PhD, PE Contents 1.0 Course Oeriew... 4.0 Basic Concepts of Thermodynamics... 4.1 Temperature
More informationAlgebra Based Physics. Motion in One Dimension. 1D Kinematics Graphing Free Fall 2016.notebook. August 30, Table of Contents: Kinematics
Table of Contents: Kinematics Algebra Based Physics Kinematics in One Dimension 06 03 www.njctl.org Motion in One Dimension Aerage Speed Position and Reference Frame Displacement Aerage Velocity Instantaneous
More informationChapter 2: 1D Kinematics Tuesday January 13th
Chapter : D Kinematics Tuesday January 3th Motion in a straight line (D Kinematics) Aerage elocity and aerage speed Instantaneous elocity and speed Acceleration Short summary Constant acceleration a special
More informationMotion in Two and Three Dimensions
PH 1-A Fall 014 Motion in Two and Three Dimensions Lectures 4,5 Chapter 4 (Halliday/Resnick/Walker, Fundamentals of Physics 9 th edition) 1 Chapter 4 Motion in Two and Three Dimensions In this chapter
More informationAn Explicit Lower Bound of 5n o(n) for Boolean Circuits
An Eplicit Lower Bound of 5n o(n) for Boolean Circuits Kazuo Iwama, Oded Lachish, Hiroki Morizumi, and Ran Raz Graduate School of Informatics, Kyoto Uniersity, Kyoto, JAPAN {iwama, morizumi}@kuis.kyoto-u.ac.jp
More informationMaximum flow problem
Maximum flow problem 7000 Network flows Network Directed graph G = (V, E) Source node s V, sink node t V Edge capacities: cap : E R 0 Flow: f : E R 0 satisfying 1. Flow conservation constraints e:target(e)=v
More informationDynamic Lot Size Problems with One-way Product Substitution 1
This is the Pre-Published Version. 03/2002/100057 ynamic Lot Size Problems with One-way Product Substitution 1 Vernon Ning Hsu School of Management George Mason Uniersity Fairfax, VA 22030, USA email hsu@gmu.edu
More informationA Geometric Review of Linear Algebra
A Geometric Reiew of Linear Algebra The following is a compact reiew of the primary concepts of linear algebra. The order of presentation is unconentional, with emphasis on geometric intuition rather than
More information6.3 Vectors in a Plane
6.3 Vectors in a Plane Plan: Represent ectors as directed line segments. Write the component form of ectors. Perform basic ector operations and represent ectors graphically. Find the direction angles of
More informationDYNAMICS. Kinematics of Particles Engineering Dynamics Lecture Note VECTOR MECHANICS FOR ENGINEERS: Eighth Edition CHAPTER
27 The McGraw-Hill Companies, Inc. All rights resered. Eighth E CHAPTER 11 VECTOR MECHANICS FOR ENGINEERS: DYNAMICS Ferdinand P. Beer E. Russell Johnston, Jr. Kinematics of Particles Lecture Notes: J.
More information0 a 3 a 2 a 3 0 a 1 a 2 a 1 0
Chapter Flow kinematics Vector and tensor formulae This introductory section presents a brief account of different definitions of ector and tensor analysis that will be used in the following chapters.
More informationChapter 4: Techniques of Circuit Analysis
Chapter 4: Techniques of Circuit Analysis This chapter gies us many useful tools for soling and simplifying circuits. We saw a few simple tools in the last chapter (reduction of circuits ia series and
More informationMotion in Two and Three Dimensions
PH 1-1D Spring 013 Motion in Two and Three Dimensions Lectures 5,6,7 Chapter 4 (Halliday/Resnick/Walker, Fundamentals of Physics 9 th edition) 1 Chapter 4 Motion in Two and Three Dimensions In this chapter
More information6.1.1 Angle between Two Lines Intersection of Two lines Shortest Distance from a Point to a Line
CHAPTER 6 : VECTORS 6. Lines in Space 6.. Angle between Two Lines 6.. Intersection of Two lines 6..3 Shortest Distance from a Point to a Line 6. Planes in Space 6.. Intersection of Two Planes 6.. Angle
More informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 7: Duality and applications Prof. John Gunnar Carlsson September 29, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 29, 2010 1
More information4.6 Linear Programming duality
4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP Different spaces and objective functions but in general same optimal
More informationSome Lecture Notes on Auctions
Some Lecture Notes on Auctions John Morgan Haas School of Business and Department of Economics Uniersity of California, Berkeley Preliminaries Perhaps the most fruitful area for the application of optimal
More informationGeneralization of the Minimum Branch Vertices Spanning Tree Problem
Generalization of the Minimum Branch Vertices Spanning Tree Problem Massinissa Merabet, Miklós Molnár To cite this ersion: Massinissa Merabet, Miklós Molnár. Generalization of the Minimum Branch Vertices
More informationNetwork Flows. 7. Multicommodity Flows Problems. Fall 2010 Instructor: Dr. Masoud Yaghini
In the name of God Network Flows 7. Multicommodity Flows Problems 7.3 Column Generation Approach Fall 2010 Instructor: Dr. Masoud Yaghini Path Flow Formulation Path Flow Formulation Let first reformulate
More informationNote on Posted Slides. Motion Is Relative
Note on Posted Slides These are the slides that I intended to show in class on Tue. Jan. 9, 2014. They contain important ideas and questions from your reading. Due to time constraints, I was probably not
More informationG 2(X) X SOLVABILITY OF GRAPH INEQUALITIES. 1. A simple graph inequality. Consider the diagram in Figure 1.
SOLVABILITY OF GRAPH INEQUALITIES MARCUS SCHAEFER AND DANIEL ŠTEFANKOVIČ Abstract. We inestigate a new type of graph inequality (in the tradition of Cetkoić and Simić [Contributions to Graph Theory and
More informationExercises - Linear Programming
Chapter 38 Exercises - Linear Programming By Sariel Har-Peled, December 10, 2007 1 Version: 1.0 This chapter include problems that are related to linear programming. 38.1 Miscellaneous Exercise 38.1.1
More informationLesson 2: Kinematics (Sections ) Chapter 2 Motion Along a Line
Lesson : Kinematics (Sections.-.5) Chapter Motion Along a Line In order to specify a position, it is necessary to choose an origin. We talk about the football field is 00 yards from goal line to goal line,
More informationPyramidal Sum Labeling In Graphs
ISSN : 48-96, Vol 8, Issue 4, ( Part -I) April 8, pp-9 RESEARCH ARTICLE Pyramidal Sum Labeling In Graphs OPEN ACCESS HVelet Getzimah, D S T Ramesh ( department Of Mathematics, Pope s College, Sayerpuram-68,Ms
More informationChapter 11 Collision Theory
Chapter Collision Theory Introduction. Center o Mass Reerence Frame Consider two particles o masses m and m interacting ia some orce. Figure. Center o Mass o a system o two interacting particles Choose
More informationNetwork Flows. CS124 Lecture 17
C14 Lecture 17 Network Flows uppose that we are given the network in top of Figure 17.1, where the numbers indicate capacities, that is, the amount of flow that can go through the edge in unit time. We
More information3.3 Easy ILP problems and totally unimodular matrices
3.3 Easy ILP problems and totally unimodular matrices Consider a generic ILP problem expressed in standard form where A Z m n with n m, and b Z m. min{c t x : Ax = b, x Z n +} (1) P(b) = {x R n : Ax =
More informationChapter 7. Network Flow. Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved.
Chapter 7 Network Flow Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved. 7.5 Bipartite Matching Matching Matching. Input: undirected graph G = (V, E). M E is a matching
More informationGraphs and Network Flows IE411. Lecture 12. Dr. Ted Ralphs
Graphs and Network Flows IE411 Lecture 12 Dr. Ted Ralphs IE411 Lecture 12 1 References for Today s Lecture Required reading Sections 21.1 21.2 References AMO Chapter 6 CLRS Sections 26.1 26.2 IE411 Lecture
More informationLINEAR ALGEBRA. and VECTOR GEOMETRY Volume 2 of 2 September 2014 edition
LINEAR ALGEBRA and VECTOR GEOMETRY Volume 2 of 2 September 2014 edition Because the book is so large, the entire Linear Algebra course has been split into two olumes. Grant Skene for Grant s Tutoring (www.grantstutoring.com)
More informationBBM402-Lecture 20: LP Duality
BBM402-Lecture 20: LP Duality Lecturer: Lale Özkahya Resources for the presentation: https://courses.engr.illinois.edu/cs473/fa2016/lectures.html An easy LP? which is compact form for max cx subject to
More informationCHAPTER 3 : VECTORS. Definition 3.1 A vector is a quantity that has both magnitude and direction.
EQT 101-Engineering Mathematics I Teaching Module CHAPTER 3 : VECTORS 3.1 Introduction Definition 3.1 A ector is a quantity that has both magnitude and direction. A ector is often represented by an arrow
More informationDuality of LPs and Applications
Lecture 6 Duality of LPs and Applications Last lecture we introduced duality of linear programs. We saw how to form duals, and proved both the weak and strong duality theorems. In this lecture we will
More informationdv dv 2 2 dt dt dv dt
1/3/14 hapter 8 Second order circuits A circuit with two energy storage elements: One inductor, one capacitor Two capacitors, or Two inductors i Such a circuit will be described with second order differential
More informationOn (a, d)-vertex-antimagic total labeling of Harary graphs
On (a, d)-ertex-antimagic total labeling of Harary graphs M. Hussain 1, Kashif Ali 1, M. T. Rahim, Edy Tri Baskoro 3 1 COMSATS Institute of Information Technology, Lahore Campus, Pakistan {muhammad.hussain,kashif.ali}@ciitlahore.edu.pk
More informationFlows and Cuts. 1 Concepts. CS 787: Advanced Algorithms. Instructor: Dieter van Melkebeek
CS 787: Advanced Algorithms Flows and Cuts Instructor: Dieter van Melkebeek This lecture covers the construction of optimal flows and cuts in networks, their relationship, and some applications. It paves
More informationJournal of Computational and Applied Mathematics. New matrix iterative methods for constraint solutions of the matrix
Journal of Computational and Applied Mathematics 35 (010 76 735 Contents lists aailable at ScienceDirect Journal of Computational and Applied Mathematics journal homepage: www.elseier.com/locate/cam New
More informationTHE LOCAL-GLOBAL PRINCIPLE KEITH CONRAD
THE LOCAL-GLOBAL PRINCIPLE KEITH CONRAD 1. Introduction Hensel created p-adic numbers near the start of the 20th century and they had some early positie influences: Hensel used them to sole a conjecture
More informationMaximum Flow Problem (Ford and Fulkerson, 1956)
Maximum Flow Problem (Ford and Fulkerson, 196) In this problem we find the maximum flow possible in a directed connected network with arc capacities. There is unlimited quantity available in the given
More information