IE312 1 HW#2 Solution_Fall06

Size: px
Start display at page:

Download "IE312 1 HW#2 Solution_Fall06"

Transcription

1 IE3. Section 3.3: Problem -3 Problem P.68 Max z 4x +x s.t. 8x +x C 5x +x ---- C xx C3 X 8 Feasible Region 6 C 4 C CASE The LP has alternative or multiple optimal solutions: To extreme points are optimal and the LP ill have an ininite number o optimal solutions. Z4 A Any points along line AB are the optimal solutions. C3 B.4 X Problem 3 P.68 Max z -x +3x s.t. x -x C x +x C xx C3 X Feasible Region C Z0 C CASE 4 The LP is unbounded: There are points in the easible region ith the arbitrarily large z-value. C3 4 X

2 IE3. Section 3.3: Problems 5-6. Make sure that you justiy your ansers. Problem 5: True An unbounded easible region is a necessary condition or a LP to be unbounded. Problem 6: False It is possible or a LP ith unbounded easible region to have optimal solution. See an example LP belo: 3. Construct an improving direction rom the gradient o each objective unction at the point indicated. x gives the direction o the largest increase improving i max problem. - x gives the direction o the largest decrease improving i min problem. a. Max at At 05 the improving direction is b. Min at At 7- the improving direction is c. Min + - at 3 + At 3 the improving direction is - 3 -* Isocost Line An optimal Solution unbounded easible region

3 IE3 3 d. Max at At 5 the improving direction is 5 3* Consider the mathematical program Max 4z +7z Objective Function s.t. z +z 9 Constraint C 0 z 4 Constraint C 0 z 3 Constraint 3 C3 a Sho that directions Δz 0 and Δz -4 are improving directions or this model at every z. For max problem the objective unction is increased i x.δx>0. z z From objective unction e get z 47. z z The direction Δz 0 is an improving directions or this model at every z since z. Δz > 0. The direction Δz -4 is an improving directions or this model at every z since z. Δz > 0. b Beginning at z 0 00 execute the Improving Search algorithm on the model see PoerPoint slides or algorithm. Limit yoursel to the to directions in part a and continue until neither is improving and easible. Improving search algorithm rom PPT slide: 0 Choose initial solution I no improving direction Δz STOP Find improving direction Δz rom a. e have improving direction Δz 0 and Δz Choose the largest step size λ t+ that remains easible and improves perormance 4 Update z t+ z t + λ t+ Δz t+ Let tt+ and return to step At t0 initial solution is z We have to improving direction rom a. hich are Δz and Δz. Let start improving ith Δz Find the largest step size λ We have z z 0 + λ Δz 00+ λ.0 λ 0 Substitute z into C CC3 to ind λ C: z +z 9 λ +04λ 9 λ 9/4 C: 0 z 4 0 λ 4 0 λ C3: 0 z λ R To remain easible and improves perormance the largest λ is hence z 40. Since e cannot improve more perormance rom z using Δz e start moving in Δz direction.

4 IE3 4 At t ne initial solution is z 40. Start improving ith Δz Find the largest step size λ We have z z + λ Δz 40+ λ.-4 4-λ 4λ Substitute z into C CC3 to ind λ C: z +z 9 4-λ + 4λ 8 9 λ R C: 0 z λ 4 0 λ C3: 0 z 3 0 4λ 3 0 λ 3/4 To remain easible and improves perormance the largest λ is 3/4 hence z 5/3. Since e cannot improve more perormance rom z using Δz e try improving ith Δz direction again. At t ne initial solution is z 5/3. Start improving ith Δz 3 hich is equal to Δz Find the largest step size λ 3 We have z 3 z + λ 3 Δz 3 5/3+ λ 3.0 5/+λ 3 3 Substitute z 3 into C CC3 to ind λ 3 C: z +z 9 5/+λ λ /4 C: 0 z 4 0 5/+λ 3 4-5/4 λ 3 3/4 C3: 0 z λ 3 R To remain easible and improves perormance the largest λ 3 is /4 hence z Since e cannot improve more perormance rom z 3 using Δz 3 or Δz e try improving ith Δz direction again. At t3 ne initial solution is z Start improving ith Δz 4 hich is equal to Δz Find the largest step size λ 4 We have z 4 z 3 + λ 4 Δz λ λ 4 3+4λ 4 Substitute z 4 into C CC3 to ind λ 4 C: z +z 9 3-λ λ λ 4 R C: 0 z λ 4 4 -/ λ 4 3/ C3: 0 z λ 4 3-3/4 λ 4 0 To remain easible and improves perormance the largest λ 4 is 0 hich mean e cannot improve rom z 3 or no improving direction Δz STOP searching And e get the optimal solution at z33 ith the objective value o 33. IF e start the search algorithm ith direction Δz instead o Δz the solution may dierent. At t0 initial solution is z We have to improving direction rom a. hich are Δz and Δz. Let start improving ith Δz Find the largest step size λ We have z z 0 + λ Δz 00+ λ.-4 -λ 4λ Substitute z into C CC3 to ind λ C: z +z 9 -λ+4λ0 9 λ R C: 0 z 4 0 -λ 4 - λ 0 C3: 0 z 3 0 4λ 3 0 λ 3/4 To remain easible and improves perormance the largest λ is 0 hich mean e cannot improve rom z 0 or no improving direction Δz STOP searching We might think that the optimal solution is at z00 ith the objective value o 0. Hoever ith the previous search method start searching ith Δz direction e can get the better solution. We can see that using dierent search methods may result in the dierent solutions.

5 IE3 5 c Sho in a to-dimensional plot the easible space and objective unction contours o the models. Then plot the path o your search in part b. z Feasible Region C C C3 z z 3 z 0 z Z8 z Z4

6 IE Section 3.8: 4 Problem P.9 Notation: X ij Amount o input j use to produce product i lb Product I here i or orange and or orange juice Input J here j or grade 9 orange or grade 6 orange Decision Variable: X X X X LP Objective Function: Max Proit 0.3X +X X +X Constraints Quality requirements Avg grade in bags o orange Avg grade in cartons o orange juice Input Availability Constraints: grade 9 orange grade 6 orange 9X +6X >7X +X or X -X >0 9X +6X >8X +X or X -X >0 X +X <00000 X +X <0000 Sign Constraints: X >0 X >0 X >0 X >0 Equation

7 IE3 7 Problem 4 P.94 Notation: X ij Amount o input j use to produce product i Product I here i or Regular Gasoline and or Premium Gasoline Input J here j or Reormate or FCG 3 or ISO 4 or POL 5 or MTB 6 or BUT Decision Variable: X X X 3 X 4 X 5 X 6 X X X 3 X 4 X 5 X 6 LP Objective Function: Max Proit 9.49X +X +X 3 +X 4 +X 5 +X X +X +X 3 +X 4 +X 5 +X X +X +X 3 +X 4 +X 5 +X X +X +X 3 +X 4 +X 5 +X 6 Constraints: Equation Demand Constraints: Regular Gasoline Premium Gasoline Ration Constraints: FCG in Regular Gasoline FCG in Premium Gasoline Attribute requirements RON in Regular Gasoline RON in Premium Gasoline RVP in Regular Gasoline RVP in Premium Gasoline ASTM70 in Regular Gasoline ASTM70 in Premium Gasoline ASTM30 in Regular Gasoline ASTM30 in Premium Gasoline Input Availability Constraints: Reormate FCG ISO POL MTB X +X +X 3 +X 4 +X 5 +X 6 >9800 X +X +X 3 +X 4 +X 5 +X 6 >30000 X <0.38X +X +X 3 +X 4 +X 5 +X 6 or 0.6X -0.38X -0.38X X X X 6 <0 X <0.38 X +X +X 3 +X 4 +X 5 +X 6 or -0.38X +0.6X -0.38X X X X 6 <0 98.9X +93.X +86.X 3 +97X 4 +7X 5 +98X 6 > 90X +X +X 3 +X 4 +X 5 +X 6 or 8.9X +3.X -3.9X 3 +7X 4 +7X 5 +8X 6 >0 98.9X +93.X +86.X 3 +97X 4 +7X 5 +98X 6 > 96X +X +X 3 +X 4 +X 5 +X 6 or.9x -.8X -9.9X 3 +X 4 +X 5 +X 6 >0 7.66X +9.78X +9.5X X X X 6.8X +X +X 3 +X 4 +X 5 +X 6 or -3.5X -.40X +8.34X X X X X +9.78X +9.5X X X X 6.8X +X +X 3 +X 4 +X 5 +X 6 or -3.5X -.40X +8.34X X X X 6 0-5X +57X +07X 3 +7X 4 +98X 5 +30X 6 > 0X +X +X 3 +X 4 +X 5 +X 6 or -5X +47X +97X 3-3X 4 +88X 5 +0X 6 >0-5X +57X +07X 3 +7X 4 +98X 5 +30X 6 > 0X +X +X 3 +X 4 +X 5 +X 6 or -5X +47X +97X 3-3X 4 +88X 5 +0X 6 >0 46X +03X +00X 3 +73X 4 +00X 5 +00X 6 > 50X +X +X 3 +X 4 +X 5 +X 6 or -4X +53X +50X 3 +3X 4 +50X 5 +50X 6 >0 46X +03X +00X 3 +73X 4 +00X 5 +00X 6 >50X +X +X 3 +X 4 +X 5 +X 6 or -4X +53X +50X 3 +3X 4 +50X 5 +50X 6 >0 X +X <557 X +X <5434 X 3 +X 3 <6709 X 4 +X 4 <90 X 5 +X 5 <748 Sign Constraints: X >0 X >0 X 3 >0 X 4 >0 X 5 >0 X 6 >0 X >0 X >0 X 3 >0 X 4 >0 X 5 >0 X 6 >0

8 IE Section 3.9: 8 Problem P X + X hr o skilled labors X + X units Uninished table 3X hr o skilled labors X units Uninished table sold X units Finished table sold 40X +X +30X 3 +X 4 board t. Wood X 3 units Uninished chair sold X 3 + X 4 hr o skilled labors X 3 + X 4 units Uninished chair X 4 hr o skilled labors X 4 units Finished chair sold Notation: X i Amount o product i sold Product I here i or Uninished table or Finished table 3 or Uninished chair and 4 or Finished chair Decision Variable: X X X 3 X 4 LP Objective Function: Max Proit 70X +40X +60X 3 +0X 4 40X +X 30X 3 +X 4 30X +00X +30X 3 +80X 4 Constraints: Equation Input Availability Constraints: Wood Skilled labor 40X +X +30X 3 +X 4 <40000 X +X +X 3 +X 4 +3X +X 4 <6000 or X +5X +X 3 +4X 4 <6000 Sign Constraints: X >0 X >0 X 3 >0 X 4 >0

9 IE3 9 Problem 8 P.98 Purchase R Produce X Product Reprocess X -Y Produce X Sold Y Produce X 4 Product 4 Sold Y Sold Y 4 Ra Material Product Reprocess X -Y Produce X 5 Product 5 Sold Y 5 Destroy X 5 -Y 5 Produce X 3 Product 3 Notation: X i Amount o product i produced Y i Amount o product i sold R Amount o ra material purchased Product I here i Sold Y 3 Produce X 6 Product 6 Sold Y 6 Destroy X 6 -Y 6 Decision Variable: X X X 3 X 4 X 5 X 6 Y Y Y 3 Y 4 Y 5 Y 6 R LP Objective Function: Max Proit 7Y +6Y +4Y 3 +3Y 4 +0Y 5 +35Y 6 4X +4X +X 3 +X 4 +5X 5 +5X 6 4X 5 Y 5 3X 6 Y 6 6R Constraints: Amount Sold Constraints: Product Product Product 3 Product 4 Product 5 Product 6 Balance Constraints: Y <00 Y < X Y <300Y < X Y 3 < X 3 Y 4 < X 4 Y 5 <000 Y 5 < X 5 Y 6 <800 Y 6 < X 6 R X /4 X / X 3 X -Y X 4 X -Y X 5 /0.8 X 6 /0.3 Equation Attribute requirements Ra Material R<3000 Sign Constraints: X >0 X >0 X 3 >0 X 4 >0 X 5 >0 X 6 >0 Y >0 Y >0 Y 3 >0 Y 4 >0 Y 5 >0 Y 6 >0 R>0

MAT016: Optimization

MAT016: 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 information

Introduction to LP. Types of Linear Programming. There are five common types of decisions in which LP may play a role

Introduction to LP. Types of Linear Programming. There are five common types of decisions in which LP may play a role Linear Programming RK Jana Lecture Outline Introduction to Linear Programming (LP) Historical Perspective Model Formulation Graphical Solution Method Simplex Method Introduction to LP Continued Today many

More information

AMS341 HW1. Graphically solving this LP we find the optimal solution to be z = $10,000, W = C = 20 acres.

AMS341 HW1. Graphically solving this LP we find the optimal solution to be z = $10,000, W = C = 20 acres. AMS341 HW1 p.63 #6 Let W = acres of wheat planted and C = acres of corn planted. Then the appropriate LP is max = 200W + 300C st W + C 45 (Land) 3W + 2C 100 (Workers) 2W + 4C 120 (Fertilizer) W, C 0 Graphically

More information

Chapter 4 The Simplex Algorithm Part I

Chapter 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

END3033 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 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 information

Math 1314 Lesson 23 Partial Derivatives

Math 1314 Lesson 23 Partial Derivatives Math 1314 Lesson 3 Partial Derivatives When we are asked to ind the derivative o a unction o a single variable, (x), we know exactly what to do However, when we have a unction o two variables, there is

More information

The Simplex Algorithm

The Simplex Algorithm The Simplex Algorithm How to Convert an LP to Standard Form Before the simplex algorithm can be used to solve an LP, the LP must be converted into a problem where all the constraints are equations and

More information

The 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 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 information

Operations Research Graphical Solution. Dr. Özgür Kabak

Operations Research Graphical Solution. Dr. Özgür Kabak Operations Research Graphical Solution Dr. Özgür Kabak Solving LPs } The Graphical Solution } The Simplex Algorithm } Using Software 2 LP Solutions: Four Cases } The LP has a unique optimal solution. }

More information

Spring 2018 IE 102. Operations Research and Mathematical Programming Part 2

Spring 2018 IE 102. Operations Research and Mathematical Programming Part 2 Spring 2018 IE 102 Operations Research and Mathematical Programming Part 2 Graphical Solution of 2-variable LP Problems Consider an example max x 1 + 3 x 2 s.t. x 1 + x 2 6 (1) - x 1 + 2x 2 8 (2) x 1,

More information

Graphical and Computer Methods

Graphical 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 information

Profit Maximization. Beattie, Taylor, and Watts Sections: 3.1b-c, 3.2c, , 5.2a-d

Profit Maximization. Beattie, Taylor, and Watts Sections: 3.1b-c, 3.2c, , 5.2a-d Proit Maimization Beattie Talor and Watts Sections:.b-c.c 4.-4. 5.a-d Agenda Generalized Proit Maimization Proit Maimization ith One Inut and One Outut Proit Maimization ith To Inuts and One Outut Proit

More information

Consider this problem. A person s utility function depends on consumption and leisure. Of his market time (the complement to leisure), h t

Consider this problem. A person s utility function depends on consumption and leisure. Of his market time (the complement to leisure), h t VI. INEQUALITY CONSTRAINED OPTIMIZATION Application of the Kuhn-Tucker conditions to inequality constrained optimization problems is another very, very important skill to your career as an economist. If

More information

The Simplex Algorithm and Goal Programming

The Simplex Algorithm and Goal Programming The Simplex Algorithm and Goal Programming In Chapter 3, we saw how to solve two-variable linear programming problems graphically. Unfortunately, most real-life LPs have many variables, so a method is

More information

IE 400 Principles of Engineering Management. Graphical Solution of 2-variable LP Problems

IE 400 Principles of Engineering Management. Graphical Solution of 2-variable LP Problems IE 400 Principles of Engineering Management Graphical Solution of 2-variable LP Problems Graphical Solution of 2-variable LP Problems Ex 1.a) max x 1 + 3 x 2 s.t. x 1 + x 2 6 - x 1 + 2x 2 8 x 1, x 2 0,

More information

Introduction To Resonant. Circuits. Resonance in series & parallel RLC circuits

Introduction To Resonant. Circuits. Resonance in series & parallel RLC circuits Introduction To esonant Circuits esonance in series & parallel C circuits Basic Electrical Engineering (EE-0) esonance In Electric Circuits Any passive electric circuit ill resonate if it has an inductor

More information

Signature: Name (PRINT CLEARLY) and ID number:

Signature: Name (PRINT CLEARLY) and ID number: AMS 540 / MBA 540 (Fall, 2008) Estie Arkin Linear Programming - Midterm Do all problems. Write your answers on the exam. You are permitted to use the text, your notes and any material handed out in class.

More information

Standard Form An LP is in standard form when: All variables are non-negativenegative All constraints are equalities Putting an LP formulation into sta

Standard 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 information

Web Appendix for The Value of Switching Costs

Web Appendix for The Value of Switching Costs Web Appendix or The Value o Switching Costs Gary Biglaiser University o North Carolina, Chapel Hill Jacques Crémer Toulouse School o Economics (GREMAQ, CNRS and IDEI) Gergely Dobos Gazdasági Versenyhivatal

More information

Sensitivity Analysis and Duality

Sensitivity 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 information

Linear programming Dr. Arturo S. Leon, BSU (Spring 2010)

Linear programming Dr. Arturo S. Leon, BSU (Spring 2010) Linear programming (Adapted from Chapter 13 Supplement, Operations and Management, 5 th edition by Roberta Russell & Bernard W. Taylor, III., Copyright 2006 John Wiley & Sons, Inc. This presentation also

More information

Math 2412 Activity 1(Due by EOC Sep. 17)

Math 2412 Activity 1(Due by EOC Sep. 17) Math 4 Activity (Due by EOC Sep. 7) Determine whether each relation is a unction.(indicate why or why not.) Find the domain and range o each relation.. 4,5, 6,7, 8,8. 5,6, 5,7, 6,6, 6,7 Determine whether

More information

Yinyu Ye, MS&E, Stanford MS&E310 Lecture Note #06. The Simplex Method

Yinyu 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 information

Lesson 24: True and False Number Sentences

Lesson 24: True and False Number Sentences NYS COMMON CE MATHEMATICS CURRICULUM Lesson 24 6 4 Student Outcomes Students identify values for the variables in equations and inequalities that result in true number sentences. Students identify values

More information

Optimization Methods in Management Science

Optimization Methods in Management Science Optimization Methods in Management Science MIT 15.053, Spring 2013 Problem Set 2 First Group of Students) Students with first letter of surnames A H Due: February 21, 2013 Problem Set Rules: 1. Each student

More information

Curve Sketching. The process of curve sketching can be performed in the following steps:

Curve Sketching. The process of curve sketching can be performed in the following steps: Curve Sketching So ar you have learned how to ind st and nd derivatives o unctions and use these derivatives to determine where a unction is:. Increasing/decreasing. Relative extrema 3. Concavity 4. Points

More information

Principles of Food and Bioprocess Engineering (FS 231) Solutions to Example Problems on Freezing

Principles of Food and Bioprocess Engineering (FS 231) Solutions to Example Problems on Freezing Principles o Food and Bioprocess Engineering (FS 21) Solutions to Example Problems on Freezing 1. In order to determine the a to be used in the above equation, e recall that Plank s equation is valid or

More information

Graph the linear inequality. 1) x + 2y 6

Graph the linear inequality. 1) x + 2y 6 Assignment 7.1-7.3 Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Graph the linear inequality. 1) x + 2y 6 1) 1 2) x + y < -3 2) 2 Graph the

More information

Linear programming. Saad Mneimneh. maximize x 1 + x 2 subject to 4x 1 x 2 8 2x 1 + x x 1 2x 2 2

Linear programming. Saad Mneimneh. maximize x 1 + x 2 subject to 4x 1 x 2 8 2x 1 + x x 1 2x 2 2 Linear programming Saad Mneimneh 1 Introduction Consider the following problem: x 1 + x x 1 x 8 x 1 + x 10 5x 1 x x 1, x 0 The feasible solution is a point (x 1, x ) that lies within the region defined

More information

Lecture 8 Optimization

Lecture 8 Optimization 4/9/015 Lecture 8 Optimization EE 4386/5301 Computational Methods in EE Spring 015 Optimization 1 Outline Introduction 1D Optimization Parabolic interpolation Golden section search Newton s method Multidimensional

More information

Minimize Cost of Materials

Minimize Cost of Materials Question 1: Ho do you find the optimal dimensions of a product? The size and shape of a product influences its functionality as ell as the cost to construct the product. If the dimensions of a product

More information

AM 121 Introduction to Optimization: Models and Methods Example Questions for Midterm 1

AM 121 Introduction to Optimization: Models and Methods Example Questions for Midterm 1 AM 121 Introduction to Optimization: Models and Methods Example Questions for Midterm 1 Prof. Yiling Chen Fall 2018 Here are some practice questions to help to prepare for the midterm. The midterm will

More information

Chapter 5 Linear Programming (LP)

Chapter 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 information

UC Berkeley Department of Electrical Engineering and Computer Sciences. EECS 126: Probability and Random Processes

UC Berkeley Department of Electrical Engineering and Computer Sciences. EECS 126: Probability and Random Processes UC Berkeley Department of Electrical Engineering and Computer Sciences EECS 26: Probability and Random Processes Problem Set Spring 209 Self-Graded Scores Due:.59 PM, Monday, February 4, 209 Submit your

More information

Q c, Q f denote the outputs of good C and F, respectively. The resource constraints are: T since the technology implies: Tc = Qc

Q c, Q f denote the outputs of good C and F, respectively. The resource constraints are: T since the technology implies: Tc = Qc Fall 2008 Eon 455 Ansers - Problem Set 3 Harvey Lapan 1. Consider a simpliied version o the Heksher-Ohlin model ith the olloing tehnology: To produe loth: three units o labor and one unit o land are required

More information

( x) f = where P and Q are polynomials.

( x) f = where P and Q are polynomials. 9.8 Graphing Rational Functions Lets begin with a deinition. Deinition: Rational Function A rational unction is a unction o the orm ( ) ( ) ( ) P where P and Q are polynomials. Q An eample o a simple rational

More information

Why do Golf Balls have Dimples on Their Surfaces?

Why do Golf Balls have Dimples on Their Surfaces? Name: Partner(s): 1101 Section: Desk # Date: Why do Golf Balls have Dimples on Their Surfaces? Purpose: To study the drag force on objects ith different surfaces, ith the help of a ind tunnel. Overvie

More information

Linear Programming: Model Formulation and Graphical Solution

Linear Programming: Model Formulation and Graphical Solution Linear Programming: Model Formulation and Graphical Solution 1 Chapter Topics Model Formulation A Maximization Model Example Graphical Solutions of Linear Programming Models A Minimization Model Example

More information

AP Calculus Notes: Unit 1 Limits & Continuity. Syllabus Objective: 1.1 The student will calculate limits using the basic limit theorems.

AP Calculus Notes: Unit 1 Limits & Continuity. Syllabus Objective: 1.1 The student will calculate limits using the basic limit theorems. Syllabus Objective:. The student will calculate its using the basic it theorems. LIMITS how the outputs o a unction behave as the inputs approach some value Finding a Limit Notation: The it as approaches

More information

(P ) Minimize 4x 1 + 6x 2 + 5x 3 s.t. 2x 1 3x 3 3 3x 2 2x 3 6

(P ) Minimize 4x 1 + 6x 2 + 5x 3 s.t. 2x 1 3x 3 3 3x 2 2x 3 6 The exam is three hours long and consists of 4 exercises. The exam is graded on a scale 0-25 points, and the points assigned to each question are indicated in parenthesis within the text. Problem 1 Consider

More information

Ω R n is called the constraint set or feasible set. x 1

Ω 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 information

ECE 307- Techniques for Engineering Decisions

ECE 307- Techniques for Engineering Decisions ECE 307- Techniques for Engineering Decisions Lecture 4. Dualit Concepts in Linear Programming George Gross Department of Electrical and Computer Engineering Universit of Illinois at Urbana-Champaign DUALITY

More information

The Simplex Method. Formulate Constrained Maximization or Minimization Problem. Convert to Standard Form. Convert to Canonical Form

The Simplex Method. Formulate Constrained Maximization or Minimization Problem. Convert to Standard Form. Convert to Canonical Form The Simplex Method 1 The Simplex Method Formulate Constrained Maximization or Minimization Problem Convert to Standard Form Convert to Canonical Form Set Up the Tableau and the Initial Basic Feasible Solution

More information

Chapter 2. Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall 2-1

Chapter 2. Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall 2-1 Linear Programming: Model Formulation and Graphical Solution Chapter 2 2-1 Chapter Topics Model Formulation A Maximization Model Example Graphical Solutions of Linear Programming Models A Minimization

More information

18-660: Numerical Methods for Engineering Design and Optimization

18-660: Numerical Methods for Engineering Design and Optimization 8-66: Numerical Methods or Engineering Design and Optimization Xin Li Department o ECE Carnegie Mellon University Pittsburgh, PA 53 Slide Overview Linear Regression Ordinary least-squares regression Minima

More information

Math 3 Variable Manipulation Part 7 Absolute Value & Inequalities

Math 3 Variable Manipulation Part 7 Absolute Value & Inequalities Math 3 Variable Manipulation Part 7 Absolute Value & Inequalities 1 MATH 1 REVIEW SOLVING AN ABSOLUTE VALUE EQUATION Absolute value is a measure of distance; how far a number is from zero. In practice,

More information

2. Linear Programming Problem

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

Chapter 3 Introduction to Linear Programming PART 1. Assoc. Prof. Dr. Arslan M. Örnek

Chapter 3 Introduction to Linear Programming PART 1. Assoc. Prof. Dr. Arslan M. Örnek Chapter 3 Introduction to Linear Programming PART 1 Assoc. Prof. Dr. Arslan M. Örnek http://homes.ieu.edu.tr/~aornek/ise203%20optimization%20i.htm 1 3.1 What Is a Linear Programming Problem? Linear Programming

More information

1 Slutsky Matrix og Negative deniteness

1 Slutsky Matrix og Negative deniteness Slutsky Matrix og Negative deniteness This is exercise 2.F. from the book. Given the demand function x(p,) from the book page 23, here β = and =, e shall :. Calculate the Slutsky matrix S = D p x(p, )

More information

Basic mathematics of economic models. 3. Maximization

Basic mathematics of economic models. 3. Maximization John Riley 1 January 16 Basic mathematics o economic models 3 Maimization 31 Single variable maimization 1 3 Multi variable maimization 6 33 Concave unctions 9 34 Maimization with non-negativity constraints

More information

Algebra II Notes Inverse Functions Unit 1.2. Inverse of a Linear Function. Math Background

Algebra II Notes Inverse Functions Unit 1.2. Inverse of a Linear Function. Math Background Algebra II Notes Inverse Functions Unit 1. Inverse o a Linear Function Math Background Previously, you Perormed operations with linear unctions Identiied the domain and range o linear unctions In this

More information

Ch. 2 Math Preliminaries for Lossless Compression. Section 2.4 Coding

Ch. 2 Math Preliminaries for Lossless Compression. Section 2.4 Coding Ch. 2 Math Preliminaries for Lossless Compression Section 2.4 Coding Some General Considerations Definition: An Instantaneous Code maps each symbol into a codeord Notation: a i φ (a i ) Ex. : a 0 For Ex.

More information

Section 3.4: Concavity and the second Derivative Test. Find any points of inflection of the graph of a function.

Section 3.4: Concavity and the second Derivative Test. Find any points of inflection of the graph of a function. Unit 3: Applications o Dierentiation Section 3.4: Concavity and the second Derivative Test Determine intervals on which a unction is concave upward or concave downward. Find any points o inlection o the

More information

Econ 201: Problem Set 3 Answers

Econ 201: Problem Set 3 Answers Econ 20: Problem Set 3 Ansers Instructor: Alexandre Sollaci T.A.: Ryan Hughes Winter 208 Question a) The firm s fixed cost is F C = a and variable costs are T V Cq) = 2 bq2. b) As seen in class, the optimal

More information

Algebra 1 Unit 3 Practice

Algebra 1 Unit 3 Practice Lesson 1-1 Use the table for Items 1 and. Canoe Rental Days Cost ($) 1 5 3 78 5 1 7 13 1. Use function notation to write a linear function that gives the cost C in dollars of renting a canoe for t days.

More information

Supplementary material for Continuous-action planning for discounted infinite-horizon nonlinear optimal control with Lipschitz values

Supplementary material for Continuous-action planning for discounted infinite-horizon nonlinear optimal control with Lipschitz values Supplementary material or Continuous-action planning or discounted ininite-horizon nonlinear optimal control with Lipschitz values List o main notations x, X, u, U state, state space, action, action space,

More information

(1) Sensitivity = 10 0 g x. (2) m Size = Frequency = s (4) Slenderness = 10w (5)

(1) Sensitivity = 10 0 g x. (2) m Size = Frequency = s (4) Slenderness = 10w (5) 1 ME 26 Jan. May 2010, Homeork #1 Solution; G.K. Ananthasuresh, IISc, Bangalore Figure 1 shos the top-vie of the accelerometer. We need to determine the values of, l, and s such that the specified requirements

More information

PHY 335 Data Analysis for Physicists

PHY 335 Data Analysis for Physicists PHY 335 Data Analysis or Physicists Instructor: Kok Wai Ng Oice CP 171 Telephone 7 1782 e mail: kng@uky.edu Oice hour: Thursday 11:00 12:00 a.m. or by appointment Time: Tuesday and Thursday 9:30 10:45

More information

Ch.03 Solving LP Models. Management Science / Prof. Bonghyun Ahn

Ch.03 Solving LP Models. Management Science / Prof. Bonghyun Ahn Ch.03 Solving LP Models Management Science / Prof. Bonghyun Ahn Chapter Topics Computer Solution Sensitivity Analysis 2 Computer Solution Early linear programming used lengthy manual mathematical solution

More information

Part I: Thin Converging Lens

Part I: Thin Converging Lens Laboratory 1 PHY431 Fall 011 Part I: Thin Converging Lens This eperiment is a classic eercise in geometric optics. The goal is to measure the radius o curvature and ocal length o a single converging lens

More information

Welcome Accelerated Algebra 2! Updates: U8Q1 will be 4/24 Unit Circle Quiz will be 4/24 U8T will be 5/1

Welcome Accelerated Algebra 2! Updates: U8Q1 will be 4/24 Unit Circle Quiz will be 4/24 U8T will be 5/1 Welcome Accelerated Algebra 2! Tear-Out: Pg. 487-492 (Class notes) Updates: U8Q1 will be 4/24 Unit Circle Quiz will be 4/24 U8T will be 5/1 Agenda (1) Warm-Up (2) Review U8H1 (3) Finish Trig Review (4)

More information

56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker

56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker 56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker Answer all of Part One and two (of the four) problems of Part Two Problem: 1 2 3 4 5 6 7 8 TOTAL Possible: 16 12 20 10

More information

The Primal-Dual Algorithm P&S Chapter 5 Last Revised October 30, 2006

The Primal-Dual Algorithm P&S Chapter 5 Last Revised October 30, 2006 The Primal-Dual Algorithm P&S Chapter 5 Last Revised October 30, 2006 1 Simplex solves LP by starting at a Basic Feasible Solution (BFS) and moving from BFS to BFS, always improving the objective function,

More information

set CANDIDATE; set ZONE; param revenue{candidate, ZONE} >= 0; var Assign{CANDIDATE, ZONE} binary;

set CANDIDATE; set ZONE; param revenue{candidate, ZONE} >= 0; var Assign{CANDIDATE, ZONE} binary; Assignment Problem Data Zone j = 1 2 3 4 5 6 Candidate i = 1 1 2 6 10 17 29 2 3 4 8 11 20 30 3 5 7 9 12 22 33 4 13 14 15 16 23 34 5 18 19 21 24 25 35 6 26 27 28 31 32 36 c ij = annual sales volume in $million

More information

Linear Programming, Lecture 4

Linear 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 information

1. Suppose preferences are represented by the Cobb-Douglas utility function, u(x1,x2) = Ax 1 a x 2

1. Suppose preferences are represented by the Cobb-Douglas utility function, u(x1,x2) = Ax 1 a x 2 Additional questions for chapter 7 1. Suppose preferences are represented by the Cobb-Douglas utility function ux1x2 = Ax 1 a x 2 1-a 0 < a < 1 &A > 0. Assuming an interior solution solve for the Marshallian

More information

In this episode of The Verification Corner, Rustan Leino talks about Loop Invariants. He gives a brief summary of the theoretical foundations and

In this episode of The Verification Corner, Rustan Leino talks about Loop Invariants. He gives a brief summary of the theoretical foundations and In this episode of The Verification Corner, Rustan Leino talks about Loop Invariants. He gives a brief summary of the theoretical foundations and shows how a program can sometimes be systematically constructed

More information

Chapter 8: MULTIPLE CONTINUOUS RANDOM VARIABLES

Chapter 8: MULTIPLE CONTINUOUS RANDOM VARIABLES Charles Boncelet Probabilit Statistics and Random Signals" Oord Uniersit Press 06. ISBN: 978-0-9-0005-0 Chapter 8: MULTIPLE CONTINUOUS RANDOM VARIABLES Sections 8. Joint Densities and Distribution unctions

More information

Graphical Solution of LP Models

Graphical Solution of LP Models Graphical Solution of LP Models Graphical solution is limited to linear programming mo dels containing only two decision variables (can be us ed with three variables but only with great difficulty). Graphical

More information

Modern Logistics & Supply Chain Management

Modern Logistics & Supply Chain Management Modern Logistics & Supply Chain Management As gold which he cannot spend will make no man rich, so knowledge which he cannot apply will make no man wise. Samuel Johnson: The Idler No. 84 Production Mix

More information

Syllabus Objective: 2.9 The student will sketch the graph of a polynomial, radical, or rational function.

Syllabus Objective: 2.9 The student will sketch the graph of a polynomial, radical, or rational function. Precalculus Notes: Unit Polynomial Functions Syllabus Objective:.9 The student will sketch the graph o a polynomial, radical, or rational unction. Polynomial Function: a unction that can be written in

More information

Business Cycles: The Classical Approach

Business Cycles: The Classical Approach San Francisco State University ECON 302 Business Cycles: The Classical Approach Introduction Michael Bar Recall from the introduction that the output per capita in the U.S. is groing steady, but there

More information

Linear Programming. H. R. Alvarez A., Ph. D. 1

Linear 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 information

Systems Analysis in Construction

Systems 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 information

y in both equations.

y in both equations. Syllabus Objective: 3.1 The student will solve systems of linear equations in two or three variables using graphing, substitution, and linear combinations. System of Two Linear Equations: a set of two

More information

MATH 445/545 Test 1 Spring 2016

MATH 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 information

Planning and Optimization

Planning and Optimization Planning and Optimization C23. Linear & Integer Programming Malte Helmert and Gabriele Röger Universität Basel December 1, 2016 Examples Linear Program: Example Maximization Problem Example maximize 2x

More information

Section 2.2 Objectives

Section 2.2 Objectives Section 2.2 Objectives Solve multi-step equations using algebra properties of equality. Solve equations that have no solution and equations that have infinitely many solutions. Solve equations with rational

More information

Linear Programming. Xi Chen. Department of Management Science and Engineering International Business School Beijing Foreign Studies University

Linear Programming. Xi Chen. Department of Management Science and Engineering International Business School Beijing Foreign Studies University Linear Programming Xi Chen Department of Management Science and Engineering International Business School Beijing Foreign Studies University Xi Chen (chenxi0109@bfsu.edu.cn) Linear Programming 1 / 148

More information

Applications of Linear Programming

Applications of Linear Programming Applications of Linear Programming lecturer: András London University of Szeged Institute of Informatics Department of Computational Optimization Lecture 9 Non-linear programming In case of LP, the goal

More information

Linear Programming. Dr. Xiaosong DING

Linear Programming. Dr. Xiaosong DING Linear Programming Dr. Xiaosong DING Department of Management Science and Engineering International Business School Beijing Foreign Studies University Dr. DING (xiaosong.ding@hotmail.com) Linear Programming

More information

EXAMINATION PAPER NUMBER OF PAGES: 4

EXAMINATION PAPER NUMBER OF PAGES: 4 EXAMINATION PAPER SUBJECT: CERTIFICATE IN STRATA CONTROL (COAL) SUBJECT CODE: EXAMINATION DATE: 18 OCTOBER 011 TIME: 14h30 17h30 EXAMINER: D. NEAL MODERATOR: B. MADDEN TOTAL MARKS: [100] PASS MARK: 60%

More information

Math 096--Quadratic Formula page 1

Math 096--Quadratic Formula page 1 Math 096--Quadratic Formula page 1 A Quadratic Formula. Use the quadratic formula to solve quadratic equations ax + bx + c = 0 when the equations can t be factored. To use the quadratic formula, the equation

More information

Optimization Methods in Management Science

Optimization Methods in Management Science Optimization Methods in Management Science MIT 15.053, Spring 2013 Problem Set 1 Second Group of Students (with first letter of surnames I Z) Problem Set Rules: Due: February 12, 2013 1. Each student should

More information

Example Problem. Linear Program (standard form) CSCI5654 (Linear Programming, Fall 2013) Lecture-7. Duality

Example Problem. Linear Program (standard form) CSCI5654 (Linear Programming, Fall 2013) Lecture-7. Duality CSCI5654 (Linear Programming, Fall 013) Lecture-7 Duality Lecture 7 Slide# 1 Lecture 7 Slide# Linear Program (standard form) Example Problem maximize c 1 x 1 + + c n x n s.t. a j1 x 1 + + a jn x n b j

More information

Intermediate 2 Revision Unit 3. (c) (g) w w. (c) u. (g) 4. (a) Express y = 4x + c in terms of x. (b) Express P = 3(2a 4d) in terms of a.

Intermediate 2 Revision Unit 3. (c) (g) w w. (c) u. (g) 4. (a) Express y = 4x + c in terms of x. (b) Express P = 3(2a 4d) in terms of a. Intermediate Revision Unit. Simplif 9 ac c ( ) u v u ( ) 9. Epress as a single fraction a c c u u a a (h) a a. Epress, as a single fraction in its simplest form Epress 0 as a single fraction in its simplest

More information

3.4 The Fundamental Theorem of Algebra

3.4 The Fundamental Theorem of Algebra 333371_0304.qxp 12/27/06 1:28 PM Page 291 3.4 The Fundamental Theorem of Algebra Section 3.4 The Fundamental Theorem of Algebra 291 The Fundamental Theorem of Algebra You know that an nth-degree polynomial

More information

Chapter 2 Introduction to Optimization & Linear Programming

Chapter 2 Introduction to Optimization & Linear Programming Chapter 2 - Introduction to Optimization & Linear Programming : S-1 Spreadsheet Modeling and Decision Analysis A Practical Introduction to Business Analytics 8th Edition Ragsdale SOLUTIONS MANUAL Full

More information

Eureka Lessons for 6th Grade Unit FIVE ~ Equations & Inequalities

Eureka Lessons for 6th Grade Unit FIVE ~ Equations & Inequalities Eureka Lessons for 6th Grade Unit FIVE ~ Equations & Inequalities These 2 lessons can easily be taught in 2 class periods. If you like these lessons, please consider using other Eureka lessons as well.

More information

Name Per. Keystone Exams Practice Test A.) $300,000 B.) $400,000 C.) $500,000 D.) $600,000

Name Per. Keystone Exams Practice Test A.) $300,000 B.) $400,000 C.) $500,000 D.) $600,000 Name Per Basic Skills Keystone Exams Practice Test 1.) A theme park charges $52 for a day pass and $110 for a week pass. Last month, 4,432 day passes and 979 week passes were sold. Which of the following

More information

ECE380 Digital Logic. Synchronous sequential circuits

ECE380 Digital Logic. Synchronous sequential circuits ECE38 Digital Logic Synchronous Sequential Circuits: State Diagrams, State Tables Dr. D. J. Jackson Lecture 27- Synchronous sequential circuits Circuits here a clock signal is used to control operation

More information

Optimization. Broadly two types: Unconstrained and Constrained optimizations We deal with constrained optimization. General form:

Optimization. Broadly two types: Unconstrained and Constrained optimizations We deal with constrained optimization. General form: Optimization Broadly two types: Unconstrained and Constrained optimizations We deal with constrained optimization General form: Min or Max f(x) (1) Subject to g(x) ~ b (2) lo < x < up (3) Some important

More information

INTRODUCTORY MATHEMATICAL ANALYSIS

INTRODUCTORY MATHEMATICAL ANALYSIS INTRODUCTORY MATHEMATICAL ANALYSIS For Business, Economics, and the Lie and Social Sciences Chapter 11 Dierentiation 011 Pearson Education, Inc. Chapter 11: Dierentiation Chapter Objectives To compute

More information

Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Module - 03 Simplex Algorithm Lecture 15 Infeasibility In this class, we

More information

Gaussian Process Regression Models for Predicting Stock Trends

Gaussian Process Regression Models for Predicting Stock Trends Gaussian Process Regression Models or Predicting Stock Trends M. Todd Farrell Andrew Correa December 5, 7 Introduction Historical stock price data is a massive amount o time-series data with little-to-no

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Introduction to Optimization (Spring 2004) Midterm Solutions

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Introduction to Optimization (Spring 2004) Midterm Solutions MASSAHUSTTS INSTITUT OF THNOLOGY 15.053 Introduction to Otimization (Sring 2004) Midterm Solutions Please note that these solutions are much more detailed that what was required on the midterm. Aggregate

More information

Storing energy or Storing Consumption?

Storing energy or Storing Consumption? Storing energy or Storing Consumption? It is not the same! Joachim Geske, Richard Green, Qixin Chen, Yi Wang 40th IAEE International Conference 18-21 June 2017, Singapore Motivation Electricity systems

More information

Math 381 Midterm Practice Problem Solutions

Math 381 Midterm Practice Problem Solutions Math 381 Midterm Practice Problem Solutions Notes: -Many of the exercises below are adapted from Operations Research: Applications and Algorithms by Winston. -I have included a list of topics covered on

More information

Lecture Notes 3: Duality

Lecture Notes 3: Duality Algorithmic Methods 1/11/21 Professor: Yossi Azar Lecture Notes 3: Duality Scribe:Moran Bar-Gat 1 Introduction In this lecture we will present the dual concept, Farkas s Lema and their relation to the

More information

Linear Programming: Computer Solution and Sensitivity Analysis

Linear Programming: Computer Solution and Sensitivity Analysis Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3 3-1 Chapter Topics Computer Solution Sensitivity Analysis 3-2 Computer Solution Early linear programming used lengthy manual mathematical

More information