Optimization Spring 2015. Practical information Lecturers: Kristoffer Arnsfelt Hansen and Peter Bro Miltersen. Homepage: → bb.au.dk Exam: Written, 3 hours.

Slides:



Advertisements
Similar presentations
February 14, 2002 Putting Linear Programs into standard form
Advertisements

IEOR 4004 Midterm Review (part I)
LINEAR PROGRAMMING. “ A certain wide class of practical problems appears to be just beyond the range of modern computing machinery. These problems occur.
1. Set up the phase 1 dictionary for this problem and make the first pivot: Maximize X 1 + X X 3 + X 4 subject to -X 1 + X X 4 ≤ -3 -X 1 +
Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
In a previous lecture, this dictionary resulted after the first phase 1 pivot: X0 = X1 - 1 X2 + 1 X3 X4 = X1 + 3 X2 + 1 X
Lecture 3 Linear Programming: Tutorial Simplex Method
Standard Minimization Problems with the Dual
Linear Programming (LP) (Chap.29)
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2002 Lecture 8 Tuesday, 11/19/02 Linear Programming.
Water Resources Development and Management Optimization (Linear Programming) CVEN 5393 Feb 18, 2013.
Dragan Jovicic Harvinder Singh
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Managerial Decision Modeling with Spreadsheets
Linear programming Thomas S. Ferguson University of California at Los Angeles Compressive Sensing Tutorial PART 3 Svetlana Avramov-Zamurovic January 29,
Operation Research Chapter 3 Simplex Method.
1 Linear Programming Jose Rolim University of Geneva.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2006 Lecture 9 Wednesday, 11/15/06 Linear Programming.
1 Generality of Languages Maximum Cardinality Matching Max (s,t)-Flow Min Cost Flow Hopcroft-Karp Linear Programs Reduction Edmonds-Karp Klein’s algorithm.
Design and Analysis of Algorithms
Chapter 10: Iterative Improvement
Linear Programming (6S) and Transportation Problem (8S)
What is Linear Programming? A Linear Program is a minimization or maximization problem, subject to several restraints. Linear programs can be set up for.
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
1 Lecture 2 & 3 Linear Programming and Transportation Problem.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
1 Lecture 5 Linear Programming (6S) and Transportation Problem (8S)
MIT and James Orlin © Chapter 3. The simplex algorithm Putting Linear Programs into standard form Introduction to Simplex Algorithm.
Linear Programming Models: Graphical Methods 5/4/1435 (1-3 pm)noha hussein elkhidir.
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
Linear Programming Models: Graphical and Computer Methods
Simplex method (algebraic interpretation)
Duality Theory LI Xiaolei.
ECE 556 Linear Programming Ting-Yuan Wang Electrical and Computer Engineering University of Wisconsin-Madison March
Linear Optimization Lecture 1: Introduction Instructor: Tsvetan Asamov.
Chapter 6 Linear Programming: The Simplex Method Section R Review.
Section 4-1: Introduction to Linear Systems. To understand and solve linear systems.
Advanced Operations Research Models Instructor: Dr. A. Seifi Teaching Assistant: Golbarg Kazemi 1.
1 Bob and Sue solved this by hand: Maximize x x 2 subject to 1 x x 2 ≤ x x 2 ≤ 4 x 1, x 2 ≥ 0 and their last dictionary was: X1.
OR Chapter 1. Introduction  Ex : Diet Problem Daily requirements : energy(2000kcal), protein(55g), calcium(800mg) Food Serving size Energy (kcal)
OPERATION RESEARCH Hemal Rajyaguru.
CSC 445/545 is done at 4:30 so I did NOT fill in the box for 4:30 for our class. Please put your name here. Please put your as well. 1.
LINEAR PROGRAMMING.
Part 3. Linear Programming 3.2 Algorithm. General Formulation Convex function Convex region.
Linear Programming: Formulations, Geometry and Simplex Method Yi Zhang January 21 th, 2010.
OR  Now, we look for other basic feasible solutions which gives better objective values than the current solution. Such solutions can be examined.
OR Chapter 1. Introduction  Ex : Diet Problem Daily requirements : energy(2000kcal), protein(55g), calcium(800mg) Food Serving size Energy (kcal)
Linear Programming 虞台文.
Simplex Method Review. Canonical Form A is m x n Theorem 7.5: If an LP has an optimal solution, then at least one such solution exists at a basic feasible.
1 Simplex algorithm. 2 The Aim of Linear Programming A Linear Programming model seeks to maximize or minimize a linear function, subject to a set of linear.
Introduction to Linear Programming Romil Jain. The Nutrition Problem Each fruit contains different nutrients Each fruit has different cost An apple a.
Linear Programming for Solving the DSS Problems
Solving Linear Program by Simplex Method The Concept
Chap 10. Sensitivity Analysis
Chapter 1. Introduction Ex : Diet Problem
Mathematical Programming
The minimum cost flow problem
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
MBA 651 Quantitative Methods for Decision Making
Chap 9. General LP problems: Duality and Infeasibility
Part 3. Linear Programming
Factor as many polynomials as you can.
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Linear Programming I: Simplex method
Part 3. Linear Programming
TBF General Mathematics - II Lecture – 9 : Linear Programming
Simplex method (algebraic interpretation)
Chapter 10: Iterative Improvement
Practical Issues Finding an initial feasible solution Cycling
Presentation transcript:

Optimization Spring 2015

Practical information Lecturers: Kristoffer Arnsfelt Hansen and Peter Bro Miltersen. Homepage: → bb.au.dk Exam: Written, 3 hours. Compulsary program: 3 assignments. You can transfer credit from earlier years - see course page. The solution to the compulsory assignments should be handed in at a specific tutorial and given to the instructor in person. Text: Robert J. Vanderbei: Linear Programming – Foundations and Extensions.

Blackboard intermezzo You need to ”self-enroll” to your correct class! To switch classes: find another student willing to switch and then inform the respective TA’s.

Compulsary assignments To pass the compulsary program and take the exam you must: Hand in all 3 assignments on time and have them approved by your TA. Start early!

Linear Programming In a sentence: Optimizing a linear function subject to linear inequalities. We will see today: How to model problems using linear programming. How to solve linear programs (Dantzig’s simplex algorithm).

Example: Diet Problem Serving Size Energy (kcal) Protein (g) Calcium (mg) Price per serving (cents) Oatmeal28 g Chicken100 g Eggs2 large Whole Milk237 cc Cherry Pie170 g Pork with Beans260 g Necessary daily intake: Energy 2000 kcal, Protein 55 g, Calcium 800 mg Compose a diet minimizing price and fulfilling necessary daily intake.

(August 2014)

Example: Diet Problem Serving Size Energy (kcal) Protein (g) Calcium (mg) Price per serving (cents) Oatmeal28 g Chicken100 g Eggs2 large Whole Milk237 cc Cherry Pie170 g Pork with Beans260 g Necessary daily intake: Energy 2000 kcal, Protein 55 g, Calcium 800 mg Compose a diet minimizing price and fulfilling necessary daily intake.

LP formulation Minimize: Subject to:

LP modelling steps

A little history of linear programming Roots in work on linear inequalities of J. Fourier. L. V. Kantorovitch invents LP in USSR 1939 for optimizing production while working for the Soviet government. G. Dantzig invents the simplex method in 1947 for solving LP problems, working for U.S. Air Force, solving planning problems. T.C. Koopmans applies LP to classical economics same year after meeting with Dantzig.

Nobel prize 1975 The Sveriges Riksbank Prize in Economic Sciences in Memory of Alfred Nobel 1975 was awarded jointly to Leonid Vitaliyevich Kantorovich and Tjalling C. Koopmans “for their contributions to the theory of optimum allocation of resources“. Many were surprised that Dantzig was omitted. Koopmans proposed to Kantorovich to decline the prize, but was pursuaded not to do this.

Abstract example

View of production manager

LP formulation

LP formulation – matrix form Maximize Subject to

View of liquidator

LP formulation

LP formulation – matrix form Minimize Subject to Next week: The two LP formulations are intimately related (duals).

The LP problem

LP terminology An assignment to the decision variables is called a solution. A solution that satisfies all linear inequalities and linear equations is called feasible. A feasible solution that attains the desired minimum or maximum is called optimal.

Linear Programs, Geometric View

23

The set of feasible solutions F is a convex Polyhedron. F

F

F

Linear Programs, Geometric view

Beware of the intuition…

Linear Programs in Standard Form

Exceptions: If no feasible solution exist, report “Infeasible”. If arbitrarily good feasible solutions exist, report “Unbounded”.

Transforming general Linear programs to standard form.

The Simplex algorithm (geometric sketch)

Whiteboard intermezzo

Equivalent system

Dictionaries

Initialization: First dictionary

Improvement: Pivoting Find entering variable: Pick variable with positive coefficient in objective function. Find leaving variable: Pick variable from basis to preserve nonnegativity of basic variables. Rewrite equation of leaving variable in terms of entering variable. Substitute for entering variable in dictionary.

Special case If entering variable has nonnegative coefficient in all equations, report Unbounded.

One phase Simplex method

Analysis: Partial correctness