Linear programming: introduction and examples
|
|
- Milo Mosley
- 5 years ago
- Views:
Transcription
1 Linear programming: introduction and examples G. Ferrari Trecate Dipartimento di Ingegneria Industriale e dell Informazione Università degli Studi di Pavia Industrial Automation Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 1 / 42
2 Linear Programming (LP) Widely used optimization technique in management science optimal allocation of limited resources for maximizing revenues or minimizing costs Basic problem A Linear Programming (LP) problem is (1) with f (x) = c T x (linear cost) g i (x) = a T i x b i (affine constraints) An LP problem is a convex optimization problem min g i (x) 0 f (x), x R n (1) i=1,2,...,m Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 2 / 42
3 Linear Programming (LP) Canonical form An LP problem is in canonical form if it is written as or min a T i x b i, i=1,2,...,m x j 0, j=1,2,...,n max a T i x b i, i=1,2,...,m x j 0, j=1,2,...,n c T x c T x constraints and positivity constraints on all variables Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 3 / 42
4 PL - matrix notation Vector inequalities x 0 means x 1 0 x x n 0 Constraints a1 T x b 1 a2 Tx b 2... amx T b m a T 1 a T Ax b, A = 2., b = b 2. b m a T m b 1 Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 4 / 42
5 PL - matrix notation LP problem in generic form min Ax b ct x LP problem in canonical form (LP-C) min c T x Ax b x 0 Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 5 / 42
6 LP and management science Typical decision problems in industry Product mix Diet problems Blending problems Transport problems Product mix with resource allocation Multiperiod production planning Portfolio optimization... Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 6 / 42
7 Product mix A company manifactures two radio models (low-cost and high-end) and produces two components Department A: antennas (max. 120h hours of production per day) 1h of work for a low-cost antenna 2h of work for a high-end antenna Department B: case (max. 90h hours of production per day) 1h of work for a low-cost case 1h of work for a high-end case Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 7 / 42
8 Product mix The company has two assembly lines (1 radio=1 antenna + 1 case) Line 1: production of low-cost models. No more than 70 units/day Line 2: production of high-end models. No more than 50 units/day Profits: 20 Euros for a low-cost radio and 30 Euros for a high-end radio. Assuming the company will sell all radios, which is the optimal number of units, for each model, that must be produced daily for maximizing the revenue? Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 8 / 42
9 Product mix Choice of variables Usually this is the most difficult step in representing decision problems as optimization problems! Guideline: cost and constraints must be a function of optimization variables only. Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 9 / 42
10 Product mix Choice of variables - product mix x 1 : number of produced low-cost radios per day x 2 : number of produced high-end radios per day Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 10 / 42
11 Product mix Choice of variables - product mix x 1 : number of produced low-cost radios per day x 2 : number of produced high-end radios per day Cost and type of problem Cost: 20x x 2, to be maximized Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 10 / 42
12 Product mix Constraints Capacity constraints of assembly lines x 1 70 (line 1) x 2 50 (line 2) Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 11 / 42
13 Product mix Constraints Capacity constraints of assembly lines x 1 70 (line 1) x 2 50 (line 2) Capacity constraints of production departments x 1 + 2x (department 1) x 1 + x 2 90 (department 2) Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 11 / 42
14 Product mix Constraints Capacity constraints of assembly lines x 1 70 (line 1) x 2 50 (line 2) Capacity constraints of production departments x 1 + 2x (department 1) x 1 + x 2 90 (department 2) Positivity constraints: x 1 0, x 2 0 Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 11 / 42
15 Product mix LP problem max x1,x 2 20x x 2 x 1 70 x 2 50 x 1 + 2x x 1 + x 2 90 x 1 0 x 2 0 Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 12 / 42
16 Product mix LP problem max x1,x 2 20x x 2 x 1 70 x 2 50 x 1 + 2x x 1 + x 2 90 x 1 0 x 2 0 LP problem - matrix notation min c T x Ax b x 0 [ x1 ] [ ] 20 x =, c = x A = , b = Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 13 / 42
17 Product mix revised A company manifactures two models of cases for telephones (model 1 and model 2). The production cycle comprises three phases with bounded resources that must be allocated to the two products Each phase is modeled through the maximal availability of men-hours per day and men-hours required to process a single unit Profits: 30 Euros for a model 1 unit and 20 Euros for a model 2 unit Assuming all cases will be sold, which is the optimal number of units, for each model, that must be produced daily for maximizing the revenue? Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 14 / 42
18 Product mix revised Choice of variables x 1 : n. of model 1 units x 2 : n. of model 2 units Cost and type of problem Cost: 30x x 2, to be maximized Constraints Capacity constraints in each phase Positivity constraints: x 1 0, x 2 0 8x 1 + 4x (assembly) 4x 1 + 6x (finishing) x 1 + x (quality control) Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 15 / 42
19 Product mix revised LP problem max x1,x 2 30x x 2 8x 1 + 4x x 1 + 6x x 1 + x x 1 0 x 2 0 LP problem - matrix notation max c T x Ax b x 0 [ ] [ ] x1 30 x =, c = x 2 20 A = , b = Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 16 / 42
20 Diet problem A company producing chicken food can use two types of additives with different vitamin contents. The product is obtained by mixing additives in a suitable quantity Vitamin contents and additive costs are given in the picture 1 box of chicken food must contain at least 2 gr. of vitamin A, at least 12 gr. of vitamin B, at least 36 gr. of vitamin C and at least 4 gr. of vitamin D Which is the quantity of additives that allows the company to produce one box of chicken food while minimizing the costs? Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 17 / 42
21 Diet problem Choice of variables x 1 : n. of boxes of Additive 1 x 2 : n. of boxes of Additive 2 Cost and type of problem Cost: 20x x 2, to be minimized Constraints Minimal quantities of vitamins Positivity constraints: x 1 0, x 2 0 x 1 2 (vitamin A) 2x 1 + x 2 12 (vitamin B) 2x 1 + 5x 2 36 (vitamin C) x 2 4 (vitamin D) Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 18 / 42
22 Diet problem LP problem min x1,x 2 20x x 2 x 1 2 2x 1 + x x 1 + 5x 2 36 x 2 4 x 1, x 2 0 LP problem - matrix notation min c T x Ax b x 0 [ ] [ ] x1 20 x =, c = x A = , b = Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 19 / 42
23 Blending problem A company produces 3 types of gasoline (leaded, unleaded, high-octane) blending 4 types of oils in suitable proportions Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 20 / 42
24 Blending problem Problem data The maximal number of available barrels and the buying costs are given in the picture Each gasoline type must fulfill the following composition requirements GASOLINE % of Oil 1 % of Oil 2 % of Oil 3 % of Oil 4 Leaded at least 40% no more than 20% at least 30% Unleaded at least 40% High octane at least 10% no more than 50% Gasoline selling prices are: 12 Euros/barrel for leaded, 18 Euros/barrel for unleaded and 10 Euros/barrel for high-octane Which are the optimal quantities of the 4 components that have to be bought in order to maximize the profits (profits = revenues - costs)? Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 21 / 42
25 Blending problem Choice of variables x ij : n. of barrels of oil i used for gasoline of type j, i = 1, 2, 3, 4, j {L, U, H}, L= Leaded, U= Unleaded, H= High-octane Cost and type of problem Cost to be maximized 12 4 x il + 18 i=1 4 x iu + 10 i=1 4 i=1 x ih }{{} revenues 9 x 1j 7 j {U,L,H} j {U,L,H} x 2j 12 j {U,L,H} x 3j 6 j {U,L,H} } {{ } costs x 4j Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 22 / 42
26 Blending problem Constraints Maximal availability of barrels x 1L + x 1U + x 1H 5000 (Oil 1) x 2L + x 2U + x 2H 2400 (Oil 2) x 3L + x 3U + x 3H 4000 (Oil 3) x 4L + x 4U + x 4H 1500 (Oil 4) Composition requirements x 1L x 1L +x 2L +x 3L +x 4L 0.4 in affine form 0.6x 1L 0.4x 2L 0.4x 3L 0.4x 4L 0 x 2L x 1L +x 2L +x 3L +x 4L 0.2 in affine form 0.2x 1L + 0.8x 2L 0.2x 3L 0.2x 4L 0 x 3L x 1L +x 2L +x 3L +x 4L 0.3 in affine form 0.3x 1L 0.3x 2L + 0.7x 3L 0.3x 4L 0 x 3U x 1U +x 2U +x 3U +x 4U 0.4 in affine form 0.4x 1U 0.4x 2U + 0.6x 3U 0.4x 4U 0 x 1H x 1H +x 2H +x 3H +x 4H 0.1 in affine form 0.9x 1H 0.1x 2H 0.1x 3H 0.1x 4H 0 x 2H x 1H +x 2H +x 3H +x 4H 0.5 in affine form 0.5x 1H + 0.5x 2H 0.5x 3H 0.5x 4H 0 Positivity constraints: x ij 0, i = 1, 2, 3, 4, j {U, L, H} Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 23 / 42
27 Blending problem LP problem - matrix notation with max c T x Ax b x 0 A = x = [ x 1L x 2L x 3L x 4L x 1U x 2U x 3U x 4U x 1H x 2H x 3H x 4H ] T c = [ ] T b = [ ] T Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 24 / 42
28 @ I Transport I I " A company owns n fuel storage points (i.e. n supply points) and it must supply m gas stations (i.e. m demand points). Every gas station can be reached from all storage points. Data and requirements Every storage point has a maximal availability of a i 0 i = 1,..., n liters of fuel Every gas station specifies a demand of b j 0, j = 1,..., m liters of fuel t ij 0 is the cost for shipping 1 liter of fuel from storage point i to gas station j Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 25 / 42
29 @ I Transport I I " Which are the optimal quantities of fuel to be shipped from each storage point to each gas station in order to minimize transport costs while fulfilling exactly the demands? Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 26 / 42
30 Transport problem Choice of variables x ij, i = 1,..., n, j = 1,..., m, n. of liters of fuel shipped from storage point i to gas station j Cost and type of problem Cost to be minimized n i=1 m t ij x ij j=1 Constraints Maximal availability of fuel at storage points m j=1 x ij a i, i = 1,..., n Demand constraints n i=1 x ij = b j, j = 1,..., m Positivity constraints: x ij 0, i = 1,..., n, j = 1,..., m Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 27 / 42
31 Transport problem LP problem min n i=1 n j=1 t ijx ij m j=1 x ij a i, i = 1,..., n n i=1 x ij = b j, j = 1,..., m (A) x ij 0, i = 1,..., n, j = 1,..., m Remarks Constraints (A) can be replaced by n i=1 x ij b j, j = 1,..., m. Why? Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 28 / 42
32 Transport problem LP problem min n i=1 n j=1 t ijx ij m j=1 x ij a i, i = 1,..., n n i=1 x ij = b j, j = 1,..., m (A) x ij 0, i = 1,..., n, j = 1,..., m Remarks Constraints (A) can be replaced by n i=1 x ij b j, j = 1,..., m. Why? The LP problem is always feasible? Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 28 / 42
33 Transport problem LP problem min n i=1 n j=1 t ijx ij m j=1 x ij a i, i = 1,..., n n i=1 x ij = b j, j = 1,..., m (A) x ij 0, i = 1,..., n, j = 1,..., m Remarks Constraints (A) can be replaced by n i=1 x ij b j, j = 1,..., m. Why? The LP problem is always feasible? NO! A necessary and sufficient condition for feasibility is n a i i=1 m j=1 b j Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 28 / 42
34 Product mix with resource allocation In standard product mix problems, capacity constraints are fixed. We now assume to have resources that can be allocated to different production phases A food company produces 4 products P i, i = 1, 2, 3, 4. Each product must go through 3 production lines L j, j = 1, 2, 3. Each line is modeled through the units of work (u.o.w.) required to process a single unit of product Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 29 / 42
35 Product mix with resource allocation Requirements At least 1000 units of P 2 and no more than 500 units of P 1 must be produced U.o.w are men-hours that fall in 7 categories T i, i = 1,..., 7 according to the versatility of workers Category Destination line Max. availability T 1 Line T 2 Line T 3 Line T 4 Lines 1 and T 5 Lines 1 and T 6 Lines 2 and T 7 Lines 1,2 and Profits per unit are 10 Euros for P 1, 12 Euros for P 2, 13 Euros for P 3 and 14 Euros for P 4 Assuming all products will be sold, which is a joint production and resource allocation plan that maximizes the profits? Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 30 / 42
36 Product mix with resource allocation Choice of variables Two categories of variables are needed P i, i = 1,..., 4: units of product i T 4 L 1, T 4 L 2, T 5 L 1, T 5 L 3, T 6 L 2, T 6 L 3, T 7 L 1, T 7 L 2, T 7 L 3. For instance T 4 L 1 is the number of men-hours of category T 4 allocated to line 1. Cost and type of problem Cost to be maximized 10P P P P 4 Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 31 / 42
37 Product mix with resource allocation Constraints Capacity constraints of production lines 2P 1 + 2P 2 + 3P 3 + 3P T 4 L 1 + T 5 L 1 + T 7 L 1 (line 1) 2P 1 + 3P 2 + P 3 + 2P T 4 L 2 + T 6 L 2 + T 7 L 2 (line 2) P 1 + 2P 2 + 2P 3 + 3P T 5 L 3 + T 6 L 3 + T 7 L 3 (line 3) Bounds on the number of products P P Maximal availability of u.o.w. for versatile workers T 4 L 1 + T 4 L T 5 L 1 + T 5 L T 6 L 2 + T 6 L T 7 L 1 + T 7 L 2 + T 7 L Positivity contraints: P 1, P 2, P 3, P 4, T 4 L 1, T 4 L 2, T 5 L 1, T 5 L 3, T 6 L 2, T 6 L 3, T 7 L 1, T 7 L 2, T 7 L 3 0 Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 32 / 42
38 Product mix with resource allocation LP problem max 10P P P P 4 2P 1 + 2P 2 + 3P 3 + 3P T 4 L 1 + T 5 L 1 + T 7 L 1 2P 1 + 3P 2 + P 3 + 2P T 4 L 2 + T 6 L 2 + T 7 L 2 P 1 + 2P 2 + 2P 3 + 3P T 5 L 3 + T 6 L 3 + T 7 L 3 P P T 4 L 1 + T 4 L T 5 L 1 + T 5 L T 6 L 2 + T 6 L T 7 L 1 + T 7 L 2 + T 7 L P 1, P 2, P 3, P 4, T 4 L 1, T 4 L 2, T 5 L 1, T 5 L 3 0 T 6 L 2, T 6 L 3, T 7 L 1, T 7 L 2, T 7 L 3 0 Exercise Write the LP problem in matrix notation Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 33 / 42
39 Multiperiod production planning A company must determine how many washing machines should be produced during each of the next 5 months. Washing machines production can be internal or subcontracted to another company. Production capacities and costs are given in the figure Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 34 / 42
40 Multiperiod production planning Data and Requirements Inventory cost: 2 Euros/unit for a whole month Inventory at the beginning of the first month: 300 units Inventory at the end of the fifth month: 300 units Demand during each of the next five months (the company must meet demands on time) Month Demand How many washing machines must be produced (internally and by the subcontractor), each month, in order to meet demands on time and minimize the costs? Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 35 / 42
41 Multiperiod production planning Choice of variables Three categories of variables are needed P i, i = 1,..., 5: units produced internally during month i S i, i = 1,..., 5: units produced by the subcontrator during month i I i, i = 1,..., 4: inventory at the end of month i Cost and type of problem Cost to be minimized 10 5 P i + 15 i=1 5 S i + 2 i=1 4 i=1 I i Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 36 / 42
42 Multiperiod production planning Constraints Maximal production P i 2000, i = 1,..., 5 (internal production) S i 600, i = 1,..., 5 (subcontracting) Balance constraints: for month i, Inventory at the end of month i = Inventory at the end of month i month i production month i demand I 1 = P 1 + S I 2 = +I 1 + P 2 + S I 3 = +I 2 + P 2 + S I 4 = +I 3 + P 3 + S = +I 4 + P 4 + S Positivity contraints: P i, S i 0, i = 1..., 5, I j 0, j = 1..., 4 Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 37 / 42
43 Multiperiod production planning LP problem min 10 5 i=1 P i i=1 S i P i 2000, i = 1,..., 5 S i 600, i = 1,..., 5 I 1 P 1 S 1 = I 2 I 1 P 2 S 2 = 2100 I 3 I 2 P 2 S 2 = 2400 I 4 I 3 P 3 S 3 = 3000 I 4 P 4 S 4 = P i, S i 0, i = 1..., 5 I j 0, j = 1..., 4 i=1 I i Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 38 / 42
44 Portfolio optimization A manager must decide how to invest Euros in different financial products. His goal is to maximize earnings while avoiding high risk exposure Financial products and expected return on investment Financial product Market Return % T 1 Cars - Germany 10.3 T 2 Cars - Japan 10.1 T 3 Computers - USA 11.8 T 4 Computers - USA 11.4 T 5 Household appliances - Europe 12.7 T 6 Household appliances - Asia 12.2 T 7 Insurance - Germany 9.5 T 8 Insurance - USA 9.9 T 9 BOT 3.6 T 10 CCT 4.2 Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 39 / 42
45 Portfolio optimization Investment requirements 1 No more than Euros in the car options 2 No more than Euros in the computer options 3 No more than Euros in the appliance options 4 At least Euros in the insurance options 5 At least Euros in BOT or CCT 6 At least 40% of the money invested in CCT must be invested in BOT 7 No more than Euros must be invested in German options 8 No more than Euros must be invested in USA options Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 40 / 42
46 Portfolio optimization Choice of variables T i, i = 1,..., 10: thousands of Euros invested in the financial product i Cost and type of problem Cost to be maximized 0.103T T T T T T T T T T 10 Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 41 / 42
47 Portfolio optimization Constraints Total investment: 10 i=1 T i = 500 Investment requirements: 1 T 1 + T T 3 + T T 5 + T T 7 + T T 9 + T T 9 0.4T T 1 + T T 3 + T 4 + T Positivity constraints: T i, 0, i = 1..., 10 Ferrari Trecate (DIS) Linear programming: introduction and examples Industrial Automation 42 / 42
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 informationMath 141:512. Practice Exam 1 (extra credit) Due: February 6, 2019
Math 141:512 Due: February 6, 2019 Practice Exam 1 (extra credit) This is an open book, extra credit practice exam which covers the material that Exam 1 will cover (Sections 1.3, 1.4, 2.1, 2.2, 2.3, 2.4,
More informationMATH 445/545 Homework 1: Due February 11th, 2016
MATH 445/545 Homework 1: Due February 11th, 2016 Answer the following questions Please type your solutions and include the questions and all graphics if needed with the solution 1 A business executive
More informationDRAFT Formulation and Analysis of Linear Programs
DRAFT Formulation and Analysis of Linear Programs Benjamin Van Roy and Kahn Mason c Benjamin Van Roy and Kahn Mason September 26, 2005 1 2 Contents 1 Introduction 7 1.1 Linear Algebra..........................
More informationMS-E2140. Lecture 1. (course book chapters )
Linear Programming MS-E2140 Motivations and background Lecture 1 (course book chapters 1.1-1.4) Linear programming problems and examples Problem manipulations and standard form Graphical representation
More informationDeterministic Operations Research, ME 366Q and ORI 391 Chapter 2: Homework #2 Solutions
Deterministic Operations Research, ME 366Q and ORI 391 Chapter 2: Homework #2 Solutions 11. Consider the following linear program. Maximize z = 6x 1 + 3x 2 subject to x 1 + 2x 2 2x 1 + x 2 20 x 1 x 2 x
More informationST. JOSEPH S COLLEGE OF ARTS & SCIENCE (AUTONOMOUS) CUDDALORE-1
ST. JOSEPH S COLLEGE OF ARTS & SCIENCE (AUTONOMOUS) CUDDALORE-1 SUB:OPERATION RESEARCH CLASS: III B.SC SUB CODE:EMT617S SUB INCHARGE:S.JOHNSON SAVARIMUTHU 2 MARKS QUESTIONS 1. Write the general model of
More informationChapter 4. Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall 4-1
Linear Programming: Modeling Examples Chapter 4 4-1 Chapter Topics A Product Mix Example A Diet Example An Investment Example A Marketing Example A Transportation Example A Blend Example A Multiperiod
More informationMS-E2140. Lecture 1. (course book chapters )
Linear Programming MS-E2140 Motivations and background Lecture 1 (course book chapters 1.1-1.4) Linear programming problems and examples Problem manipulations and standard form problems Graphical representation
More informationMethods and Models for Combinatorial Optimization
Methods and Models for Combinatorial Optimization Modeling by Linear Programming Luigi De Giovanni, Marco Di Summa Dipartimento di Matematica, Università di Padova De Giovanni, Di Summa MeMoCO 1 / 35 Mathematical
More informationQuadratic function and equations Quadratic function/equations, supply, demand, market equilibrium
Exercises 8 Quadratic function and equations Quadratic function/equations, supply, demand, market equilibrium Objectives - know and understand the relation between a quadratic function and a quadratic
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 informationThe Transportation Problem
CHAPTER 12 The Transportation Problem Basic Concepts 1. Transportation Problem: BASIC CONCEPTS AND FORMULA This type of problem deals with optimization of transportation cost in a distribution scenario
More informationChapter 2 Introduction to Optimization and Linear Programming
Ch. 2 Introduction to Optimization and Linear Programming TB-9 Chapter 2 Introduction to Optimization and Linear Programming Multiple Choice 1. What most motivates a business to be concerned with efficient
More informationFormulation Techniques. How To Build a Mathematical Model?
1.1 Formulation Techniques Katta G. Murty Lecture slides How To Build a Mathematical Model? 1. Identify All Decision Variables Controllable parameters whose values can be controlled by decision maker,
More informationDecision Models Lecture 5 1. Lecture 5. Foreign-Currency Trading Integer Programming Plant-location example Summary and Preparation for next class
Decision Models Lecture 5 1 Lecture 5 Foreign-Currency Trading Integer Programming Plant-location example Summary and Preparation for next class Foreign Exchange (FX) Markets Decision Models Lecture 5
More informationChapter 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 informationNumerical Optimization
Linear Programming Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on min x s.t. Transportation Problem ij c ijx ij 3 j=1 x ij a i, i = 1, 2 2 i=1 x ij
More informationLINEAR PROGRAMMING MODULE Part 1 - Model Formulation INTRODUCTION
Name: LINEAR PROGRAMMING MODULE Part 1 - Model Formulation INTRODUCTION In general, a mathematical model is either deterministic or probabilistic. For example, the models and algorithms shown in the Graph-Optimization
More informationINFORMS Annual Meeting Nashville November 13, 2016
Carsharing Fleet Location Design with Mixed Vehicle Types for CO2 Emission Reduction Joy Chang Joint work with Siqian Shen (U of Michigan IOE) and Ming Xu (U of Michigan SNRE) INFORMS Annual Meeting Nashville
More informationAn Introduction to Linear Programming
An Introduction to Linear Programming Linear Programming Problem Problem Formulation A Maximization Problem Graphical Solution Procedure Extreme Points and the Optimal Solution Computer Solutions A Minimization
More informationLINEAR PROGRAMMING BASIC CONCEPTS AND FORMULA
CHAPTER 11 LINEAR PROGRAMMING Basic Concepts 1. Linear Programming BASIC CONCEPTS AND FORMULA Linear programming is a mathematical technique for determining the optimal allocation of re- sources nd achieving
More informationLinear Programming CHAPTER 11 BASIC CONCEPTS AND FORMULA. Basic Concepts 1. Linear Programming
CHAPTER 11 Linear Programming Basic Concepts 1. Linear Programming BASIC CONCEPTS AND FORMULA Linear programming is a mathematical technique for determining the optimal allocation of re- sources nd achieving
More informationApplications of Systems of Linear Inequalities
Applications of Systems of Linear Inequalities Finite Math 26 April 2017 Finite Math Applications of Systems of Linear Inequalities 26 April 2017 1 / 17 Quiz What does it mean for a feasible region to
More informationSECTION 5.1: Polynomials
1 SECTION 5.1: Polynomials Functions Definitions: Function, Independent Variable, Dependent Variable, Domain, and Range A function is a rule that assigns to each input value x exactly output value y =
More informationHandout 1: Introduction to Dynamic Programming. 1 Dynamic Programming: Introduction and Examples
SEEM 3470: Dynamic Optimization and Applications 2013 14 Second Term Handout 1: Introduction to Dynamic Programming Instructor: Shiqian Ma January 6, 2014 Suggested Reading: Sections 1.1 1.5 of Chapter
More informationChapter 2 An Introduction to Linear Programming
Chapter 2 n Introduction to Linear Programming Learning Objectives 1. Obtain an overview of the kinds of problems linear programming has been used to solve. 2. Learn how to develop linear programming models
More informationLinear Programming. Formulating and solving large problems. H. R. Alvarez A., Ph. D. 1
Linear Programming Formulating and solving large problems http://academia.utp.ac.pa/humberto-alvarez H. R. Alvarez A., Ph. D. 1 Recalling some concepts As said, LP is concerned with the optimization of
More informationOperations Research: Introduction. Concept of a Model
Origin and Development Features Operations Research: Introduction Term or coined in 1940 by Meclosky & Trefthan in U.K. came into existence during World War II for military projects for solving strategic
More information56: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 informationGraph 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 informationTransportation Problem
Transportation Problem. Production costs at factories F, F, F and F 4 are Rs.,, and respectively. The production capacities are 0, 70, 40 and 0 units respectively. Four stores S, S, S and S 4 have requirements
More informationMethods and Models for Combinatorial Optimization. We have seen... Luigi De Giovanni, Marco Di Summa. Introduction
Methods and Models for Combinatorial Optimization Introduction Luigi De Giovanni, Marco Di Summa Dipartimento di Matematica, Università di Padova De Giovanni, Di Summa MeMoCO 1 / 36 We have seen... Course
More informationStudy Unit 3 : Linear algebra
1 Study Unit 3 : Linear algebra Chapter 3 : Sections 3.1, 3.2.1, 3.2.5, 3.3 Study guide C.2, C.3 and C.4 Chapter 9 : Section 9.1 1. Two equations in two unknowns Algebraically Method 1: Elimination Step
More informationExtrema and the First-Derivative Test
Extrema and the First-Derivative Test MATH 151 Calculus for Management J. Robert Buchanan Department of Mathematics 2018 Why Maximize or Minimize? In almost all quantitative fields there are objective
More informationCOT 6936: Topics in Algorithms! Giri Narasimhan. ECS 254A / EC 2443; Phone: x3748
COT 6936: Topics in Algorithms! Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 giri@cs.fiu.edu https://moodle.cis.fiu.edu/v2.1/course/view.php?id=612 Gaussian Elimination! Solving a system of simultaneous
More informationConcept and Definition. Characteristics of OR (Features) Phases of OR
Concept and Definition Operations research signifies research on operations. It is the organized application of modern science, mathematics and computer techniques to complex military, government, business
More informationPART 4 INTEGER PROGRAMMING
PART 4 INTEGER PROGRAMMING 102 Read Chapters 11 and 12 in textbook 103 A capital budgeting problem We want to invest $19 000 Four investment opportunities which cannot be split (take it or leave it) 1.
More informationMAT 111 Final Exam Fall 2013 Name: If solving graphically, sketch a graph and label the solution.
MAT 111 Final Exam Fall 2013 Name: Show all work on test to receive credit. Draw a box around your answer. If solving algebraically, show all steps. If solving graphically, sketch a graph and label the
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 informationWe start by giving some examples of linear programs and how they are used in practice.
Chapter 1 Linear programming We start by giving some examples of linear programs and how they are used in practice. A healthy and low-priced diet Imagine you are going on a long vacation and you need to
More informationUNIVERSITY OF KWA-ZULU NATAL
UNIVERSITY OF KWA-ZULU NATAL EXAMINATIONS: June 006 Solutions Subject, course and code: Mathematics 34 MATH34P Multiple Choice Answers. B. B 3. E 4. E 5. C 6. A 7. A 8. C 9. A 0. D. C. A 3. D 4. E 5. B
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 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 informationNonlinear Optimization: The art of modeling
Nonlinear Optimization: The art of modeling INSEAD, Spring 2006 Jean-Philippe Vert Ecole des Mines de Paris Jean-Philippe.Vert@mines.org Nonlinear optimization c 2003-2006 Jean-Philippe Vert, (Jean-Philippe.Vert@mines.org)
More informationLinear Programming. (Com S 477/577 Notes) Yan-Bin Jia. Nov 28, 2017
Linear Programming (Com S 4/ Notes) Yan-Bin Jia Nov 8, Introduction Many problems can be formulated as maximizing or minimizing an objective in the form of a linear function given a set of linear constraints
More informationORI 390Q Models and Analysis of Manufacturing Systems First Exam, fall 1994
ORI 90Q Models and Analysis of Manufacturing Systems First Exam, fall 1994 (time, defect rate) (12,0.05) 5 6 V A (16,0.07) (15,0.07) (5,0) M 1 1 2 M1 M2 O A (10,0.1) 7 8 V B (8,0.2) M4 2 4 M5 The figure
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 informationOptimization. Using Analytic Solver Platform REVIEW BASED ON MANAGEMENT SCIENCE
Optimization Using Analytic Solver Platform REVIEW BASED ON MANAGEMENT SCIENCE What We ll Cover Today Introduction Session ΙΙ beta training program goals Classic Models for Common Business Situations Focus
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 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 informationLinear Programming Duality
Summer 2011 Optimization I Lecture 8 1 Duality recap Linear Programming Duality We motivated the dual of a linear program by thinking about the best possible lower bound on the optimal value we can achieve
More informationSolution Cases: 1. Unique Optimal Solution Reddy Mikks Example Diet Problem
Solution Cases: 1. Unique Optimal Solution 2. Alternative Optimal Solutions 3. Infeasible solution Case 4. Unbounded Solution Case 5. Degenerate Optimal Solution Case 1. Unique Optimal Solution Reddy Mikks
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 information3. Find the slope of the tangent line to the curve given by 3x y e x+y = 1 + ln x at (1, 1).
1. Find the derivative of each of the following: (a) f(x) = 3 2x 1 (b) f(x) = log 4 (x 2 x) 2. Find the slope of the tangent line to f(x) = ln 2 ln x at x = e. 3. Find the slope of the tangent line to
More informationCHAPTER 11 Integer Programming, Goal Programming, and Nonlinear Programming
Integer Programming, Goal Programming, and Nonlinear Programming CHAPTER 11 253 CHAPTER 11 Integer Programming, Goal Programming, and Nonlinear Programming TRUE/FALSE 11.1 If conditions require that all
More informationIntroduction to Operations Research Answers to selected problems
Exercise session 1 Introduction to Operations Research Answers to selected problems 1. Decision variables: Prof. dr. E-H. Aghezzaf, assistant D. Verleye Department of Industrial Management (IR18) x 1 =
More informationChapter 1 Linear Equations
. Lines. True. True. If the slope of a line is undefined, the line is vertical. 7. The point-slope form of the equation of a line x, y is with slope m containing the point ( ) y y = m ( x x ). Chapter
More informationOPTIMIZATION. joint course with. Ottimizzazione Discreta and Complementi di R.O. Edoardo Amaldi. DEIB Politecnico di Milano
OPTIMIZATION joint course with Ottimizzazione Discreta and Complementi di R.O. Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-15-16.shtml
More informationOptimization Methods in Management Science
Problem Set Rules: Optimization Methods in Management Science MIT 15.053, Spring 2013 Problem Set 1 (First Group of Students) Students with first letter of surnames A F Due: February 12, 2013 1. Each student
More information2 Functions and Their
CHAPTER Functions and Their Applications Chapter Outline Introduction The Concept of a Function Types of Functions Roots (Zeros) of a Function Some Useful Functions in Business and Economics Equilibrium
More informationFinancial Optimization ISE 347/447. Lecture 21. Dr. Ted Ralphs
Financial Optimization ISE 347/447 Lecture 21 Dr. Ted Ralphs ISE 347/447 Lecture 21 1 Reading for This Lecture C&T Chapter 16 ISE 347/447 Lecture 21 2 Formalizing: Random Linear Optimization Consider the
More information4. Duality Duality 4.1 Duality of LPs and the duality theorem. min c T x x R n, c R n. s.t. ai Tx = b i i M a i R n
2 4. Duality of LPs and the duality theorem... 22 4.2 Complementary slackness... 23 4.3 The shortest path problem and its dual... 24 4.4 Farkas' Lemma... 25 4.5 Dual information in the tableau... 26 4.6
More informationNATIONAL OPEN UNIVERSITY OF NIGERIA SCHOOL OF SCIENCE AND TECHNOLOGY COURSE CODE: MTH 309 COURSE TITLE: OPTIMIZATION THEORY
NATIONAL OPEN UNIVERSITY OF NIGERIA SCHOOL OF SCIENCE AND TECHNOLOGY COURSE CODE: MTH 39 COURSE TITLE: OPTIMIZATION THEORY MTH 39 OPTIMIZATION THEORY Prof. U. A. Osisiogu August 28, 22 CONTENTS I 7 Linear
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 informationPlanning 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 informationMA 162: Finite Mathematics - Section 3.3/4.1
MA 162: Finite Mathematics - Section 3.3/4.1 Fall 2014 Ray Kremer University of Kentucky October 6, 2014 Announcements: Homework 3.3 due Tuesday at 6pm. Homework 4.1 due Friday at 6pm. Exam scores were
More informationcan be used to represent this situation.
Question 1. Solve the real-world situation by using the substitution method. A cable television provider has a $70 setup fee and charges $82 per month, while a satellite television provider has a $175
More informationPROJECT MANAGEMENT CHAPTER 1
PROJECT MANAGEMENT CHAPTER 1 Project management is the process and activity of planning, organizing, motivating, and controlling resources, procedures and protocols to achieve specific goals in scientific
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 informationProgrammers A B C D Solution:
P a g e Q: A firm has normally distributed forecast of usage with MAD=0 units. It desires a service level, which limits the stock, out to one order cycle per year. Determine Standard Deviation (SD), if
More informationExam 3 Review Math 118 Sections 1 and 2
Exam 3 Review Math 118 Sections 1 and 2 This exam will cover sections 5.3-5.6, 6.1-6.3 and 7.1-7.3 of the textbook. No books, notes, calculators or other aids are allowed on this exam. There is no time
More informationPre-Leaving Certificate Examination, 2017 Triailscrúdú na hardteistiméireachta, Mathematics. Paper 1. Higher Level. 2½ hours.
*P6* Pre-Leaving Certificate Examination, 2017 Triailscrúdú na hardteistiméireachta, 2017 Mathematics Paper 1 Higher Level 2½ hours 300 marks Name: School: Address: Class: Teacher: For examiner Question
More informationOptimeringslära för F (SF1811) / Optimization (SF1841)
Optimeringslära för F (SF1811) / Optimization (SF1841) 1. Information about the course 2. Examples of optimization problems 3. Introduction to linear programming Introduction - Per Enqvist 1 Linear programming
More informationRELATIONS AND FUNCTIONS
RELATIONS AND FUNCTIONS Definitions A RELATION is any set of ordered pairs. A FUNCTION is a relation in which every input value is paired with exactly one output value. Example 1: Table of Values One way
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 informationCourse Notes for MS4303 Operations Research 1
Course Notes for MS4303 Operations Research 1 J. Kinsella March 23, 2018 0-0 MS4303 Operations Research 1 1 About the Course Lectures: Monday 14:00 S2 06 Thursday 09:00 P1 033 Tutorials: (starting in Week
More informationIntroduction 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 informationMath 101 Final Exam Review Solutions. Eric Schmutz
Math 101 Final Exam Review Solutions Eric Schmutz Problem 1. Write an equation of the line passing through (,7) and (-1,1). Let (x 1, y 1 ) = (, 7) and (x, y ) = ( 1, 1). The slope is m = y y 1 x x 1 =
More information3E4: Modelling Choice
3E4: Modelling Choice Lecture 6 Goal Programming Multiple Objective Optimisation Portfolio Optimisation Announcements Supervision 2 To be held by the end of next week Present your solutions to all Lecture
More information1.4 CONCEPT QUESTIONS, page 49
.4 CONCEPT QUESTIONS, page 49. The intersection must lie in the first quadrant because only the parts of the demand and supply curves in the first quadrant are of interest.. a. The breakeven point P0(
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 informationIntroduction to linear programming using LEGO.
Introduction to linear programming using LEGO. 1 The manufacturing problem. A manufacturer produces two pieces of furniture, tables and chairs. The production of the furniture requires the use of two different
More information...(iii), x 2 Example 7: Geetha Perfume Company produces both perfumes and body spray from two flower extracts F 1. The following data is provided:
The LP formulation is Linear Programming: Graphical Method Maximize, Z = 2x + 7x 2 Subject to constraints, 2x + x 2 200...(i) x 75...(ii) x 2 00...(iii) where x, x 2 ³ 0 Example 7: Geetha Perfume Company
More informationMoral Hazard: Part 1. April 9, 2018
Moral Hazard: Part 1 April 9, 2018 Introduction In a standard moral hazard problem, the agent A is characterized by only one type. As with adverse selection, the principal P wants to engage in an economic
More informationStochastic Optimization
Chapter 27 Page 1 Stochastic Optimization Operations research has been particularly successful in two areas of decision analysis: (i) optimization of problems involving many variables when the outcome
More informationSECTION 3.2: Graphing Linear Inequalities
6 SECTION 3.2: Graphing Linear Inequalities GOAL: Graphing One Linear Inequality Example 1: Graphing Linear Inequalities Graph the following: a) x + y = 4 b) x + y 4 c) x + y < 4 Graphing Conventions:
More informationDEPARTMENT OF MATHEMATICS
This is for your practice. DEPARTMENT OF MATHEMATICS Ma162 Samples from old Final Exams 1. Fred Foy has $100, 000 to invest in stocks, bonds and a money market account. The stocks have an expected return
More informationLesson 7: Literal Equations, Inequalities, and Absolute Value
, and Absolute Value In this lesson, we first look at literal equations, which are equations that have more than one variable. Many of the formulas we use in everyday life are literal equations. We then
More information42 Average risk. Profit = (8 5)x 1 é ù. + (14 10)x 3
CHAPTER 2 1. Let x 1 and x 2 be the output of P and V respectively. The LPP is: Maximise Z = 40x 1 + 30x 2 Profit Subject to 400x 1 + 350x 2 250,000 Steel 85x 1 + 50x 2 26,100 Lathe 55x 1 + 30x 2 43,500
More informationChapter 2: Linear Programming Basics. (Bertsimas & Tsitsiklis, Chapter 1)
Chapter 2: Linear Programming Basics (Bertsimas & Tsitsiklis, Chapter 1) 33 Example of a Linear Program Remarks. minimize 2x 1 x 2 + 4x 3 subject to x 1 + x 2 + x 4 2 3x 2 x 3 = 5 x 3 + x 4 3 x 1 0 x 3
More informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 1: Introduction Prof. John Gunnar Carlsson September 8, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 8, 2010 1 / 35 Administrivia
More informationLecture 6: Sections 2.2 and 2.3 Polynomial Functions, Quadratic Models
L6-1 Lecture 6: Sections 2.2 and 2.3 Polynomial Functions, Quadratic Models Polynomial Functions Def. A polynomial function of degree n is a function of the form f(x) = a n x n + a n 1 x n 1 +... + a 1
More informationSELECT TWO PROBLEMS (OF A POSSIBLE FOUR) FROM PART ONE, AND FOUR PROBLEMS (OF A POSSIBLE FIVE) FROM PART TWO. PART ONE: TOTAL GRAND
1 56:270 LINEAR PROGRAMMING FINAL EXAMINATION - MAY 17, 1985 SELECT TWO PROBLEMS (OF A POSSIBLE FOUR) FROM PART ONE, AND FOUR PROBLEMS (OF A POSSIBLE FIVE) FROM PART TWO. PART ONE: 1 2 3 4 TOTAL GRAND
More informationChapter 14: Basics of Functions
Math 91 Final Exam Study Guide Name Chapter 14: Basics of Functions Find the domain and range. 1) {(5,1), (5,-4), (6,7), (3,4), (-9,-6)} Find the indicated function value. 2) Find f(3) when f(x) = x2 +
More informationIntroduction to Systems of Equations
Systems of Equations 1 Introduction to Systems of Equations Remember, we are finding a point of intersection x 2y 5 2x y 4 1. A golfer scored only 4 s and 5 s in a round of 18 holes. His score was 80.
More informationNonlinear systems. Lyapunov stability theory. G. Ferrari Trecate
Nonlinear systems Lyapunov stability theory G. Ferrari Trecate Dipartimento di Ingegneria Industriale e dell Informazione Università degli Studi di Pavia Advanced automation and control Ferrari Trecate
More informationCSC Design and Analysis of Algorithms. LP Shader Electronics Example
CSC 80- Design and Analysis of Algorithms Lecture (LP) LP Shader Electronics Example The Shader Electronics Company produces two products:.eclipse, a portable touchscreen digital player; it takes hours
More informationReal-Time Optimization (RTO)
Real-Time Optimization (RTO) In previous chapters we have emphasized control system performance for disturbance and set-point changes. Now we will be concerned with how the set points are specified. In
More informationPractice Questions for Math 131 Exam # 1
Practice Questions for Math 131 Exam # 1 1) A company produces a product for which the variable cost per unit is $3.50 and fixed cost 1) is $20,000 per year. Next year, the company wants the total cost
More information