Introduction. Very efficient solution procedure: simplex method.
|
|
- Della Glenn
- 5 years ago
- Views:
Transcription
1 LINEAR PROGRAMMING
2 Introduction Development of linear programming was among the most important scientific advances of mid 20th cent. Most common type of applications: allocate limited resources to competing activities in an optimal way. Linear programming uses a mathematical model. Linear because it requires linear functions. Programming as synonymous of planning. Very efficient solution procedure: simplex method. João Miguel da Costa Sousa / Alexandra Moutinho 31
3 Prototype example Wyndor Glass Co. produces glass products, including windows and glass doors. Plant t 1 produces aluminum frames, Plant 2 produces wood frames and Plant 3 produces glass and assembles. Two new products: Glass door with aluminum framing (Plant 1 and 3). New wood framed glass window (Plant 2 and 3). As the products compete for Plant 3, the most profitable mix of the two products is needed. João Miguel da Costa Sousa / Alexandra Moutinho 32
4 Formulation of the LP problem x 1 = number of batches of doors produced per week x 2 = number of batches of windows produced per week Z = total profit per week (in thousands) Wyndor Glass Co. Product Mix Problem Doors Windows Profit Per Batch $3.000 $5.000 (Batches of 20) Hours available Hours Used Per Batch Produced per week Plant Plant Plant maximize Z= 3x1+ 5x2 subject to: x1 4 2x x1 + 2 x2 18 and x 0, x João Miguel da Costa Sousa / Alexandra Moutinho 33
5 Graphical solution Z= 3x + 5x x2 = x1 + Z ( y= mx+ b) 5 5 Slope of the line is 3/5 Trial and error: Z = 10, 20, 36 Feasible region: satisfies all constraints maximize Z= 3x + 5x subject to: 1 2 x 4 2x x + 2x 18 1 and x 0, x João Miguel da Costa Sousa / Alexandra Moutinho 34
6 Excel Solution Wyndor Glass Co. Product Mix Problem Doors Windows Range Name Cells Profit Per Batch $3.000 $5.000 BatchesProduced C12:D12 Hours Hours HoursAvailable G7:G9 Hours Used Per Batch Produced Used Available HoursUsed E7:E9 Plant <= 4 HoursUsedPerBatchProduced C7:D9 Plant <= 12 ProfitPerBatch C4:D4 Plant <= 18 TotalProfit G12 Doors Windows Total Profit Batches Produced 2 6 $ João Miguel da Costa Sousa / Alexandra Moutinho 35
7 Matlab solution All solvers are designed to minimize the objective function in the optimization toolbox. To maximize f(x), minimize f(x) f(x). solution João Miguel da Costa Sousa / Alexandra Moutinho 36
8 Generalizing the example Prototype t example General problem Production capacities of plants Resources 3 plants m resources Production of products Activities 2 products n activities Production rate of product j, x j Level of activity j, x j Profit Z Overall measure of performance Z The most common type of application of LP involves allocating resources to activities. João Miguel da Costa Sousa / Alexandra Moutinho 37
9 Linear programming gmodel Z = value of overall performance measure. x j = level lof activity j, for j = 1, 2,, n. c j = parameters of Z related to x j. j b j = amount of resource i that is available for allocation of activities, for i = 1, 2,, m. a ij = amount of resource i consumed by each unity of activity j. j Decision variables Parameters João Miguel da Costa Sousa / Alexandra Moutinho 38
10 Standard form of the model Sl Select the values for x 1, x 2,, x n to maximize: Z= c 1x 1+ c 2x 2+ + c nx n subject to: a x + a x + + a x b n n 1 a x + a x + + a x b n n 2 a x + a x + + a x b m1 1 m2 2 mn n m and x1 0, x2 0,, x n 0. João Miguel da Costa Sousa / Alexandra Moutinho 39
11 Allocation of resources to activities Resource Resource Usage per Unit of Activity Activity 1 2 n Amount of Resource available 1 a 11 a 12 a 1n b 1 2 a 21 a 22 a 2n b 2 m a m1 a m2 a mn b m Contribution to Z per unit of activity it c 1 c 2 c n João Miguel da Costa Sousa / Alexandra Moutinho 40
12 Terminology for solutions Solution: any specification of values for the decision variables (x 1, x 2,, x n ). Feasible solution: solution for which all the constraints are satisfied. Infeasible solution: solution for which at least one constraint t is violated. oated Feasible region: collection of all feasible solutions. No feasible solution: no solution satisfies all constraints. João Miguel da Costa Sousa / Alexandra Moutinho 41
13 Terminology for solutions Optimal solution: feasible solution with the most favorable value of the objective function. Most favorable value: largest value if maximizing or smallest value if minimizing. No optimal solutions: (1) no feasible solutions or, (2) )unbounded Z (see next etsde) slide). More than one solution: see next slide. João Miguel da Costa Sousa / Alexandra Moutinho 42
14 Examples of solutions More than one solution Unbounded cost function João Miguel da Costa Sousa / Alexandra Moutinho 43
15 Corner point feasible solution Solution that lies at a corner of feasible region. Best CPF solution must be an optimal solution.. João Miguel da Costa Sousa / Alexandra Moutinho 44
16 Assumptions of linear programming g Proportionality: the contribution of each activity to the value of the objective function Z and left hand side of each functional constraint is proportional to the level of activity x j. Violations: 1) Setup costs. João Miguel da Costa Sousa / Alexandra Moutinho 45
17 Violations of proportionality p 2) Increase of marginal return due to economy of scale (longer production runs, quantity discounts, learning curve effect, etc.). João Miguel da Costa Sousa / Alexandra Moutinho 46
18 Violations of proportionality p 3) Decrease of marginal return due to e.g. marketing costs: to sell more the advertisement grows exponentially. João Miguel da Costa Sousa / Alexandra Moutinho 47
19 Assumptions of linear programming g Additivity: every function in a linear programming model is the sum of the individual contributions. Divisibility: i ibilit decision i variables ibl can have any values. If values are limited to integer values, the problem needs an integer programming model. Certainty: parameters of the model c j, a ij and b i are assumed to be known constants. t In real applications parameters have always some degree of uncertainty tit and sensitivity analysis must be conducted d (identify sensitive parameters). João Miguel da Costa Sousa / Alexandra Moutinho 48
20 The assumptions in perspectivep Mathematical model is idealized representation of real problem. Approximations and simplifying assumptions are required for the model to be tractable. A reasonably high h correlation lti between prediction of model and reality is required. It is common in real applications of LP that almost none of the 4 assumptions holds completely. It is important to analyze how large the disparities are, and maybe use alternative models. Alexandra Moutinho 49
21 Conclusions Linear programming models can be solved using: Spreadsheet as Excel Solver for relatively simple problems Problems with thousands (or even millions!) of decision i variables and/or functional constraints must use modeling languages such as CPLEX/MDL and LINGO/LINDO. Matlab Optimization toolbox (GUI or code). Linear programming solves many problems. However, when one or more assumptions are violated seriously, other programming techniques are needed. João Miguel da Costa Sousa / Alexandra Moutinho 50
22 SIMPLEX METHOD
23 Example revisited Wyndor Glass Co. João Miguel da Costa Sousa / Alexandra Moutinho 52
24 Setting up the simplex method Original form Augmented form Maximize Z= 3x + 5x subject b to 1 2 Maximize Z= 3x + 5x 1 2 x 4 (1) x + x = 4 1 2x x + 2x and x 0, x subject to 1 3 (2) 2x + x = 12 (3) 3x + 2x + x = and x 0, j = 1,2,3,4,5. Convert functional inequality constraints to equivalent equality constraints using slack variables João Miguel da Costa Sousa / Alexandra Moutinho 53 j
25 Setting up the simplex method Slack variable is: Zero: solution lies on constraint boundary; Positive: solution lies on feasible side of constraint; Negative: solution lies on infeasible side of constraint Example p problem has 5 variables and 3 nonredundant equations, and so 2 (5 3) degrees of freedom. Two variables have an arbitrary value. Simplex uses the zero value for these nonbasic variables. The solution for the other three variables (basic variables) is a basic solution. Basic solutions have thus a number of properties. João Miguel da Costa Sousa / Alexandra Moutinho 54
26 Properties of a basic solution Each variable is basic or nonbasic. Number of basic variables is equal to number of functional constraints t (equations). The nonbasic variables are set to zero. Values of basic variables are obtained solving system of equations (functional constraints in augmented form). Set of basic variables are called the basis. If basic variables satisfy the nonnegativity constraints, basic solution is a BF solution. João Miguel da Costa Sousa / Alexandra Moutinho 55
27 Final form Consider the objective function as the new constraint equation: Maximize subject to Z (0) Z 3x1 5x2 = 0 (1) x 1+ x 3 = 4 (2) 2x2+ x4 = 12 (3) 3 x + 2 x + x = 18 and x 0, j= 1,,5. j João Miguel da Costa Sousa / Alexandra Moutinho 56
28 Tabular form (simplex tableau) (a) Algebraic form (b) Tabular Form Basic variable Eq. Coefficient of: Z x 1 x 2 x 3 x 4 x 5 Right side (0) Z 3x 1 5x 2 = 0 Z (0) (1) x 1 + x 3 = 4 x 3 (1) (2) 2x 2 + x 4 = 12 x 4 (2) (3) 3x 1 + 2x 2 + x 5 = 18 x 5 (3) João Miguel da Costa Sousa / Alexandra Moutinho 57
29 Simplex method in tabular form Initialization. Introduce slack variables. Select decision variables to be initial nonbasic variables (=0) and slack variables to be initial basic variables. Initial solution of example: (0, 0, 4, 12, 18) Optimality test. Current BF solution is optimal iff every coefficient in row (0) is nonnegative. If yes, stop; otherwise, iterate to obtain the next BF solution. Example: p coefficients of x 1 and x 2 are 3 and 5. João Miguel da Costa Sousa / Alexandra Moutinho 58
30 Simplex method in tabular form Iteration. Step 1: Determine the entering basic variable, which is the nonbasic variable ibl with the largest negative coefficient. pivot column entering basic variable Basic variable Eq. Coefficient of: Z x 1 x 2 x 3 x 4 x 5 Right side Z (0) x 3 () (1) x 4 (2) x 5 (3) João Miguel da Costa Sousa / Alexandra Moutinho 59
31 Iteration Step 2: Determine the leaving basic variable, by applying minimum ratio test: Basic variable Eq. Coefficient of: Z x 1 x 2 x 3 x 4 x 5 Right side Z (0) x 3 (1) x 4 (2) /2 = 6 pivot row minimum x 5 (3) /2 = 9 pivot number (PN) leaving basic variable replace leaving BV for entering BV in the BV column of the next simplex tableau João Miguel da Costa Sousa / Alexandra Moutinho 60
32 Iteration Step p 3: solve for the new BF solution by using elementary row operations. Iteration Basic variable Eq. Coefficient i of: Z x 1 x 2 x 3 x 4 x 5 Right side Z (0) row with negative coef. 0 x 3 (1) x 4 (2) x 5 (3) Z (0) row with positive coef. 1 x 3 (1) x 2 (2) (PN) x 5 (3) João Miguel da Costa Sousa / Alexandra Moutinho 61
33 Iteration 2: Steps 1 and 2 Optimality test: solution still not optimal one more iteration Iteration Basic variable Eq. Coefficient of: Z x 1 x 2 x 3 x 4 x 5 Right side Ratio Z (0) x 3 (1) /1 = 4 x 2 (2) x 5 (3) /3 = 2 minimum João Miguel da Costa Sousa / Alexandra Moutinho 62
34 Complete set of simplex tableau Iteration Basic variable Eq. Coefficient of: Z x 1 x 2 x 3 x 4 x 5 Right side Z (0) x 3 (1) x 4 (2) x 5 (3) Z (0) x 3 (1) x 2 (2) x 5 (3) Z (0) x 3 (1) /3 1/3 2 x 2 (2) x 1 (3) /3 1/3 2 João Miguel da Costa Sousa / Alexandra Moutinho 63
35 Tie breaking in simplex method Tie for entering basic variable: arbitrary choice; Tie for leaving basic variable: arbitrary choice; No leaving basic variable: ibl unbounded Z, i.e., error in model or computation; Multiple optimal solutions: simplex finds one optimal BF solution; find the others by continuing the algorithm choosing a nonbasic variable with a zero coefficient as the entering BV. João Miguel da Costa Sousa / Alexandra Moutinho 64
36 Adapting to other model forms Equality constraints There is no obvious initial BF solution, so artificial variables and the Big M method are used. Negative g right hand sides: Multiply inequality by 1; Functional constraints in form Surplus and artificial variables / big M method are used. Minimization Maximize Z. João Miguel da Costa Sousa / Alexandra Moutinho 65
37 Artificial variables and Big M method The real problem Maximize Z= 3x + 5x subject to 1 2 x 1 4 2x x + 2 x = and x 0, x The artificial problem Define x = 18 3x 2 x Maximize Z= 3x + 5 x Mx, subject to (1) x 4 (2) 2x 12 (3) 3 x + 2 x (so 3x + 2x + x = 18) and x 0, x 0, x Algebraically eliminate x from equation (0) for proper form. x 5 João Miguel da Costa Sousa / Alexandra Moutinho 66
38 Postoptimality analysis Reoptimization: when the problem changes slightly, new solution is derived from the final simplex tableau. Shadow price for resource i (denoted y i* ) measures the marginal value of this resource, i.e., how much Z can be increased by (slightly) increasing the amount of this resource b i. Example: p recall b i values of Wyndor Glass problem. The final tableau gives y 1* = 0, y 2* = 1.5, y 3* = 1. João Miguel da Costa Sousa / Alexandra Moutinho 67
39 Graphical check Increasing b 2 in 1 unit, the new profit is 37.5 João Miguel da Costa Sousa / Alexandra Moutinho 68
40 Shadow prices Increasing b 2 in 1 unit increases the profit in $1500. Should this be done? Depends on the marginal profitability of other products using that hour time. Shadow prices are part of the sensitivity analysis. Constraint on resource 1 is not binding the optimal solution. There is a surplus of this resource. Resources as this are free goods. Constraints on resources 2 and 3 are binding constraints. They have positive shadow prices and no surplus. Resources are scarce goods. João Miguel da Costa Sousa / Alexandra Moutinho 69
41 Sensitivity analysis Identify sensitive parameters (those that cannot be changed without changing optimal solution). Parameters b i can be analyzed using shadow prices. Parameters c i for 2 variables can be analyzed graphically. Parameters a ij can also be analyzed graphically. For problems with a large number of variables usually only b i and c i are analyzed, because a ij are determined by the technology being used. João Miguel da Costa Sousa / Alexandra Moutinho 70
42 Sensitivity analysis of parameters c i Graphical analysis of Wyndor example: c 1 can have values in [0, 7.5] without changing optimal solution. c 2 can have any value greater than 2 without changing goptimal solution. João Miguel da Costa Sousa / Alexandra Moutinho 71
43 Theory of simplex method Recall the standard form: Maximize Z = c x + c x + + c x subject to a x + a x + + a nxn b a x + a x + + a nxn b a 1 x1 + a 2 x2 + + a x b and x 0, x 0,, x m m mn n m n n n João Miguel da Costa Sousa / Alexandra Moutinho 72
44 Augmented form Maximize subject to Z= c x + + c x + c x + + c x 1 1 n n n+ 1 n+ 1 n n+ m a x + a x + + a x + x = b n n n+ 1 1 a x + a x + + a x + x = b n n n+ 2 2 a x + a x + + a x + x = b and x 0, j= 1,2,, n. j m1 1 m2 2 mn n n+ m m João Miguel da Costa Sousa / Alexandra Moutinho 73
45 Matrix form (standard form) Maximize Z = cx subject to Ax b and x 0 c = [ c1, c2,, c n ], x1 b1 a11 a12 a1 n x = 2 b = 2 a = 21 a22 a2n x, b, A. x n b m a m 1 a m 2 a mn João Miguel da Costa Sousa / Alexandra Moutinho 74
46 Matrix augmented form Introduce d the column vector of slack variables: ibl x s x n + 1 x n+ 2 = x n + m The constraints are (with I (m m) and 0 (1 (n+m))( ): [, ] x = and x AI b 0 xs xs João Miguel da Costa Sousa / Alexandra Moutinho 75
47 Solving for a BF solution One iteration of simplex: The n nonbasic variables are set to zero. The m basic variables are in a column vector denoted as x B. The basic matrix B is obtained from [A, I] by eliminating the columns with coefficients of nonbasic variables. The problem becomes: Bx B = b. The solution for basic variables and the value of the objective function for this basic solution are: x B b c x c B b 1 1 B = and Z = B B = B João Miguel da Costa Sousa / Alexandra Moutinho 76
48 Revised simplex method 1. Initialization (as original): Introduce slack variables x s. Decision variables are initial nonbasic variables. 2. Iteration: Step 1 (as original): Determine entering basic variable (nonbasic variable with the largest negative coefficient). Step 2: Determine leaving basic variable. As original, but computations are simplified. Step 3: Determine new BF solution setting x B = B 1 b. 3. Optimality test: solution is optimal if every coefficient in Z is 0. Computations are simplified. João Miguel da Costa Sousa / Alexandra Moutinho 77
49 Fundamental insight Initial tableau Row 0: Other rows: Combined: Final tableau Row 0: Other rows: Combined: t= [ c 0 0] T =[ A I b ] t c00 = T A I b t* = t+ y* T= [ y* A c y* y* b], y* = cb B T* S* T [ S* A S* S* b], S* B = = = 1 t* y* A cy* y* b = T* S* A S* S* b 1 João Miguel da Costa Sousa / Alexandra Moutinho 78
50 Fundamental insight Optimal performance index: Z*=y*b Optimal p solution: x B=S*b, x nb=0 Shadow prices: y* After any iteration, the coefficients of the slack variables in each equation immediately reveal eal how that equation has been obtained from the initial equations. João Miguel da Costa Sousa / Alexandra Moutinho 79
51 DUALITY THEORY AND SENSITIVITY ANALYSIS
52 Duality theory Every linear programming problem (primal) has a dual problem. Most problem parameters are estimates, others (as resource amounts) represent managerial decisions. The choice of parameter values is made based on a sensitivity analysis. Interpretation and implementation of sensitivity analysis are key uses of duality theory. João Miguel da Costa Sousa / Alexandra Moutinho 81
53 Primal and Dual Problems Primal problem (standard form) Maximize subject to n j= 1 Z n = j=1 c x ax b, for i= 1,2,, m ij j i j j Minimize subject to m Dual problem W m = i=1 yb and x 0, 0 for j= 12 1,2,, n. and y 0, for i = 1,2, 12, m. j i= 1 ya c, for j= 1,2,, n i ij j i i i João Miguel da Costa Sousa / Alexandra Moutinho 82
54 Example: Wyndor Glass Co. Primal problem [ ] x1 Maximize Z = 3 5, x2 subject to x x x1 0 and. x 2 0 Dual problem 4 Minimize Z= y1 y2 y3 12, subject to y1 y2 y [ ] and y1 y2 y3 [ 000. ] João Miguel da Costa Sousa / Alexandra Moutinho 83
55 Primal dual table for LP Primal problem Coefficient of: x 1 x 2 x n Right side Coeff ficient of: y 1 a 11 a 12 a 1n b 1 y 2 a 21 a 22 a 2n b 2 y m a m1 a m2 a mn b m Righ side Coef object (M fficients o ive functi inimize) f on Dual pro oblem t c 1 c 2 c n Coefficients of objective function (Maximize) João Miguel da Costa Sousa / Alexandra Moutinho 84
56 Example: Wyndor Glass Co. x 1 x 2 Right side y y y Right side 3 5 João Miguel da Costa Sousa / Alexandra Moutinho 85
57 Duality theory General relations between primal and dual problems: 1. The parameters for a (functional) constraint in either problem are the coefficients of a variable in the other problem. 2. The coefficients in the objective function of either problem pobe are aethe right hand dsdes sides for the eother problem. João Miguel da Costa Sousa / Alexandra Moutinho 86
58 Primal dual relationships Weak duality property: If x is a feasible solution for the primal problem and y is a feasible solution for the dual problem, then cx yb Strong duality property: If x * is an optimal solution for the eprimal pobe problem and dyy * is an optimal solution o for the dual problem, then cx * = y * b João Miguel da Costa Sousa / Alexandra Moutinho 87
59 Primal dual relationships Complementary solutions property: At each iteration, the simplex method identifies a CPF solution x for the primal problem and a complementary solution y for the dual problem, where cx = yb If x is not optimal for the primal problem, then y is not feasible for the dual problem. João Miguel da Costa Sousa / Alexandra Moutinho 88
60 Primal dual relationships Complementary optimal solutions property: At the final iteration, the simplex method identifies an optimal solution x* for the primal problem and a complementary optimal solution y* for the dual problem, where cx* = y*b The y i * are the shadow prices for the primal problem. João Miguel da Costa Sousa / Alexandra Moutinho 89
61 Primal dual relationships Symmetry y yproperty: p For any primal problem and its dual problem, all relationships between them must be symmetric because the dual of this dual problem is this primal problem. Duality theorem: The following are the only possible relationships between the primal and dual problems: 1. If one problem has feasible solutions and a bounded objective function, then so does the other problem, so both the weak and strong duality properties are applicable. João Miguel da Costa Sousa / Alexandra Moutinho 90
62 Primal dual relationships 2. If one problem has feasible solutions and an unbounded objective function, then the other problem has no feasible solution. 3. If one problem has no feasible solutions, then the other problem has either no feasible solutions lti or an unbounded d objective function. João Miguel da Costa Sousa / Alexandra Moutinho 91
63 Primal dual relationships Relationships between complementary basic solutions Primal basic solution Complementary Both basic solutions dual basic solution Primal feasible? Dual feasible? Suboptimal Superoptimal Yes No Optimal Optimal Yes Yes Superoptimal Suboptimal No Yes Neither feasible nor superoptimal Neither feasible nor superoptimal No No João Miguel da Costa Sousa / Alexandra Moutinho 92
64 Primal dual relationships João Miguel da Costa Sousa / Alexandra Moutinho 93
65 Applications of duality theory If f the number of functional constraints m is bigger than the number of variables n, applying the SM directly to the dual problem will achieve a substantial reduction in computational effort. Evaluating a proposed solution for the primal problem. i) if cx=yb, x and y must be optimal even without applying the SM; ii) if cx<yb, yb provides an upper bound on the optimal value of Z. Economic interpretation João Miguel da Costa Sousa / Alexandra Moutinho 94
66 Duality theory in sensitivity analysis Sensitivity analysis investigates the effect in the optimal solution of changing parameters a ij, b i, c j. It can be easier to study these effects in the dual problem: Optimal solution of the dual problem are the shadow prices of the primal problem. Changes in coefficients of a nonbasic variable. Only changes one constraint in the dual problem. If this constraint is satisfied the solution is still optimal. Introducing a new variable. Only introduces a new constraint in the dual problem. If the dual problem is still feasible, solution is still optimal. João Miguel da Costa Sousa / Alexandra Moutinho 95
67 The essence of sensitivity analysis One assumption of LP is that all the parameters of the model (a ij, b i and c j ) are known constants. Actually: The parameters values used are just estimates based on a prediction of future conditions; The data may represent deliberate overestimates or underestimates to protect the interests of the estimators. An optimal solution is optimal only with respect to the specific model being used to represent the real problem sensitivity analysis is crucial! João Miguel da Costa Sousa / Alexandra Moutinho 96
68 Simplex tableau with parameter changes What h changes in the simplex tableau if changes are made in the model parameters, namely b b, c c, A A? Coefficient of: Eq. Z Original variables Slack variables Right side New initial (0) 1 c 0 0 tableau (1,2,,m) 0 A I b Revised final tableau (0) 1 z* c= y* A c y* (1,2,,m) 0 A* = S* A S* Z* = y* b b* = S* b João Miguel da Costa Sousa / Alexandra Moutinho 97
69 Applying sensitivity analysis Changes in b i : Allowable range: range of values for which the current optimal BF solution remains feasible (find range of b i such that b* = S* b 0, assuming this is the only change in the model). The shadow price for b i remains valid if b i stays within this interval. The 100% rule for simultaneous changes in RHS: the shadow prices remain valid as long as the changes are not too large. If the sum of the % changes does not exceed 100%, the shadow prices will definitely still be valid. João Miguel da Costa Sousa / Alexandra Moutinho 98
70 Applying sensitivity analysis Changes in coefficients i of nonbasicvariable: i bl Allowable range to stay optimal: range of values over which the current optimal solution remains optimal (find c j y*a j, assuming this is the only change in the model). The 100% rule for simultaneous s changes in objective e function coefficients: if the sum of the % changes does not exceed 100%, the original optimal solution will definitely still be valid. Introduction of a new variable: Same as above. João Miguel da Costa Sousa / Alexandra Moutinho 99
71 Other simplex algorithms Dual simplex method Modification useful for sensitivity analysis, based on the duality theory. Parametric linear programming Et Extension for systematic ti sensitivity analysis. Vary one or more parameters continuously over some interval(s) to see when the optimal solution changes. Upper bound technique A simplex version for dealing with decision variables having upper bounds: x j u j, where u j is the maximum feasible value of x j. João Miguel da Costa Sousa / Alexandra Moutinho 100
LINEAR PROGRAMMING. Introduction
LINEAR PROGRAMMING Introduction Development of linear programming was among the most important scientific advances of mid-20th cent. Most common type of applications: allocate limited resources to competing
More informationChap6 Duality Theory and Sensitivity Analysis
Chap6 Duality Theory and Sensitivity Analysis The rationale of duality theory Max 4x 1 + x 2 + 5x 3 + 3x 4 S.T. x 1 x 2 x 3 + 3x 4 1 5x 1 + x 2 + 3x 3 + 8x 4 55 x 1 + 2x 2 + 3x 3 5x 4 3 x 1 ~x 4 0 If we
More informationWorked Examples for Chapter 5
Worked Examples for Chapter 5 Example for Section 5.2 Construct the primal-dual table and the dual problem for the following linear programming model fitting our standard form. Maximize Z = 5 x 1 + 4 x
More informationLinear programming I João Carlos Lourenço
Decision Support Models Linear programming I João Carlos Lourenço joao.lourenco@ist.utl.pt Academic year 2012/2013 Readings: Hillier, F.S., Lieberman, G.J., 2010. Introduction to Operations Research, 9th
More informationThe use of shadow price is an example of sensitivity analysis. Duality theory can be applied to do other kind of sensitivity analysis:
Sensitivity analysis The use of shadow price is an example of sensitivity analysis. Duality theory can be applied to do other kind of sensitivity analysis: Changing the coefficient of a nonbasic variable
More informationIntroduction to Operations Research
Introduction to Operations Research Linear Programming Solving Optimization Problems Linear Problems Non-Linear Problems Combinatorial Problems Linear Problems Special form of mathematical programming
More informationSimplex Method for LP (II)
Simplex Method for LP (II) Xiaoxi Li Wuhan University Sept. 27, 2017 (week 4) Operations Research (Li, X.) Simplex Method for LP (II) Sept. 27, 2017 (week 4) 1 / 31 Organization of this lecture Contents:
More informationIntroduction to Operations Research. Linear Programming
Introduction to Operations Research Linear Programming Solving Optimization Problems Linear Problems Non-Linear Problems Combinatorial Problems Linear Problems Special form of mathematical programming
More informationISE 330 Introduction to Operations Research: Deterministic Models. What is Linear Programming? www-scf.usc.edu/~ise330/2007. August 29, 2007 Lecture 2
ISE 330 Introduction to Operations Research: Deterministic Models www-scf.usc.edu/~ise330/007 August 9, 007 Lecture What is Linear Programming? Linear Programming provides methods for allocating limited
More information21. Solve the LP given in Exercise 19 using the big-m method discussed in Exercise 20.
Extra Problems for Chapter 3. Linear Programming Methods 20. (Big-M Method) An alternative to the two-phase method of finding an initial basic feasible solution by minimizing the sum of the artificial
More informationTIM 206 Lecture 3: The Simplex Method
TIM 206 Lecture 3: The Simplex Method Kevin Ross. Scribe: Shane Brennan (2006) September 29, 2011 1 Basic Feasible Solutions Have equation Ax = b contain more columns (variables) than rows (constraints),
More informationLinear Programming. H. R. Alvarez A., Ph. D. 1
Linear Programming H. R. Alvarez A., Ph. D. 1 Introduction It is a mathematical technique that allows the selection of the best course of action defining a program of feasible actions. The objective of
More informationSensitivity Analysis and Duality in LP
Sensitivity Analysis and Duality in LP Xiaoxi Li EMS & IAS, Wuhan University Oct. 13th, 2016 (week vi) Operations Research (Li, X.) Sensitivity Analysis and Duality in LP Oct. 13th, 2016 (week vi) 1 /
More informationReview Solutions, Exam 2, Operations Research
Review Solutions, Exam 2, Operations Research 1. Prove the weak duality theorem: For any x feasible for the primal and y feasible for the dual, then... HINT: Consider the quantity y T Ax. SOLUTION: To
More informationFarkas Lemma, Dual Simplex and Sensitivity Analysis
Summer 2011 Optimization I Lecture 10 Farkas Lemma, Dual Simplex and Sensitivity Analysis 1 Farkas Lemma Theorem 1. Let A R m n, b R m. Then exactly one of the following two alternatives is true: (i) x
More informationYinyu Ye, MS&E, Stanford MS&E310 Lecture Note #06. The Simplex Method
The Simplex Method Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye (LY, Chapters 2.3-2.5, 3.1-3.4) 1 Geometry of Linear
More informationSummary of the simplex method
MVE165/MMG630, The simplex method; degeneracy; unbounded solutions; infeasibility; starting solutions; duality; interpretation Ann-Brith Strömberg 2012 03 16 Summary of the simplex method Optimality condition:
More informationPart 1. The Review of Linear Programming
In the name of God Part 1. The Review of Linear Programming 1.5. Spring 2010 Instructor: Dr. Masoud Yaghini Outline Introduction Formulation of the Dual Problem Primal-Dual Relationship Economic Interpretation
More informationEND3033 Operations Research I Sensitivity Analysis & Duality. to accompany Operations Research: Applications and Algorithms Fatih Cavdur
END3033 Operations Research I Sensitivity Analysis & Duality to accompany Operations Research: Applications and Algorithms Fatih Cavdur Introduction Consider the following problem where x 1 and x 2 corresponds
More informationGauss-Jordan Elimination for Solving Linear Equations Example: 1. Solve the following equations: (3)
The Simple Method Gauss-Jordan Elimination for Solving Linear Equations Eample: Gauss-Jordan Elimination Solve the following equations: + + + + = 4 = = () () () - In the first step of the procedure, we
More information"SYMMETRIC" PRIMAL-DUAL PAIR
"SYMMETRIC" PRIMAL-DUAL PAIR PRIMAL Minimize cx DUAL Maximize y T b st Ax b st A T y c T x y Here c 1 n, x n 1, b m 1, A m n, y m 1, WITH THE PRIMAL IN STANDARD FORM... Minimize cx Maximize y T b st Ax
More informationStandard Form An LP is in standard form when: All variables are non-negativenegative All constraints are equalities Putting an LP formulation into sta
Chapter 4 Linear Programming: The Simplex Method An Overview of the Simplex Method Standard Form Tableau Form Setting Up the Initial Simplex Tableau Improving the Solution Calculating the Next Tableau
More informationMATH2070 Optimisation
MATH2070 Optimisation Linear Programming Semester 2, 2012 Lecturer: I.W. Guo Lecture slides courtesy of J.R. Wishart Review The standard Linear Programming (LP) Problem Graphical method of solving LP problem
More information3. Duality: What is duality? Why does it matter? Sensitivity through duality.
1 Overview of lecture (10/5/10) 1. Review Simplex Method 2. Sensitivity Analysis: How does solution change as parameters change? How much is the optimal solution effected by changing A, b, or c? How much
More informationis called an integer programming (IP) problem. model is called a mixed integer programming (MIP)
INTEGER PROGRAMMING Integer Programming g 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 informationThe Graphical Method & Algebraic Technique for Solving LP s. Métodos Cuantitativos M. En C. Eduardo Bustos Farías 1
The Graphical Method & Algebraic Technique for Solving LP s Métodos Cuantitativos M. En C. Eduardo Bustos Farías The Graphical Method for Solving LP s If LP models have only two variables, they can be
More informationBrief summary of linear programming and duality: Consider the linear program in standard form. (P ) min z = cx. x 0. (D) max yb. z = c B x B + c N x N
Brief summary of linear programming and duality: Consider the linear program in standard form (P ) min z = cx s.t. Ax = b x 0 where A R m n, c R 1 n, x R n 1, b R m 1,and its dual (D) max yb s.t. ya c.
More information1. Algebraic and geometric treatments Consider an LP problem in the standard form. x 0. Solutions to the system of linear equations
The Simplex Method Most textbooks in mathematical optimization, especially linear programming, deal with the simplex method. In this note we study the simplex method. It requires basically elementary linear
More information2. Linear Programming Problem
. Linear Programming Problem. Introduction to Linear Programming Problem (LPP). When to apply LPP or Requirement for a LPP.3 General form of LPP. Assumptions in LPP. Applications of Linear Programming.6
More informationSlack Variable. Max Z= 3x 1 + 4x 2 + 5X 3. Subject to: X 1 + X 2 + X x 1 + 4x 2 + X X 1 + X 2 + 4X 3 10 X 1 0, X 2 0, X 3 0
Simplex Method Slack Variable Max Z= 3x 1 + 4x 2 + 5X 3 Subject to: X 1 + X 2 + X 3 20 3x 1 + 4x 2 + X 3 15 2X 1 + X 2 + 4X 3 10 X 1 0, X 2 0, X 3 0 Standard Form Max Z= 3x 1 +4x 2 +5X 3 + 0S 1 + 0S 2
More informationF 1 F 2 Daily Requirement Cost N N N
Chapter 5 DUALITY 5. The Dual Problems Every linear programming problem has associated with it another linear programming problem and that the two problems have such a close relationship that whenever
More informationNONLINEAR. (Hillier & Lieberman Introduction to Operations Research, 8 th edition)
NONLINEAR PROGRAMMING (Hillier & Lieberman Introduction to Operations Research, 8 th edition) Nonlinear Programming g Linear programming has a fundamental role in OR. In linear programming all its functions
More informationSpecial cases of linear programming
Special cases of linear programming Infeasible solution Multiple solution (infinitely many solution) Unbounded solution Degenerated solution Notes on the Simplex tableau 1. The intersection of any basic
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 5 Linear programming duality and sensitivity analysis
MVE165/MMG631 Linear and integer optimization with applications Lecture 5 Linear programming duality and sensitivity analysis Ann-Brith Strömberg 2017 03 29 Lecture 4 Linear and integer optimization with
More information4. Duality and Sensitivity
4. Duality and Sensitivity For every instance of an LP, there is an associated LP known as the dual problem. The original problem is known as the primal problem. There are two de nitions of the dual pair
More informationIE 400: Principles of Engineering Management. Simplex Method Continued
IE 400: Principles of Engineering Management Simplex Method Continued 1 Agenda Simplex for min problems Alternative optimal solutions Unboundedness Degeneracy Big M method Two phase method 2 Simplex for
More informationIntroduction to the Simplex Algorithm Active Learning Module 3
Introduction to the Simplex Algorithm Active Learning Module 3 J. René Villalobos and Gary L. Hogg Arizona State University Paul M. Griffin Georgia Institute of Technology Background Material Almost any
More informationTHE UNIVERSITY OF HONG KONG DEPARTMENT OF MATHEMATICS. Operations Research I
LN/MATH2901/CKC/MS/2008-09 THE UNIVERSITY OF HONG KONG DEPARTMENT OF MATHEMATICS Operations Research I Definition (Linear Programming) A linear programming (LP) problem is characterized by linear functions
More informationChapter 4 The Simplex Algorithm Part I
Chapter 4 The Simplex Algorithm Part I Based on Introduction to Mathematical Programming: Operations Research, Volume 1 4th edition, by Wayne L. Winston and Munirpallam Venkataramanan Lewis Ntaimo 1 Modeling
More information+ 5x 2. = x x. + x 2. Transform the original system into a system x 2 = x x 1. = x 1
University of California, Davis Department of Agricultural and Resource Economics ARE 5 Optimization with Economic Applications Lecture Notes Quirino Paris The Pivot Method for Solving Systems of Equations...................................
More informationLinear Programming: Chapter 5 Duality
Linear Programming: Chapter 5 Duality Robert J. Vanderbei September 30, 2010 Slides last edited on October 5, 2010 Operations Research and Financial Engineering Princeton University Princeton, NJ 08544
More informationOPRE 6201 : 3. Special Cases
OPRE 6201 : 3. Special Cases 1 Initialization: The Big-M Formulation Consider the linear program: Minimize 4x 1 +x 2 3x 1 +x 2 = 3 (1) 4x 1 +3x 2 6 (2) x 1 +2x 2 3 (3) x 1, x 2 0. Notice that there are
More informationSystems Analysis in Construction
Systems Analysis in Construction CB312 Construction & Building Engineering Department- AASTMT by A h m e d E l h a k e e m & M o h a m e d S a i e d 3. Linear Programming Optimization Simplex Method 135
More informationLinear Programming in Matrix Form
Linear Programming in Matrix Form Appendix B We first introduce matrix concepts in linear programming by developing a variation of the simplex method called the revised simplex method. This algorithm,
More informationIn Chapters 3 and 4 we introduced linear programming
SUPPLEMENT The Simplex Method CD3 In Chapters 3 and 4 we introduced linear programming and showed how models with two variables can be solved graphically. We relied on computer programs (WINQSB, Excel,
More informationA Review of Linear Programming
A Review of Linear Programming Instructor: Farid Alizadeh IEOR 4600y Spring 2001 February 14, 2001 1 Overview In this note we review the basic properties of linear programming including the primal simplex
More informationDr. S. Bourazza Math-473 Jazan University Department of Mathematics
Dr. Said Bourazza Department of Mathematics Jazan University 1 P a g e Contents: Chapter 0: Modelization 3 Chapter1: Graphical Methods 7 Chapter2: Simplex method 13 Chapter3: Duality 36 Chapter4: Transportation
More informationOptimisation. 3/10/2010 Tibor Illés Optimisation
Optimisation Lectures 3 & 4: Linear Programming Problem Formulation Different forms of problems, elements of the simplex algorithm and sensitivity analysis Lecturer: Tibor Illés tibor.illes@strath.ac.uk
More informationNote 3: LP Duality. If the primal problem (P) in the canonical form is min Z = n (1) then the dual problem (D) in the canonical form is max W = m (2)
Note 3: LP Duality If the primal problem (P) in the canonical form is min Z = n j=1 c j x j s.t. nj=1 a ij x j b i i = 1, 2,..., m (1) x j 0 j = 1, 2,..., n, then the dual problem (D) in the canonical
More informationDuality Theory, Optimality Conditions
5.1 Duality Theory, Optimality Conditions Katta G. Murty, IOE 510, LP, U. Of Michigan, Ann Arbor We only consider single objective LPs here. Concept of duality not defined for multiobjective LPs. Every
More informationMATH 445/545 Test 1 Spring 2016
MATH 445/545 Test Spring 06 Note the problems are separated into two sections a set for all students and an additional set for those taking the course at the 545 level. Please read and follow all of these
More informationDr. Maddah ENMG 500 Engineering Management I 10/21/07
Dr. Maddah ENMG 500 Engineering Management I 10/21/07 Computational Procedure of the Simplex Method The optimal solution of a general LP problem is obtained in the following steps: Step 1. Express the
More informationΩ R n is called the constraint set or feasible set. x 1
1 Chapter 5 Linear Programming (LP) General constrained optimization problem: minimize subject to f(x) x Ω Ω R n is called the constraint set or feasible set. any point x Ω is called a feasible point We
More informationSensitivity Analysis and Duality
Sensitivity Analysis and Duality Part II Duality Based on Chapter 6 Introduction to Mathematical Programming: Operations Research, Volume 1 4th edition, by Wayne L. Winston and Munirpallam Venkataramanan
More informationFormulating and Solving a Linear Programming Model for Product- Mix Linear Problems with n Products
Formulating and Solving a Linear Programming Model for Product- Mix Linear Problems with n Products Berhe Zewde Aregawi Head, Quality Assurance of College of Natural and Computational Sciences Department
More informationMAT016: Optimization
MAT016: Optimization M.El Ghami e-mail: melghami@ii.uib.no URL: http://www.ii.uib.no/ melghami/ March 29, 2011 Outline for today The Simplex method in matrix notation Managing a production facility The
More informationII. Analysis of Linear Programming Solutions
Optimization Methods Draft of August 26, 2005 II. Analysis of Linear Programming Solutions Robert Fourer Department of Industrial Engineering and Management Sciences Northwestern University Evanston, Illinois
More informationSEN301 OPERATIONS RESEARCH I LECTURE NOTES
SEN30 OPERATIONS RESEARCH I LECTURE NOTES SECTION II (208-209) Y. İlker Topcu, Ph.D. & Özgür Kabak, Ph.D. Acknowledgements: We would like to acknowledge Prof. W.L. Winston's "Operations Research: Applications
More informationAnswer the following questions: Q1: Choose the correct answer ( 20 Points ):
Benha University Final Exam. (ختلفات) Class: 2 rd Year Students Subject: Operations Research Faculty of Computers & Informatics Date: - / 5 / 2017 Time: 3 hours Examiner: Dr. El-Sayed Badr Answer the following
More informationMATH 445/545 Homework 2: Due March 3rd, 2016
MATH 445/545 Homework 2: Due March 3rd, 216 Answer the following questions. Please include the question with the solution (write or type them out doing this will help you digest the problem). I do not
More informationCSCI5654 (Linear Programming, Fall 2013) Lecture-8. Lecture 8 Slide# 1
CSCI5654 (Linear Programming, Fall 2013) Lecture-8 Lecture 8 Slide# 1 Today s Lecture 1. Recap of dual variables and strong duality. 2. Complementary Slackness Theorem. 3. Interpretation of dual variables.
More informationOPERATIONS RESEARCH. Michał Kulej. Business Information Systems
OPERATIONS RESEARCH Michał Kulej Business Information Systems The development of the potential and academic programmes of Wrocław University of Technology Project co-financed by European Union within European
More informationLINEAR PROGRAMMING 2. In many business and policy making situations the following type of problem is encountered:
LINEAR PROGRAMMING 2 In many business and policy making situations the following type of problem is encountered: Maximise an objective subject to (in)equality constraints. Mathematical programming provides
More informationAM 121: Intro to Optimization Models and Methods
AM 121: Intro to Optimization Models and Methods Fall 2017 Lecture 2: Intro to LP, Linear algebra review. Yiling Chen SEAS Lecture 2: Lesson Plan What is an LP? Graphical and algebraic correspondence Problems
More informationMath Models of OR: Sensitivity Analysis
Math Models of OR: Sensitivity Analysis John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 8 USA October 8 Mitchell Sensitivity Analysis / 9 Optimal tableau and pivot matrix Outline Optimal
More informationLinear Programming Duality P&S Chapter 3 Last Revised Nov 1, 2004
Linear Programming Duality P&S Chapter 3 Last Revised Nov 1, 2004 1 In this section we lean about duality, which is another way to approach linear programming. In particular, we will see: How to define
More informationWeek 3: Simplex Method I
Week 3: Simplex Method I 1 1. Introduction The simplex method computations are particularly tedious and repetitive. It attempts to move from one corner point of the solution space to a better corner point
More informationLecture 4: Algebra, Geometry, and Complexity of the Simplex Method. Reading: Sections 2.6.4, 3.5,
Lecture 4: Algebra, Geometry, and Complexity of the Simplex Method Reading: Sections 2.6.4, 3.5, 10.2 10.5 1 Summary of the Phase I/Phase II Simplex Method We write a typical simplex tableau as z x 1 x
More informationDuality in LPP Every LPP called the primal is associated with another LPP called dual. Either of the problems is primal with the other one as dual. The optimal solution of either problem reveals the information
More informationGraphical and Computer Methods
Chapter 7 Linear Programming Models: Graphical and Computer Methods Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna 2008 Prentice-Hall, Inc. Introduction Many management
More informationPrelude to the Simplex Algorithm. The Algebraic Approach The search for extreme point solutions.
Prelude to the Simplex Algorithm The Algebraic Approach The search for extreme point solutions. 1 Linear Programming-1 x 2 12 8 (4,8) Max z = 6x 1 + 4x 2 Subj. to: x 1 + x 2
More information9.5 THE SIMPLEX METHOD: MIXED CONSTRAINTS
SECTION 9.5 THE SIMPLEX METHOD: MIXED CONSTRAINTS 557 9.5 THE SIMPLEX METHOD: MIXED CONSTRAINTS In Sections 9. and 9., you looked at linear programming problems that occurred in standard form. The constraints
More information56:171 Operations Research Fall 1998
56:171 Operations Research Fall 1998 Quiz Solutions D.L.Bricker Dept of Mechanical & Industrial Engineering University of Iowa 56:171 Operations Research Quiz
More informationThe Simplex Method of Linear Programming
The Simplex Method of Linear Programming Online Tutorial 3 Tutorial Outline CONVERTING THE CONSTRAINTS TO EQUATIONS SETTING UP THE FIRST SIMPLEX TABLEAU SIMPLEX SOLUTION PROCEDURES SUMMARY OF SIMPLEX STEPS
More information1 Simplex and Matrices
1 Simplex and Matrices We will begin with a review of matrix multiplication. A matrix is simply an array of numbers. If a given array has m rows and n columns, then it is called an m n (or m-by-n) matrix.
More information3. THE SIMPLEX ALGORITHM
Optimization. THE SIMPLEX ALGORITHM DPK Easter Term. Introduction We know that, if a linear programming problem has a finite optimal solution, it has an optimal solution at a basic feasible solution (b.f.s.).
More information1 Review Session. 1.1 Lecture 2
1 Review Session Note: The following lists give an overview of the material that was covered in the lectures and sections. Your TF will go through these lists. If anything is unclear or you have questions
More informationThe Simplex Method. Standard form (max) z c T x = 0 such that Ax = b.
The Simplex Method Standard form (max) z c T x = 0 such that Ax = b. The Simplex Method Standard form (max) z c T x = 0 such that Ax = b. Build initial tableau. z c T 0 0 A b The Simplex Method Standard
More informationSAMPLE QUESTIONS. b = (30, 20, 40, 10, 50) T, c = (650, 1000, 1350, 1600, 1900) T.
SAMPLE QUESTIONS. (a) We first set up some constant vectors for our constraints. Let b = (30, 0, 40, 0, 0) T, c = (60, 000, 30, 600, 900) T. Then we set up variables x ij, where i, j and i + j 6. By using
More informationOPTIMISATION 3: NOTES ON THE SIMPLEX ALGORITHM
OPTIMISATION 3: NOTES ON THE SIMPLEX ALGORITHM Abstract These notes give a summary of the essential ideas and results It is not a complete account; see Winston Chapters 4, 5 and 6 The conventions and notation
More informationThe simplex algorithm
The simplex algorithm The simplex algorithm is the classical method for solving linear programs. Its running time is not polynomial in the worst case. It does yield insight into linear programs, however,
More informationSummary of the simplex method
MVE165/MMG631,Linear and integer optimization with applications The simplex method: degeneracy; unbounded solutions; starting solutions; infeasibility; alternative optimal solutions Ann-Brith Strömberg
More informationLinear Programming, Lecture 4
Linear Programming, Lecture 4 Corbett Redden October 3, 2016 Simplex Form Conventions Examples Simplex Method To run the simplex method, we start from a Linear Program (LP) in the following standard simplex
More informationThe augmented form of this LP is the following linear system of equations:
1 Consider the following LP given in standard form: max z = 5 x_1 + 2 x_2 Subject to 3 x_1 + 2 x_2 2400 x_2 800 2 x_1 1200 x_1, x_2 >= 0 The augmented form of this LP is the following linear system of
More informationThe Simplex Method. Lecture 5 Standard and Canonical Forms and Setting up the Tableau. Lecture 5 Slide 1. FOMGT 353 Introduction to Management Science
The Simplex Method Lecture 5 Standard and Canonical Forms and Setting up the Tableau Lecture 5 Slide 1 The Simplex Method Formulate Constrained Maximization or Minimization Problem Convert to Standard
More informationChapter 5 Linear Programming (LP)
Chapter 5 Linear Programming (LP) General constrained optimization problem: minimize f(x) subject to x R n is called the constraint set or feasible set. any point x is called a feasible point We consider
More informationSensitivity Analysis
Dr. Maddah ENMG 500 /9/07 Sensitivity Analysis Changes in the RHS (b) Consider an optimal LP solution. Suppose that the original RHS (b) is changed from b 0 to b new. In the following, we study the affect
More informationLesson 27 Linear Programming; The Simplex Method
Lesson Linear Programming; The Simplex Method Math 0 April 9, 006 Setup A standard linear programming problem is to maximize the quantity c x + c x +... c n x n = c T x subject to constraints a x + a x
More informationLP Definition and Introduction to Graphical Solution Active Learning Module 2
LP Definition and Introduction to Graphical Solution Active Learning Module 2 J. René Villalobos and Gary L. Hogg Arizona State University Paul M. Griffin Georgia Institute of Technology Background Material
More informationIP Cut Homework from J and B Chapter 9: 14, 15, 16, 23, 24, You wish to solve the IP below with a cutting plane technique.
IP Cut Homework from J and B Chapter 9: 14, 15, 16, 23, 24, 31 14. You wish to solve the IP below with a cutting plane technique. Maximize 4x 1 + 2x 2 + x 3 subject to 14x 1 + 10x 2 + 11x 3 32 10x 1 +
More informationOverview of course. Introduction to Optimization, DIKU Monday 12 November David Pisinger
Introduction to Optimization, DIKU 007-08 Monday November David Pisinger Lecture What is OR, linear models, standard form, slack form, simplex repetition, graphical interpretation, extreme points, basic
More informationThe Strong Duality Theorem 1
1/39 The Strong Duality Theorem 1 Adrian Vetta 1 This presentation is based upon the book Linear Programming by Vasek Chvatal 2/39 Part I Weak Duality 3/39 Primal and Dual Recall we have a primal linear
More information56:270 Final Exam - May
@ @ 56:270 Linear Programming @ @ Final Exam - May 4, 1989 @ @ @ @ @ @ @ @ @ @ @ @ @ @ Select any 7 of the 9 problems below: (1.) ANALYSIS OF MPSX OUTPUT: Please refer to the attached materials on the
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 MODULE - 2: Simplex Method for
More informationThe Dual Simplex Algorithm
p. 1 The Dual Simplex Algorithm Primal optimal (dual feasible) and primal feasible (dual optimal) bases The dual simplex tableau, dual optimality and the dual pivot rules Classical applications of linear
More informationFebruary 17, Simplex Method Continued
15.053 February 17, 2005 Simplex Method Continued 1 Today s Lecture Review of the simplex algorithm. Formalizing the approach Alternative Optimal Solutions Obtaining an initial bfs Is the simplex algorithm
More informationLecture 11: Post-Optimal Analysis. September 23, 2009
Lecture : Post-Optimal Analysis September 23, 2009 Today Lecture Dual-Simplex Algorithm Post-Optimal Analysis Chapters 4.4 and 4.5. IE 30/GE 330 Lecture Dual Simplex Method The dual simplex method will
More informationUnderstanding the Simplex algorithm. Standard Optimization Problems.
Understanding the Simplex algorithm. Ma 162 Spring 2011 Ma 162 Spring 2011 February 28, 2011 Standard Optimization Problems. A standard maximization problem can be conveniently described in matrix form
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 information9.1 Linear Programs in canonical form
9.1 Linear Programs in canonical form LP in standard form: max (LP) s.t. where b i R, i = 1,..., m z = j c jx j j a ijx j b i i = 1,..., m x j 0 j = 1,..., n But the Simplex method works only on systems
More information