So far all our functions were linear. In many situations, it might not be the case. Example: Production cost. – c 1 = $11/unit for first 5 items – c 2.

Slides:



Advertisements
Similar presentations
Ordered pairs ( x , y ) as solutions to Linear Equations
Advertisements

Solve a System Algebraically
Duality for linear programming. Illustration of the notion Consider an enterprise producing r items: f k = demand for the item k =1,…, r using s components:
Linear Programming Problem
ECE Longest Path dual 1 ECE 665 Spring 2005 ECE 665 Spring 2005 Computer Algorithms with Applications to VLSI CAD Linear Programming Duality – Longest.
Introduction to Mathematical Programming Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Technologies.
Lesson 08 Linear Programming
IP modeling techniques I In this handout, Modeling techniques:  Using binary variables  Restrictions on number of options  Contingent decisions  Variables.
1 Chapter 11 Here we see cases where the basic LP model can not be used.
Use MATLAB to solve linear programs LI Xiao-lei. MATLAB format for linear programs MATLAB uses the following format for linear programs: min z = f T x.
1 Cutting Plane Technique for Solving Integer Programs.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Ch 2. 6 – Solving Systems of Linear Inequalities & Ch 2
Thursday, April 25 Nonlinear Programming Theory Separable programming Handouts: Lecture Notes.
Agenda Duality (quickly) Piecewise linearity Start chapter 4.
Solving Integer Programs. Natural solution ideas that don’t work well Solution idea #1: Explicit enumeration: Try all possible solutions and pick the.
Basic LP Problem McCarl and Spreen Chapter 2 LP problem is linear form of Mathematical Program This formulation may also be expressed in matrix notation.
Linear Programming General Form of an LP Model. Linear Programming General Form of an LP Model where the c’s, a’s and b’s are constants determined from.
IP modeling techniques II
Systems of Linear Equations
IP modeling techniques III In this handout, Modeling techniques:  Making choices with non-binary variables  Piecewise linear functions.
Ch. 9: Direction Generation Method Based on Linearization Generalized Reduced Gradient Method Mohammad Farhan Habib NetLab, CS, UC Davis July 30, 2010.
1 OR II GSLM Outline  separable programming  quadratic programming.
Chapter 3 An Introduction to Linear Programming
Thinking Mathematically Algebra: Graphs, Functions and Linear Systems 7.3 Systems of Linear Equations In Two Variables.
Solving Systems of Linear Equations in Three Variables; Applications
Section 7-2 Solve Systems by Substitution SPI 23D: select the system of equations that could be used to solve a given real-world problem Objective: Solve.
Chapter 7 – Solving Systems of Linear Equations
3-D Systems Yay!. Review of Linear Systems Solve by substitution or elimination 1. x +2y = 11 2x + 3y = x + 4y = -1 2x + 5y = 4.
Fri 10/2 Lesson 2 – 8 Learning Objective: To graph two variable inequalities Hw: Pg. 118 #8 – 17, 39 – 41, *46.
1 1 Slide © 2005 Thomson/South-Western Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization.
Introduction to Linear Programming BSAD 141 Dave Novak.
Solving Linear Systems of Equations - Substitution Method Recall that to solve the linear system of equations in two variables... we need to find the value.
Copyright © 2011 Pearson Education, Inc. Systems of Linear Equations in Two Variables Section 5.1 Systems of Equations and Inequalities.
1.6 Mean, Median, Mode.
Solving Linear Systems by Substitution
EXAMPLE 4 Solve a system using substitution Marketing The marketing department of a company has a budget of $30,000 for advertising. A television ad costs.
Section 3.5 Solving Systems of Linear Equations in Two Variables by the Addition Method.
The Substitution Method Objectives: To solve a system of equations by substituting for a variable.
Tuesday, October 15, 2013 Do Now:. 3-1 Solving Systems of Equations by Graphing Objectives: 1)solve systems of linear equations by graphing 2) Determine.
In this section, we will introduce the idea of an infinite sequence and what it means to say one converges or diverges.
Chapter 9 Integer Programming to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,
Part 4 Nonlinear Programming 4.3 Successive Linear Programming.
An Introduction to Linear Programming
2.7 Linear Programming Objectives: Use linear programming procedures to solve applications. Recognize situations where exactly one solution to a linear.
Does the set S SPAN R3 ?.
EMGT 6412/MATH 6665 Mathematical Programming Spring 2016
Chapter 5: Systems of Linear Equations
6-2 Solving Systems using Substitution
Chapter 9 Integer Programming
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Solving Linear Systems Algebraically
Solve a system of linear equation in two variables
Linear Programming Skill 45.
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Before: November 28, 2017 Solve each system by graphing. 1. y = 2x – 1
Matrix Solutions to Linear Systems
INFM 718A / LBSC 705 Information For Decision Making
Chapter 5. The Duality Theorem
Z increases at rate of 10 units/s Z decreases at rate of 10 units/s
Linear Programming Example: Maximize x + y x and y are called
Objectives Identify solutions of linear equations in two variables.
Linear Programming Problem
Part 4 Nonlinear Programming
Ch5 Initial-Value Problems for ODE
Binary Search Counting
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
Chapter 8 Systems of Equations
Multivariable Linear Systems
Branch-and-Bound Algorithm for Integer Program
Presentation transcript:

So far all our functions were linear. In many situations, it might not be the case. Example: Production cost. – c 1 = $11/unit for first 5 items – c 2 = $8/unit for next 4 items – c 3 = $5/unit for next 7 items – c 4 = $7/unit for next 10 items The cost of producing x items is an example of so-called piecewise linear function:

How to include piecewise linear cost functions in an objective function of LP? Idea: Introduce a new variable for each cost segment. For i=1,2,3,4 y i = number of items produced at cost c i Then the total number of items is x = y 1 +y 2 +y 3 +y 4. We need constraints 0  y 1  5, 0  y 2  4, 0  y 3  7, 0  y 4  10,(*) and the production cost in the objective function is 11y 1 + 8y 2 + 5y 3 + 7y 4 What is the shortcoming of this model?

We should require that –y 2 >0 implies that y 1 =5(1) –y 3 >0 implies that y 2 =4(2) –y 4 >0 implies that y 3 =7(3) Introduce new variables to translate these requirements into linear constraints. For i=1,2,3,4, Proper constraints relating w i and y i will provide that requirements (1)-(3) are satisfied. y 2  4w 1 and 5w 1  y 1 provide (1) y 3  7w 2 and 4w 2  y 2 provide (2) y 4  10w 3 and 7w 3  y 3 provide (3)

Summarizing, the bound constraints in (*) should be substituted with 5w 1  y 1  5, 4w 2  y 2  4w 1, 7w 3  y 3  7w 2, 0  y 4  10w 3. Generalizing, suppose we have k segments with lengths L 1, L 2, …, L k. Then the necessary constraints: L 1 w 1  y 1  L 1, L i w i  y i  L i w i-1 for i = 2, …, k-1 0  y k  L k w k-1