Jianlin Cheng, PhD Computer Science Department University of Missouri, Columbia Fall, 2013

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "Jianlin Cheng, PhD Computer Science Department University of Missouri, Columbia Fall, 2013"

Transcription

1 Jianlin Cheng, PhD Computer Science Department University of Missouri, Columbia Fall, 2013

2 Princeton s class notes on linear programming MIT s class notes on linear programming Xian Jiaotong University s class notes on linear programming Ohio University s class notes Rutgers University s class notes

3 Essen>al tool for op>mal alloca>on of scarce resource among a number of compe>ng ac>vi>es Powerful and general problem- solving method - shortest path, max flow, min cost flow minimum spanning tree

4 Fast commercial solvers: CPLEX, OSL Ranked among most important scien>fic advances of 20 th century Also a general tool for aqacking NP- hard op>miza>on problems Dominates world of industry - ex: Delta claims saving $100 million per year using LP

5 Agriculture: diet problem Computer science: data mining Electrical engineering: VLSI design Energy: blending petroleum products Environment: water quality management Finance: poryolio op>miza>on Logis>cs: supply- chain management Management: hotel yield management Marke>ng: direct mail adver>sing manufacturing: produc>on line balancing Medicine: radioac>ve seed placement in cancer treatment Opera>on research: airline crew assignment Telecommunica>on: network design, internet rou>ng Sports: scheduling ACC basketball

6 An Example, IntuiFve Understanding of Linear Programming

7

8

9

10 Profit can be considered as a series of linear lines having a certain profit. Scan the line through the feasible area.

11

12

13

14

15

16

17 Another Example, FormulaFon, and Proof

18

19

20

21

22

23 Slack Form min ax z = 4x s.t. 2x + 3y + x 0, y 5y w = 60 9, w 0. min s.t. x z = cx Ax x = b 0. rank( A) = m.

24 Optimal occurs at a vertex!!! z = 4 x + 5y 2x + 3y 60 Feasible domain

25 What s a vertex? A point x in a polyhadren Ω is called a if 1 x = ( y + z), y, z Ω 2 x = y = z. vertex

26 Fundamental Theorem Let Ω= { x Ax = b, x 0}. If min cx over x Ω has an optimal solution, then it can be found in vertices of Ω.

27 Proof. Consider an optimal solution x* with maximum number of zero components among all optimal solutions. We will show that x*is a vertex of Ω. By contradition, suppose x*is not, that is, there exist y, z Ω such that x* = ( y + z) / 2 and x*, y, z are distinct. Since cx* cy, cx* cz, and cx* = ( cy+cz) / 2, we must have cx* = cy = cz.this means that y and z are also optimal solutions. It follows that all feasible points on line x*+ α( y-x*) are optimal solutions. However, Ω does infinite not contain any line.thus, the line must have a point x' not in Ω, that is, x' violates at least one constraint.

28 Z X* Y X X violates one constraint

29 Proof (cont s). Note that for any α, Thus, x' cannot violate constraint Ax = b. Moreover, for x* = 0, since x*= ( y +z i must have z =y =x of x*+ α( y-x*) is equal to 0 for any α. This means that x' cannot violate constraint violate a constraint x i i i i A( x*+ α( y-x*)) = b. ) / 2 and * = 0. Therefore, the ith component j i i 0. Hence, x' must 0 for some j with x 0, we *> 0. Now, we can easily find an optimal solution between x' and x*, which has one more zero - component than x*, a contradiction. x i y i,z i j

30 Z Y X* X X has fewer or equal number of 0 terms as X*. X has one nega>ve component, whose value in X* is posi>ve. As we move from X to X* into the feasible region, the component will become 0

31

32

33 Polyhedron of simplex algorithm in 3D

34 Demo of MIT Linear Programming Solver: hqp://sourceforge.net/projects/lipside/

35

36

37

38

39

40 Integer Programming Integer programming is a solution method for many discrete optimization problems Programming = Planning in this context Origins go back to military logistics in WWII (1940s). In a survey of Fortune 500 firms, 85% of those responding said that they had used linear or integer programming. Why is it so popular? Many different real-life situations can be modeled as integer programs (IPs). There are efficient algorithms to solve IPs.

41 Standard form of integer program (IP) maximize c 1 x 1 +c 2 x 2 + +c n x n (objective function) subject to a 11 x 1 +a 12 x 2 + +a 1n x n b 1 (functional constraints) a 21 x 1 +a 22 x 2 + +a 2n x n b 2. a m1 x 1 +a m2 x 2 + +a mn x n b m x 1, x 2,, x n Z + (set constraints)

42 Standard form of integer program (IP) In vector form: maximize cx (objective function) subject to Ax b (functional constraints) n x (set constraints) Z + Input for IP: 1 n vector c, m n matrice A, m 1 vector b. Output of IP: n 1 integer vector x. Note: More often, we will consider mixed integer programs (MIP), that is, some variables are integer, the others are continuous.

43 Example of Integer Program (Production Planning-Furniture Manufacturer) Technological data: Production of 1 table requires 5 ft pine, 2 ft oak, 3 hrs labor 1 chair requires 1 ft pine, 3 ft oak, 2 hrs labor 1 desk requires 9 ft pine, 4 ft oak, 5 hrs labor Capacities for 1 week: 1500 ft pine, 1000 ft oak, Market data: 20 employees (each works 40 hrs). profit Goal: Find a production schedule for 1 week that will maximize the profit. demand table $12/unit 40 chair $5/unit 130 desk $15/unit 30

44 Production Planning-Furniture Manufacturer: modeling the problem as integer program The goal can be achieved by making appropriate decisions. First define decision variables: Let x t be the number of tables to be produced; x c be the number of chairs to be produced; x d be the number of desks to be produced. (Always define decision variables properly!)

45 Production Planning-Furniture Manufacturer: modeling the problem as integer program Ø Objective is to maximize profit: max 12x t + 5x c + 15x d Ø Functional Constraints capacity constraints: pine: 5x t + 1x c + 9x d 1500 oak: 2x t + 3x c + 4x d 1000 labor: 3x t + 2x c + 5x d 800 market demand constraints: tables: x t 40 chairs: x c 130 desks: x d 30 Ø Set Constraints x t, x c, x d Z +

46 Solutions to integer programs A solution is an assignment of values to variables. A feasible solution is an assignment of values to variables such that all the constraints are satisfied. The objective function value of a solution is obtained by evaluating the objective function at the given point. An optimal solution (assuming maximization) is one whose objective function value is greater than or equal to that of all other feasible solutions. Integer program is NP complete There are efficient algorithms for finding the optimal solutions of an integer program based on LP relaxation.

47 Next: IP modeling techniques Modeling techniques: Ø Using binary variables Ø Restrictions on number of options Ø Contingent decisions Ø Variables with k possible values Applications: Ø Facility Location Problem Ø Knapsack Problem

48 Example of IP: Facility Location A company is thinking about building new facilities in LA and SF. Relevant data: capital needed 4. warehouse in SF $2M $4M Total capital available for investment: $10M Question: Which facilities should be built to maximize the total profit? expected profit 1. factory in LA $6M $9M 2. factory in SF $3M $5M 3. warehouse in LA $5M $6M

49 Example of IP: Facility Location Define decision variables (i = 1, 2, 3, 4): x i Then the total expected benefit: 9x 1 +5x 2 +6x 3 +4x the total capital needed: 6x 1 +3x 2 +5x 3 +2x 4 Ø Summarizing, the IP model is: max 9x 1 +5x 2 +6x 3 +4x 4 s.t. 6x 1 +3x 2 +5x 3 +2x 4 10 = not x 1, x 2, x 3, x 4 binary ( i.e., x i {0,1} ) if if facility i is built

50 Knapsack problem Any IP, which has only one constraint, is referred to as a knapsack problem. n items to be packed in a knapsack. The knapsack can hold up to W lb of items. Each item has weight w i lb and benefit b i. Goal: Pack the knapsack such that the total benefit is maximized.

51 IP model for Knapsack problem Define decision variables (i = 1,, n): 1 if item i is packed x i = n 0 if not Then the total benefit: b i x i n i= 1 the total weight: w i x i i= 1 Ø Summarizing, the IP model is: n max b i x i s.t. n i=1 i= 1 w x W x i binary (i = 1,, n) i i

52 Connection between the problems Note: The version of the facility location problem is a special case of the knapsack problem. Ø Important modeling skill: Suppose you know how to model Problem A 1,,A p ; You need to solve Problem B; Notice the similarities between Problems A i and B; Build a model for Problem B, using the model for Problem A i as a prototype.

53 The Facility Location Problem: adding new requirements Extra requirement: build at most one of the two warehouses. The corresponding constraint is: x 3 +x 4 1 Extra requirement: build at least one of the two factories. The corresponding constraint is: x 1 +x 2 1

54 Modeling Technique: Restrictions on the number of options Restrictions: At least p and at most q of the options can be chosen. The corresponding constraints are: n i=1 x i p n i=1 x i q

55 Modeling Technique: Contingent Decisions Back to the facility location problem. Requirement: Can t build a warehouse there is a factory in the city. The corresponding constraints are: x 3 x 1 (LA) x 4 x 2 (SF) Requirement: Can t select option 3 unless at least one of options 1 and 2 is selected. unless The constraint: x 3 x 1 + x 2 Requirement: Can t select option 4 unless at least two of options 1, 2 and 3 are selected. The constraint: 2x 4 x 1 + x 2 + x 3

56 Modeling Technique: Variables with k possible values Suppose variable y should take one of the values d 1, d 2,, d k. How to achieve that in the model? Introduce new decision variables. For i=1,,k, 1 if y takes value d i x i = 0 otherwise Then we need the following constraints. y k i= 1 k i= 1 x = d i = i x i 1 ( y can take only one value) ( y should take value d i if x i = 1)

57

58

59

60

61 Rounding non- integer solu/on values up to the nearest integer value can result in an infeasible solu/on. A feasible solu/on is ensured by rounding down non- integer solu>on values but may result in a less than op>mal (sub- op/mal) solu/on.

62 Integer Programming Example Graphical SoluFon of Machine Shop Model Maximize Z = $100x 1 + $150x 2 subject to: 8,000x 1 + 4,000x 2 $40,000 15x x ft 2 x 1, x 2 0 and integer Optimal Solution: Z = $1, x 1 = 2.22 presses x 2 = 5.55 lathes Figure 5.1 Feasible Solution Space with Integer Solution Points Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall

63

64

65

66

67 Min Cut Problem

68 Algorithms Use IP to solve the network flow problem Use IP to solve the min- cut problem

INTEGER PROGRAMMING. Integer Programming. Prototype example. BIP model. BIP models

INTEGER PROGRAMMING. Integer Programming. Prototype example. BIP model. BIP models Integer Programming INTEGER PROGRAMMING In many problems the decision variables must have integer values. Example: assign people, machines, and vehicles to activities in integer quantities. If this is

More information

! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. !-approximation algorithm.

! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. !-approximation algorithm. Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of

More information

5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1

5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition

More information

Lecture 4 Linear Programming Models: Standard Form. August 31, 2009

Lecture 4 Linear Programming Models: Standard Form. August 31, 2009 Linear Programming Models: Standard Form August 31, 2009 Outline: Lecture 4 Standard form LP Transforming the LP problem to standard form Basic solutions of standard LP problem Operations Research Methods

More information

Inverse Optimization by James Orlin

Inverse Optimization by James Orlin Inverse Optimization by James Orlin based on research that is joint with Ravi Ahuja Jeopardy 000 -- the Math Programming Edition The category is linear objective functions The answer: When you maximize

More information

Lecture 3: Linear Programming Relaxations and Rounding

Lecture 3: Linear Programming Relaxations and Rounding Lecture 3: Linear Programming Relaxations and Rounding 1 Approximation Algorithms and Linear Relaxations For the time being, suppose we have a minimization problem. Many times, the problem at hand can

More information

Week 5 Integral Polyhedra

Week 5 Integral Polyhedra Week 5 Integral Polyhedra We have seen some examples 1 of linear programming formulation that are integral, meaning that every basic feasible solution is an integral vector. This week we develop a theory

More information

Discrete (and Continuous) Optimization Solutions of Exercises 1 WI4 131

Discrete (and Continuous) Optimization Solutions of Exercises 1 WI4 131 Discrete (and Continuous) Optimization Solutions of Exercises 1 WI4 131 Kees Roos Technische Universiteit Delft Faculteit Informatietechnologie en Systemen Afdeling Informatie, Systemen en Algoritmiek

More information

Approximation Algorithms

Approximation Algorithms Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms

More information

Good luck, veel succes!

Good luck, veel succes! Final exam Advanced Linear Programming, May 7, 13.00-16.00 Switch off your mobile phone, PDA and any other mobile device and put it far away. No books or other reading materials are allowed. This exam

More information

! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. #-approximation algorithm.

! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. #-approximation algorithm. Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of three

More information

4.6 Linear Programming duality

4.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 information

Using the Simplex Method in Mixed Integer Linear Programming

Using the Simplex Method in Mixed Integer Linear Programming Integer Using the Simplex Method in Mixed Integer UTFSM Nancy, 17 december 2015 Using the Simplex Method in Mixed Integer Outline Mathematical Programming Integer 1 Mathematical Programming Optimisation

More information

Chapter 11. 11.1 Load Balancing. Approximation Algorithms. Load Balancing. Load Balancing on 2 Machines. Load Balancing: Greedy Scheduling

Chapter 11. 11.1 Load Balancing. Approximation Algorithms. Load Balancing. Load Balancing on 2 Machines. Load Balancing: Greedy Scheduling Approximation Algorithms Chapter Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should I do? A. Theory says you're unlikely to find a poly-time algorithm. Must sacrifice one

More information

Optimization in R n Introduction

Optimization in R n Introduction Optimization in R n Introduction Rudi Pendavingh Eindhoven Technical University Optimization in R n, lecture Rudi Pendavingh (TUE) Optimization in R n Introduction ORN / 4 Some optimization problems designing

More information

Optimization Modeling for Mining Engineers

Optimization Modeling for Mining Engineers Optimization Modeling for Mining Engineers Alexandra M. Newman Division of Economics and Business Slide 1 Colorado School of Mines Seminar Outline Linear Programming Integer Linear Programming Slide 2

More information

What is Linear Programming?

What is Linear Programming? Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to

More information

Integer Programming. 9.1 Introduction to Integer Programming

Integer Programming. 9.1 Introduction to Integer Programming Integer Programming Recall that we defined integer programming problems in our discussion of the Divisibility Assumption in Section 3.1. Simply stated, an integer programming problem (IP) is an LP in which

More information

MATHEMATICAL BACKGROUND

MATHEMATICAL BACKGROUND Chapter 1 MATHEMATICAL BACKGROUND This chapter discusses the mathematics that is necessary for the development of the theory of linear programming. We are particularly interested in the solutions of a

More information

THEORY OF SIMPLEX METHOD

THEORY OF SIMPLEX METHOD Chapter THEORY OF SIMPLEX METHOD Mathematical Programming Problems A mathematical programming problem is an optimization problem of finding the values of the unknown variables x, x,, x n that maximize

More information

Chapter 3 LINEAR PROGRAMMING GRAPHICAL SOLUTION 3.1 SOLUTION METHODS 3.2 TERMINOLOGY

Chapter 3 LINEAR PROGRAMMING GRAPHICAL SOLUTION 3.1 SOLUTION METHODS 3.2 TERMINOLOGY Chapter 3 LINEAR PROGRAMMING GRAPHICAL SOLUTION 3.1 SOLUTION METHODS Once the problem is formulated by setting appropriate objective function and constraints, the next step is to solve it. Solving LPP

More information

Quiz 1 Sample Questions IE406 Introduction to Mathematical Programming Dr. Ralphs

Quiz 1 Sample Questions IE406 Introduction to Mathematical Programming Dr. Ralphs Quiz 1 Sample Questions IE406 Introduction to Mathematical Programming Dr. Ralphs These questions are from previous years and should you give you some idea of what to expect on Quiz 1. 1. Consider the

More information

1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.

1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where. Introduction Linear Programming Neil Laws TT 00 A general optimization problem is of the form: choose x to maximise f(x) subject to x S where x = (x,..., x n ) T, f : R n R is the objective function, S

More information

Approximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques. My T. Thai

Approximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques. My T. Thai Approximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques My T. Thai 1 Overview An overview of LP relaxation and rounding method is as follows: 1. Formulate an optimization

More information

Geometry of Linear Programming

Geometry of Linear Programming Chapter 2 Geometry of Linear Programming The intent of this chapter is to provide a geometric interpretation of linear programming problems. To conceive fundamental concepts and validity of different algorithms

More information

Linear Programming: Introduction

Linear Programming: Introduction Linear Programming: Introduction Frédéric Giroire F. Giroire LP - Introduction 1/28 Course Schedule Session 1: Introduction to optimization. Modelling and Solving simple problems. Modelling combinatorial

More information

LINEAR PROGRAMMING P V Ram B. Sc., ACA, ACMA Hyderabad

LINEAR PROGRAMMING P V Ram B. Sc., ACA, ACMA Hyderabad LINEAR PROGRAMMING P V Ram B. Sc., ACA, ACMA 98481 85073 Hyderabad Page 1 of 19 Question: Explain LPP. Answer: Linear programming is a mathematical technique for determining the optimal allocation of resources

More information

3. Evaluate the objective function at each vertex. Put the vertices into a table: Vertex P=3x+2y (0, 0) 0 min (0, 5) 10 (15, 0) 45 (12, 2) 40 Max

3. Evaluate the objective function at each vertex. Put the vertices into a table: Vertex P=3x+2y (0, 0) 0 min (0, 5) 10 (15, 0) 45 (12, 2) 40 Max SOLUTION OF LINEAR PROGRAMMING PROBLEMS THEOREM 1 If a linear programming problem has a solution, then it must occur at a vertex, or corner point, of the feasible set, S, associated with the problem. Furthermore,

More information

Linear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued.

Linear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued. Linear Programming Widget Factory Example Learning Goals. Introduce Linear Programming Problems. Widget Example, Graphical Solution. Basic Theory:, Vertices, Existence of Solutions. Equivalent formulations.

More information

10.1 Integer Programming and LP relaxation

10.1 Integer Programming and LP relaxation CS787: Advanced Algorithms Lecture 10: LP Relaxation and Rounding In this lecture we will design approximation algorithms using linear programming. The key insight behind this approach is that the closely

More information

Introduction to Linear Programming.

Introduction to Linear Programming. Chapter 1 Introduction to Linear Programming. This chapter introduces notations, terminologies and formulations of linear programming. Examples will be given to show how real-life problems can be modeled

More information

Scheduling Home Health Care with Separating Benders Cuts in Decision Diagrams

Scheduling Home Health Care with Separating Benders Cuts in Decision Diagrams Scheduling Home Health Care with Separating Benders Cuts in Decision Diagrams André Ciré University of Toronto John Hooker Carnegie Mellon University INFORMS 2014 Home Health Care Home health care delivery

More information

Discrete Optimization

Discrete Optimization Discrete Optimization [Chen, Batson, Dang: Applied integer Programming] Chapter 3 and 4.1-4.3 by Johan Högdahl and Victoria Svedberg Seminar 2, 2015-03-31 Todays presentation Chapter 3 Transforms using

More information

Linear Programming. March 14, 2014

Linear Programming. March 14, 2014 Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1

More information

. P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2

. P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2 4. Basic feasible solutions and vertices of polyhedra Due to the fundamental theorem of Linear Programming, to solve any LP it suffices to consider the vertices (finitely many) of the polyhedron P of the

More information

Lecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method

Lecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming

More information

3. Linear Programming and Polyhedral Combinatorics

3. Linear Programming and Polyhedral Combinatorics Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the

More information

Answers to some of the exercises.

Answers to some of the exercises. Answers to some of the exercises. Chapter 2. Ex.2.1 (a) There are several ways to do this. Here is one possibility. The idea is to apply the k-center algorithm first to D and then for each center in D

More information

Minimizing costs for transport buyers using integer programming and column generation. Eser Esirgen

Minimizing costs for transport buyers using integer programming and column generation. Eser Esirgen MASTER STHESIS Minimizing costs for transport buyers using integer programming and column generation Eser Esirgen DepartmentofMathematicalSciences CHALMERS UNIVERSITY OF TECHNOLOGY UNIVERSITY OF GOTHENBURG

More information

The Simplex Method. What happens when we need more decision variables and more problem constraints?

The Simplex Method. What happens when we need more decision variables and more problem constraints? The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving two decision variables and relatively few problem

More information

Section Notes 4. Duality, Sensitivity, Dual Simplex, Complementary Slackness. Applied Math 121. Week of February 28, 2011

Section Notes 4. Duality, Sensitivity, Dual Simplex, Complementary Slackness. Applied Math 121. Week of February 28, 2011 Section Notes 4 Duality, Sensitivity, Dual Simplex, Complementary Slackness Applied Math 121 Week of February 28, 2011 Goals for the week understand the relationship between primal and dual programs. know

More information

18. Linear optimization

18. Linear optimization 18. Linear optimization EE103 (Fall 2011-12) linear program examples geometrical interpretation extreme points simplex method 18-1 Linear program minimize c 1 x 1 +c 2 x 2 + +c n x n subject to a 11 x

More information

Linear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.

Linear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc. 1. Introduction Linear Programming for Optimization Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc. 1.1 Definition Linear programming is the name of a branch of applied mathematics that

More information

Objective Function Coefficients and Range of Optimality If c k changes to values outside the range of optimality, a new c j - z j row may be generated

Objective Function Coefficients and Range of Optimality If c k changes to values outside the range of optimality, a new c j - z j row may be generated Chapter 5 Simplex-Based Sensitivity Analysis and Duality Sensitivity Analysis with the Simplex Tableau Duality 1 Objective Function Coefficients and Range of Optimality The range of optimality for an objective

More information

Lecture notes 1: Introduction to linear and (mixed) integer programs

Lecture notes 1: Introduction to linear and (mixed) integer programs Lecture notes 1: Introduction to linear and (mixed) integer programs Vincent Conitzer 1 An example We will start with a simple example. Suppose we are in the business of selling reproductions of two different

More information

value is determined is called constraints. It can be either a linear equation or inequality.

value is determined is called constraints. It can be either a linear equation or inequality. Contents 1. Index 2. Introduction 3. Syntax 4. Explanation of Simplex Algorithm Index Objective function the function to be maximized or minimized is called objective function. E.g. max z = 2x + 3y Constraints

More information

SUPPLEMENT TO CHAPTER

SUPPLEMENT TO CHAPTER SUPPLEMENT TO CHAPTER 6 Linear Programming SUPPLEMENT OUTLINE Introduction and Linear Programming Model, 2 Graphical Solution Method, 5 Computer Solutions, 14 Sensitivity Analysis, 17 Key Terms, 22 Solved

More information

The Simplex Method. yyye

The Simplex Method.  yyye Yinyu Ye, MS&E, Stanford MS&E310 Lecture Note #05 1 The Simplex Method Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/

More information

Outline. Linear Programming (LP): Simplex Search. Simplex: An Extreme-Point Search Algorithm. Basic Solutions

Outline. Linear Programming (LP): Simplex Search. Simplex: An Extreme-Point Search Algorithm. Basic Solutions Outline Linear Programming (LP): Simplex Search Benoît Chachuat McMaster University Department of Chemical Engineering ChE 4G03: Optimization in Chemical Engineering 1 Basic Solutions

More information

Equilibrium computation: Part 1

Equilibrium computation: Part 1 Equilibrium computation: Part 1 Nicola Gatti 1 Troels Bjerre Sorensen 2 1 Politecnico di Milano, Italy 2 Duke University, USA Nicola Gatti and Troels Bjerre Sørensen ( Politecnico di Milano, Italy, Equilibrium

More information

Definition of a Linear Program

Definition of a Linear Program Definition of a Linear Program Definition: A function f(x 1, x,..., x n ) of x 1, x,..., x n is a linear function if and only if for some set of constants c 1, c,..., c n, f(x 1, x,..., x n ) = c 1 x 1

More information

Linear Programming. April 12, 2005

Linear Programming. April 12, 2005 Linear Programming April 1, 005 Parts of this were adapted from Chapter 9 of i Introduction to Algorithms (Second Edition) /i by Cormen, Leiserson, Rivest and Stein. 1 What is linear programming? The first

More information

Can linear programs solve NP-hard problems?

Can linear programs solve NP-hard problems? Can linear programs solve NP-hard problems? p. 1/9 Can linear programs solve NP-hard problems? Ronald de Wolf Linear programs Can linear programs solve NP-hard problems? p. 2/9 Can linear programs solve

More information

Simplex Method. Introduction:

Simplex Method. Introduction: Introduction: In the previous chapter, we discussed about the graphical method for solving linear programming problems. Although the graphical method is an invaluable aid to understand the properties of

More information

Lecture 1: Linear Programming Models. Readings: Chapter 1; Chapter 2, Sections 1&2

Lecture 1: Linear Programming Models. Readings: Chapter 1; Chapter 2, Sections 1&2 Lecture 1: Linear Programming Models Readings: Chapter 1; Chapter 2, Sections 1&2 1 Optimization Problems Managers, planners, scientists, etc., are repeatedly faced with complex and dynamic systems which

More information

Linear Programming. Solving LP Models Using MS Excel, 18

Linear Programming. Solving LP Models Using MS Excel, 18 SUPPLEMENT TO CHAPTER SIX Linear Programming SUPPLEMENT OUTLINE Introduction, 2 Linear Programming Models, 2 Model Formulation, 4 Graphical Linear Programming, 5 Outline of Graphical Procedure, 5 Plotting

More information

CHAPTER 17. Linear Programming: Simplex Method

CHAPTER 17. Linear Programming: Simplex Method CHAPTER 17 Linear Programming: Simplex Method CONTENTS 17.1 AN ALGEBRAIC OVERVIEW OF THE SIMPLEX METHOD Algebraic Properties of the Simplex Method Determining a Basic Solution Basic Feasible Solution 17.2

More information

Maintenance optimization in nuclear power plants modelling, analysis, and experimentation. Karin Kvickström

Maintenance optimization in nuclear power plants modelling, analysis, and experimentation. Karin Kvickström MASTER STHESIS Maintenance optimization in nuclear power plants modelling, analysis, and experimentation Karin Kvickström DepartmentofMathematicalSciences CHALMERS UNIVERSITY OF TECHNOLOGY UNIVERSITY OF

More information

Solving Linear and Integer Programs

Solving Linear and Integer Programs Solving Linear and Integer Programs Robert E. Bixby ILOG, Inc. and Rice University Ed Rothberg ILOG, Inc. Outline Linear Programming: Bob Bixby Example and introduction to basic LP, including duality Primal

More information

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora Scribe: One of the running themes in this course is the notion of

More information

Linear Inequalities and Linear Programming. Systems of Linear Inequalities in Two Variables

Linear Inequalities and Linear Programming. Systems of Linear Inequalities in Two Variables Linear Inequalities and Linear Programming 5.1 Systems of Linear Inequalities 5.2 Linear Programming Geometric Approach 5.3 Geometric Introduction to Simplex Method 5.4 Maximization with constraints 5.5

More information

3.5 Reduction to Standard Form

3.5 Reduction to Standard Form 3.5 Reduction to Standard Form 77 Exercise 3-4-4. Read the following statements carefully to see whether it is true or false. Justify your answer by constructing a simple illustrative example (for false),

More information

Chapter 1, Operations Research (OR)

Chapter 1, Operations Research (OR) Chapter 1, Operations Research (OR) Kent Andersen February 7, 2007 The term Operations Research refers to research on operations. In other words, the study of how to operate something in the best possible

More information

24. The Branch and Bound Method

24. The Branch and Bound Method 24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no

More information

Linear Programming Exercises. Week 1. Exercise 1 Consider the case of the Betta Machine Products Company described in the lecture notes.

Linear Programming Exercises. Week 1. Exercise 1 Consider the case of the Betta Machine Products Company described in the lecture notes. Linear Programming Exercises Week 1 Exercise 1 Consider the case of the Betta Machine Products Company described in the lecture notes. (a) Use a graphical method to obtain the new optimal solution when

More information

Mathematical finance and linear programming (optimization)

Mathematical finance and linear programming (optimization) Mathematical finance and linear programming (optimization) Geir Dahl September 15, 2009 1 Introduction The purpose of this short note is to explain how linear programming (LP) (=linear optimization) may

More information

Lecture 2: August 29. Linear Programming (part I)

Lecture 2: August 29. Linear Programming (part I) 10-725: Convex Optimization Fall 2013 Lecture 2: August 29 Lecturer: Barnabás Póczos Scribes: Samrachana Adhikari, Mattia Ciollaro, Fabrizio Lecci Note: LaTeX template courtesy of UC Berkeley EECS dept.

More information

Solving Mixed Integer Linear Programs Using Branch and Cut Algorithm

Solving Mixed Integer Linear Programs Using Branch and Cut Algorithm 1 Solving Mixed Integer Linear Programs Using Branch and Cut Algorithm by Shon Albert A Project Submitted to the Graduate Faculty of North Carolina State University in Partial Fulfillment of the Requirements

More information

max cx s.t. Ax c where the matrix A, cost vector c and right hand side b are given and x is a vector of variables. For this example we have x

max cx s.t. Ax c where the matrix A, cost vector c and right hand side b are given and x is a vector of variables. For this example we have x Linear Programming Linear programming refers to problems stated as maximization or minimization of a linear function subject to constraints that are linear equalities and inequalities. Although the study

More information

Applied Algorithm Design Lecture 5

Applied Algorithm Design Lecture 5 Applied Algorithm Design Lecture 5 Pietro Michiardi Eurecom Pietro Michiardi (Eurecom) Applied Algorithm Design Lecture 5 1 / 86 Approximation Algorithms Pietro Michiardi (Eurecom) Applied Algorithm Design

More information

5.1 Bipartite Matching

5.1 Bipartite Matching CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the Ford-Fulkerson

More information

1 Polyhedra and Linear Programming

1 Polyhedra and Linear Programming CS 598CSC: Combinatorial Optimization Lecture date: January 21, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im 1 Polyhedra and Linear Programming In this lecture, we will cover some basic material

More information

Graphical method. plane. (for max) and down (for min) until it touches the set of feasible solutions. Graphical method

Graphical method. plane. (for max) and down (for min) until it touches the set of feasible solutions. Graphical method The graphical method of solving linear programming problems can be applied to models with two decision variables. This method consists of two steps (see also the first lecture): 1 Draw the set of feasible

More information

Scheduling and (Integer) Linear Programming

Scheduling and (Integer) Linear Programming Scheduling and (Integer) Linear Programming Christian Artigues LAAS - CNRS & Université de Toulouse, France artigues@laas.fr Master Class CPAIOR 2012 - Nantes Christian Artigues Scheduling and (Integer)

More information

Chapter 13: Binary and Mixed-Integer Programming

Chapter 13: Binary and Mixed-Integer Programming Chapter 3: Binary and Mixed-Integer Programming The general branch and bound approach described in the previous chapter can be customized for special situations. This chapter addresses two special situations:

More information

International Doctoral School Algorithmic Decision Theory: MCDA and MOO

International Doctoral School Algorithmic Decision Theory: MCDA and MOO International Doctoral School Algorithmic Decision Theory: MCDA and MOO Lecture 2: Multiobjective Linear Programming Department of Engineering Science, The University of Auckland, New Zealand Laboratoire

More information

Linear Programming: Chapter 5 Duality

Linear Programming: Chapter 5 Duality Linear Programming: Chapter 5 Duality Robert J. Vanderbei October 17, 2007 Operations Research and Financial Engineering Princeton University Princeton, NJ 08544 http://www.princeton.edu/ rvdb Resource

More information

Basic concepts of linear optimization

Basic concepts of linear optimization Chapter 1 Basic concepts of linear optimization Overview In 1827, the French mathematician Jean-Baptiste Joseph Fourier (1768 1830) published a method for solving systems of linear inequalities. This publication

More information

6. Mixed Integer Linear Programming

6. Mixed Integer Linear Programming 6. Mixed Integer Linear Programming Javier Larrosa Albert Oliveras Enric Rodríguez-Carbonell Problem Solving and Constraint Programming (RPAR) Session 6 p.1/40 Mixed Integer Linear Programming A mixed

More information

2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines 2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

More information

GRAPH THEORY and APPLICATIONS. Trees

GRAPH THEORY and APPLICATIONS. Trees GRAPH THEORY and APPLICATIONS Trees Properties Tree: a connected graph with no cycle (acyclic) Forest: a graph with no cycle Paths are trees. Star: A tree consisting of one vertex adjacent to all the others.

More information

56:171 Operations Research Final Examination Solution Fall 2001

56:171 Operations Research Final Examination Solution Fall 2001 56:171 Operations Research Final Examination Solution Fall 2001 Write your name on the first page, and initial the other pages. Answer both Parts A and B, and select any 4 (out of 5) problems from Part

More information

1 Unrelated Parallel Machine Scheduling

1 Unrelated Parallel Machine Scheduling IIIS 014 Spring: ATCS - Selected Topics in Optimization Lecture date: Mar 13, 014 Instructor: Jian Li TA: Lingxiao Huang Scribe: Yifei Jin (Polishing not finished yet.) 1 Unrelated Parallel Machine Scheduling

More information

Minimize subject to. x S R

Minimize subject to. x S R Chapter 12 Lagrangian Relaxation This chapter is mostly inspired by Chapter 16 of [1]. In the previous chapters, we have succeeded to find efficient algorithms to solve several important problems such

More information

By W.E. Diewert. July, Linear programming problems are important for a number of reasons:

By W.E. Diewert. July, Linear programming problems are important for a number of reasons: APPLIED ECONOMICS By W.E. Diewert. July, 3. Chapter : Linear Programming. Introduction The theory of linear programming provides a good introduction to the study of constrained maximization (and minimization)

More information

LECTURE 5: DUALITY AND SENSITIVITY ANALYSIS. 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method

LECTURE 5: DUALITY AND SENSITIVITY ANALYSIS. 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method LECTURE 5: DUALITY AND SENSITIVITY ANALYSIS 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method Introduction to dual linear program Given a constraint matrix A, right

More information

Integer Programming Formulation

Integer Programming Formulation Integer Programming Formulation 1 Integer Programming Introduction When we introduced linear programs in Chapter 1, we mentioned divisibility as one of the LP assumptions. Divisibility allowed us to consider

More information

Readings. D Chapter 1. Lecture 2: Constrained Optimization. Cecilia Fieler. Example: Input Demand Functions. Consumer Problem

Readings. D Chapter 1. Lecture 2: Constrained Optimization. Cecilia Fieler. Example: Input Demand Functions. Consumer Problem Economics 245 January 17, 2012 : Example Readings D Chapter 1 : Example The FOCs are max p ( x 1 + x 2 ) w 1 x 1 w 2 x 2. x 1,x 2 0 p 2 x i w i = 0 for i = 1, 2. These are two equations in two unknowns,

More information

Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi

Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi Lecture - 15 Limited Resource Allocation Today we are going to be talking about

More information

11. APPROXIMATION ALGORITHMS

11. APPROXIMATION ALGORITHMS 11. APPROXIMATION ALGORITHMS load balancing center selection pricing method: vertex cover LP rounding: vertex cover generalized load balancing knapsack problem Lecture slides by Kevin Wayne Copyright 2005

More information

Operation Research. Module 1. Module 2. Unit 1. Unit 2. Unit 3. Unit 1

Operation Research. Module 1. Module 2. Unit 1. Unit 2. Unit 3. Unit 1 Operation Research Module 1 Unit 1 1.1 Origin of Operations Research 1.2 Concept and Definition of OR 1.3 Characteristics of OR 1.4 Applications of OR 1.5 Phases of OR Unit 2 2.1 Introduction to Linear

More information

Min-cost flow problems and network simplex algorithm

Min-cost flow problems and network simplex algorithm Min-cost flow problems and network simplex algorithm The particular structure of some LP problems can be sometimes used for the design of solution techniques more efficient than the simplex algorithm.

More information

Contents. What is Wirtschaftsmathematik?

Contents. What is Wirtschaftsmathematik? Contents. Introduction Modeling cycle SchokoLeb example Graphical procedure Standard-Form of Linear Program Vorlesung, Lineare Optimierung, Sommersemester 04 Page What is Wirtschaftsmathematik? Using mathematical

More information

The multi-integer set cover and the facility terminal cover problem

The multi-integer set cover and the facility terminal cover problem The multi-integer set cover and the facility teral cover problem Dorit S. Hochbaum Asaf Levin December 5, 2007 Abstract The facility teral cover problem is a generalization of the vertex cover problem.

More information

The revenue function, R(x), is the total revenue realized from the sale of x units of the product.

The revenue function, R(x), is the total revenue realized from the sale of x units of the product. Linear Cost, Revenue and Profit Functions: If x is the number of units of a product manufactured or sold at a firm then, The cost function, C(x), is the total cost of manufacturing x units of the product.

More information

Linear Programming: Basic Concepts

Linear Programming: Basic Concepts Linear Programming: Basic Concepts Table of Contents Three Classic Applications of LP The Wyndor Glass Company Product Mix Problem Formulating the Wyndor Problem on a Spreadsheet The Algebraic Model for

More information

Linear Programming Models: Graphical and Computer Methods

Linear Programming Models: Graphical and Computer Methods Linear Programming Models: Graphical and Computer Methods Learning Objectives Students will be able to: 1. Understand the basic assumptions and properties of linear programming (LP). 2. Graphically solve

More information

3 Does the Simplex Algorithm Work?

3 Does the Simplex Algorithm Work? Does the Simplex Algorithm Work? In this section we carefully examine the simplex algorithm introduced in the previous chapter. Our goal is to either prove that it works, or to determine those circumstances

More information

Blending petroleum products at NZ Refining Company

Blending petroleum products at NZ Refining Company Blending petroleum products at NZ Refining Company Geoffrey B. W. Gill Commercial Department NZ Refining Company New Zealand ggill@nzrc.co.nz Abstract There are many petroleum products which New Zealand

More information

Integer programming solution methods - introduction

Integer programming solution methods - introduction Integer programming solution methods - introduction J E Beasley Capital budgeting There are four possible projects, which each run for 3 years and have the following characteristics. Capital requirements

More information