Theoretical questions and problems to practice Advanced Mathematics and Statistics (MSc course)
|
|
- Gerald Malone
- 5 years ago
- Views:
Transcription
1 Theoretical questions and problems to practice Advanced Mathematics and Statistics (MSc course) Faculty of Business Administration M.Sc. English, 2015/16 first semester Topics (1) Complex numbers. Complex numbers and their binom, trigonometric and exponential form. Geometric representation of complex numbers on the complex plane. Operations with complex numbers and their geometrical meanings.calculation of powers and roots. (2) Difference equations. Existence and uniqueness theorem for first and second order difference equations. Solution of linear homogeneous difference equations with constant coefficients. Method of undetermined coefficients. (3) Linear programming. Problems leading to linear programming (LP) problems. Mathematical formulation. Graphical solution of two variable problems. Simplex method. The WinQSB software its usage and applications for solution of various problems: LP-ILP, transportation, work assignment, transshipment, traveling salesman etc. Important definitions, theorems (1) Complex numbers. The absolute value, argument of a complex number. Conjugate of a complex number. (2) Difference equations: general form of first and second order difference equations, Casorati determinant, characteristic equation of second order linear homogeneous equations,existence and uniqueness theorem for first and second order difference equations. (3) Linear programming: general formulation of standard normal maximum problems (see p.19/46 in Linear programming transparencies), explanation of the data (reduced cost, shadow price etc) in combined report of an LP solution in WinQSB (see p /46) (1) Let z 1 = 2 8i, z 2 = 2 2i, z 3 = 5+3i, z 4 = 8i, z 5 = 1+i, z 6 = 3 8i. Calculate the complex numbers z 1 + z 3, z 2 3iz 2, z 3 z 4, z 2 /z 6, z 3, z 6. Draw the complex numbers z 2, z 4, z 5, z 6 on the complex plane! Write the numbers z 2, z 4, z 5 in trigonometric and exponential form! Calculate z5 20 -t! Calculate and represent on the plane all values of the roots 3 z 2, 4 z 4, 3 z 5! (2) Find the general solutions of the difference equations (a) y(n + 2) 6y(n + 1) + 8y(n) = 0, (b) y(n + 2) + 2y(n + 1) + 3y(n) = 0, (c) y(n + 2) 8y(n + 1) + 16y(n) = 0, (d) 3y(n + 2) + 2y(n) = 4, (e) y(n + 2) + 2y(n + 1) + y(n) = 9 2 n, (f) y(n + 1) + 2y(n) = 5.
2 2 (3) Solve with WinQSB the LP problem: z = 3x 1 + 2x 2 + 5x 3 max subject to the constraints x 1 + 2x 2 x x 1 x 2 + 2x 3 5 x 2 + x 3 17 x 1, x 2, x 3 0 Explain the meaning of shadow price and reduced cost! (4) An LP problem was solved by WinQSB. The data entry and solution table is given below (a) Write down the LP problem in the usual (standard) form (denote the variables by x 1, x 2, x 3, x 4 nad by z the objective function)! (b) Explain the meaning of reduced cost, slack or surplus, shadow price in the solution table. (5) (a) Find the graphical solution of the LP problem : z = x 1 + x 2 maximum, subject to 3x 1 + 2x 2 6, 9x 1 + 2x 2 6, 2x 1 2, 3x 2 3, x 1, x 2 0. (b) Find the solution by WinQSB! (c) Find the integer solutions by WinQSB!
3 (6) (Transportation problem) Goods should be transported from 3 factories (T 1, T 2, T 3 ) to four supermarkets (S 1, S 2, S 3, S 4 ). The good can be shipped from any factory to any location. The productions (supplies) of the factories, the demands of the locations and the transportation costs/ unit of goods are given in the table below. Find the quantities of goods shipped from T i to S j such that the shipping costs be minimal and from any factory one cannot ship more than the production (supply) and, if possible the demand of the locations should be satisfied. 3 Supply S 1 S 2 S 3 S 4 T T T Demand Also give the LP model of the problem. (7) (Optimal roster of workers) A supermarket is open on all days of the week. Each worker of the supermarket works for five consecutive days then gets two free days. The roster changes in every month. Corresponding to this there are seven possible work schedules for each worker. We assume that all workers get the same wage, for weekdays 50$ per day, for Saturdays 70$ and for Sundays 100$. The number of workers needed for each day is known and given in the next table. It also gives the present roster: there are 32 workers, out of them working 4,4,6,6,4,4,4 with schedules 1.,2.,3.,4.,5.,6.,7. respectively. Schedule Free days working M Tu W Th F Sa S 1. Monday, Tuesday Tuesday, Wednesday Wednesday, Thursday Thursday, Friday Friday, Saturday Saturday, Sunday Sunday, Monday Total no. of w.: Requ. no. of w.: Presently the weekly wage of the 32 workers is = 9680$ as 24 workers work on Saturday and on Sunday Find the minimum numbers of workers and their roster such that on each day at least the required number of workers should work and the total weekly wage be minima. Give the LP model of the problem and find the solution by WinQSB! Hint: Denote by x 1, x 2, x 3, x 4, x 5, x 6, x 7 the number of workers working according to the schedule 1.,2.,3.,4.,5.,6.,7. respectively. The objective function is the total weekly wage, ILP (integer linear programming) module should be used the constraints come from the minimum number of workers required on each day. (8) (New data) A small airline flies to four different cities A,B,C,D from its Boston base. It owns one B707 jet, one propeller-driven Electra plane and one DC9 jet. Assuming constant flying conditions and passenger usage, the following data is available (trip cost return flight in $, trip revenue return flight in $, time in hours) Average flying data
4 4 City Trip cost Trip revenue time B707 A B707 B B707 C B707 D Electra A Electra B Electra C Electra D DC9 A DC9 B DC9 C DC9 D Formulate constraints to take into account the following: i) city D must be served twice daily; cities A, B, and C must be served three times daily; ii) limitation on number of planes available, assuming that each plane can fly at most 18 hours/day. Formulate objective functions for: i) cost minimization; ii) profit maximization; iii) fleet flying-time minimization. Indicate when a continuous linear-programming formulation is acceptable, and when an integer-programming formulation is required. Solve the problems i)-iii) by WinQSB. Solution: denote the number of daily (return) flights by B707 to cities A,B,C,D by x 1, x 2, x 3, x 4 respectively, by Electra to cities A,B,C,D by x 5, x 6, x 7, x 8 respectively,by DC9 to cities A,B,C,D by x 9, x 10, x 11, x 12 respectively: A B C D B707 x 1 x 2 x 3 x 4 Electra x 5 x 6 x 7 x 8 DC9 x 9 x 10 x 11 x 12 We have 4 constraints concerning the flight frequency and three constraints concerning the flight time of the planes: x 1 + x 5 + x 9 = 3 number of flights to A x 2 + x 6 + x 10 = 3 number of flights to B x 3 + x 7 + x 11 = 3 number of flights to C x 4 + x 8 + x 12 = 2 number of flights to D x 1 + 2x 2 + 5x 3 + 7x 4 18 flying hours of B707 2x 5 + 4x 6 + 8x x flying hours of Electra x 9 + 2x x x flying hours of DC9 The objective function for cost minimization (cost is measured in thousand dollar units) is z 1 = 6x 1 +7x 2 +8x 3 +10x 4 +x 5 +2x 6 +4x 7 +6x 8 +2x x 10 +6x x 12 minimum The data entry and solution tables for z 1 are:
5 5
6 6 The objective function for profit maximization is z 2 = x 1 + 2x 3 + 6x 4 + 2x 5 + 2x 6 + 2x 7 + 2x 8 + 2x 9 + 2x x x 12 maximum The data entry and solution tables for z 2 are:
7 7
8 8 The objective function for fleet flying-time minimization is z 3 = x 1 + 2x 2 + 5x 3 + 7x 4 + 2x 5 + 4x 6 + 8x x 8 + x 9 + 2x x x 12 minimum The data entry and solution tables for z 3 are:
9 9
10 10 (9) A portfolio manager in charge of a bank portfolio has $10 million to invest. The securities available for purchase, as well as their respective quality ratings, maturities in years, and yields in %, are shown in the next table. Lower bank rating means better quality. Name Type Moody s Quality Maturity Yield After tax yield A1 Municipal Aa A2 Agency Aa A3 Government Aaa A4 Government Aaa A5 Municipal Ba The bank places the following policy limitations on the portfolio manager s actions: (a) Government and agency bonds must total at least $4 million. (b) The average quality of the portfolio cannot exceed 1.4 on the bank s quality scale. (Note that a low number on this scale means a high-quality bond.) (c) The (weighted) average years to maturity of the portfolio must not exceed 5 years.
11 Assume that all securities are purchased at par (face value) and held to maturity and that the income on municipal bonds is tax-exempt. (a) The objective of the portfolio manager is to maximize after-tax earnings and that the tax rate is 50 percent, what bonds should he purchase? (b) If it became possible to borrow up to $1 million at 5.5 percent before taxes, how should his selection be changed? Formulate the LP model of the above problems and solve them by WinQSB! Leaving the question of borrowed funds aside for the moment, the decision variables for this problem are simply the dollar amount of each security to be purchased: x 1 =Amount to be invested in bond A; in millions of dollars. x 2 =Amount to be invested in bond B; in millions of dollars. x 3 =Amount to be invested in bond C; in millions of dollars. x 4 =Amount to be invested in bond D; in millions of dollars. x 5 =Amount to be invested in bond E; in millions of dollars. We must now determine the form of the objective function. Assuming that all securities are purchased at par (face value) and held to maturity and that the income on municipal bonds is tax-exempt, the after-tax earnings are given by: z = 0.043x x x x x 5. Now let us consider each of the restrictions of the problem. The portfolio manager has only a total of ten million dollars to invest, and therefore: x 1 + x 2 + x 3 + x 4 + x Further, of this amount at least $4 million must be invested in government and agency bonds. Hence, x 2 + x 3 + x 4 4. The (weighted) average quality of the portfolio, which is given by the ratio of the total quality to the total value of the portfolio, must not exceed 1.4: 2x 1 + 2x 2 + x 3 + x 4 + 5x 5 x 1 + x 2 + x 3 + x 4 + x Note that the inequality is less-than-or-equal-to, since a low number on the bank s quality scale means a high-quality bond. Multiplying by the denominator and re-arranging terms, we find that this inequality is clearly equivalent to the linear constraint: 0.6x x 2 0.4x 3 0.4x x 5 0. The constraint on the average maturity of the portfolio is a similar ratio. The average maturity must not exceed five years: which is equivalent to the linear constraint: 9x x 2 + 4x 3 + 3x 4 + 2x 5 x 1 + x 2 + x 3 + x 4 + x 5 5, 4x x 2 x 3 2x 4 3x 5 0. Note that the two ratio constraints are, in fact, nonlinear constraints, which would require sophisticated computational procedures if included in this form. However, simply multiplying both sides of each ratio constraint by its denominator (which must be nonnegative since it is the sum of nonnegative variables) transforms this nonlinear constraint 11
12 12 into a simple linear constraint. We can summarize our formulation in tableau form, as follows: z = 0.043x x x x x 5 maximum, subject to x 1 + x 2 + x 3 + x 4 + x 5 10 (cash limit) x 2 + x 3 + x 4 4 (government limit) 0.6x x 2 0.4x 3 0.4x x 5 0 (quality limit) 4x x 2 x 3 2x 4 3x 5 0 (maturity limit) Solution by WinQSB: data entry and solution table
13 13 The optimal solution is x 1 = x 2 = 0 x 3 = x 4 = 0 x 5 = and z max = Now consider the additional possibility of being able to borrow up to $1 million at an after-tax rate of Essentially, we can increase our cash supply above ten million by borrowing at the rate of 2.75 percent. We can define a new decision variable as follows: x 6 = amount borrowed in millions of dollars. There is an upper bound on the amount of funds that can be borrowed, and hence x 6 1. The cash constraint is then modified to reflect that the total amount purchased must be less than or equal to the cash that can be made available including borrowing: x 1 + x 2 + x 3 + x 4 + x x 6. Now, since the borrowed money costs 2.75 percent after taxes, the new after-tax earnings are: z = 0.043x x x x x y. We summarize the formulation when borrowing is allowed as follows: z = 0.043x x x x x x 6 maximum, subject to x 1 + x 2 + x 3 + x 4 + x x 6 (cash limit) x 2 + x 3 + x 4 4 (government limit) 0.6x x 2 0.4x 3 0.4x x 5 0 (quality limit) 4x x 2 x 3 2x 4 3x 5 0 (maturity limit) x 6 1 (borrowing limit) The data entry and solution tables are:
14 14 In this case the optimal solution is x 1 = x 2 = 0 x 3 = x 4 = 0 x 5 = x 6 = and z max = The maximum of one million was borrowed and the interest increased only by 2300$
Linear programming. Debrecen, 2015/16, 1st semester. University of Debrecen, Faculty of Business Administration 1 / 46
1 / 46 Linear programming László Losonczi University of Debrecen, Faculty of Business Administration Debrecen, 2015/16, 1st semester LP (linear programming) example 2 / 46 CMP is a cherry furniture manufacturer
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 informationMonth Demand Give an integer linear programming formulation for the problem of finding a production plan of minimum cost.
1.9 Modem production A company A, producing a single model of modem, is planning the production for the next 4 months. The producing capacity is of 2500 units per month, at a cost of 7 Euro per unit. A
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 information3 Development of the Simplex Method Constructing Basic Solution Optimality Conditions The Simplex Method...
Contents Introduction to Linear Programming Problem. 2. General Linear Programming problems.............. 2.2 Formulation of LP problems.................... 8.3 Compact form and Standard form of a general
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 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 informationSection #2: Linear and Integer Programming
Section #2: Linear and Integer Programming Prof. Dr. Sven Seuken 8.3.2012 (with most slides borrowed from David Parkes) Housekeeping Game Theory homework submitted? HW-00 and HW-01 returned Feedback on
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 informationThe Method of Substitution. Linear and Nonlinear Systems of Equations. The Method of Substitution. The Method of Substitution. Example 2.
The Method of Substitution Linear and Nonlinear Systems of Equations Precalculus 7.1 Here is an example of a system of two equations in two unknowns. Equation 1 x + y = 5 Equation 3x y = 4 A solution of
More informationLUNG CHEUNG GOVERNMENT SECONDARY SCHOOL Mock Examination 2006 / 2007 Mathematics and Statistics
S.7 LUNG CHEUNG GOVERNMENT SECONDARY SCHOOL Mock Examination 006 / 007 Mathematics and Statistics Maximum Mark: 100 Date: 1 007 Time: 8 30 11 30 1. This paper consists of Section A and Section B.. Answer
More informationCEE Computer Applications. Mathematical Programming (LP) and Excel Solver
CEE 3804 - Computer Applications Mathematical Programming (LP) and Excel Solver Dr. Antonio A. Trani Professor of Civil and Environmental Engineering Virginia Polytechnic Institute and State University
More informationDefinition. A matrix is a rectangular array of numbers enclosed by brackets (plural: matrices).
Matrices (general theory). Definition. A matrix is a rectangular array of numbers enclosed by brackets (plural: matrices). Examples. 1 2 1 1 0 2 A= 0 0 7 B= 0 1 3 4 5 0 Terminology and Notations. Each
More information9.5 THE SIMPLEX METHOD: MIXED CONSTRAINTS
SECTION 9.5 THE SIMPLEX METHOD: MIXED CONSTRAINTS 557 9.5 THE SIMPLEX METHOD: MIXED CONSTRAINTS In Sections 9. and 9., you looked at linear programming problems that occurred in standard form. The constraints
More informationWorksheet 1. CBSE-Class-VI-Mathematics. Knowing Our Numbers. 1. Tick ( ) the greatest and cross ( ) smallest number :
Knowing Our Numbers Worksheet 1 1. Tick ( ) the greatest and cross ( ) smallest number : 2117, 5719, 10036, 2159, 7315, 41083, 80751, 32190, 76019, 1256 2. Make the smallest and the greatest 4-digit number
More informationSection 8 Topic 1 Comparing Linear, Quadratic, and Exponential Functions Part 1
Section 8: Summary of Functions Section 8 Topic 1 Comparing Linear, Quadratic, and Exponential Functions Part 1 Complete the table below to describe the characteristics of linear functions. Linear Functions
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 informationPre-Algebra Semester 1 Practice Exam B DRAFT
. Evaluate x y 5 6 80 when x = 0 and y =.. Which expression is equivalent to? + + + +. In Pre-Algebra class, we follow the order of operations in evaluating expressions. Which operation should a student
More informationPENNSYLVANIA COMPENSATION RATING BUREAU F CLASS FILING INTERNAL RATE OF RETURN MODEL
F Class Exhibit 4 Proposed 10/1/16 PENNSYLVANIA COMPENSATION RATING BUREAU F CLASS FILING INTERNAL RATE OF RETURN MODEL The attached pages present exhibits and a description of the internal rate of return
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 informationAnswer the following questions: Q1: Choose the correct answer ( 20 Points ):
Benha University Final Exam. (ختلفات) Class: 2 rd Year Students Subject: Operations Research Faculty of Computers & Informatics Date: - / 5 / 2017 Time: 3 hours Examiner: Dr. El-Sayed Badr Answer the following
More informationProblem #1. The following matrices are augmented matrices of linear systems. How many solutions has each system? Motivate your answer.
Exam #4 covers the material about systems of linear equations and matrices (CH. 4.1-4.4, PART II); systems of linear inequalities in two variables (geometric approach) and linear programming (CH.5.1-5.2,
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 informationOptimization. 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 informationDELAWARE COMPENSATION RATING BUREAU, INC. Internal Rate Of Return Model
Exhibit 9 As Filed DELAWARE COMPENSATION RATING BUREAU, INC. Internal Rate Of Return Model The attached pages present exhibits and a description of the internal rate of return model used in deriving the
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 informationSchool of Business. Blank Page
Maxima and Minima 9 This unit is designed to introduce the learners to the basic concepts associated with Optimization. The readers will learn about different types of functions that are closely related
More informationApplication 1 - People Allocation in Line Balancing
Chapter 9 Workforce Planning Introduction to Lecture This chapter presents some applications of Operations Research models in workforce planning. Work force planning would be more of a generic application
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 informationApplications of Linear Programming - Minimization
Applications of Linear Programming - Minimization Drs. Antonio A. Trani and H. Baik Professor of Civil Engineering Virginia Tech Analysis of Air Transportation Systems June 9-12, 2010 1 of 49 Recall the
More informationWorked Examples for Chapter 5
Worked Examples for Chapter 5 Example for Section 5.2 Construct the primal-dual table and the dual problem for the following linear programming model fitting our standard form. Maximize Z = 5 x 1 + 4 x
More information36106 Managerial Decision Modeling Linear Decision Models: Part II
1 36106 Managerial Decision Modeling Linear Decision Models: Part II Kipp Martin University of Chicago Booth School of Business January 20, 2014 Reading and Excel Files Reading (Powell and Baker): Sections
More informationCambridge International Examinations Cambridge International General Certificate of Secondary Education
Cambridge International Examinations Cambridge International General Certificate of Secondary Education * 7 8 6 0 1 8 7 7 5 1 * MATHEMATICS 0580/31 Paper 3 (Core) May/June 2016 2 hours Candidates answer
More informationStudy Island. Linear and Exponential Models
Study Island Copyright 2014 Edmentum - All rights reserved. 1. A company is holding a dinner reception in a hotel ballroom. The graph represents the total cost of the ballroom rental and dinner. 3. In
More informationLinear Programming. Businesses seek to maximize their profits while operating under budget, supply, Chapter
Chapter 4 Linear Programming Businesses seek to maximize their profits while operating under budget, supply, labor, and space constraints. Determining which combination of variables will result in the
More informationExam. Name. Use the indicated region of feasible solutions to find the maximum and minimum values of the given objective function.
Exam Name Use the indicated region of feasible solutions to find the maximum and minimum values of the given objective function. 1) z = 12x - 22y y (0, 6) (1.2, 5) Solve the 3) The Acme Class Ring Company
More informationFort Bend Independent School District. Investment Report
Fort Bend Independent School District Investment Report June 30, 2012 Portfolio Composition by Investment Type June 30, 2012 Description Amount Cash $ 8,944,425 Money Market Funds 40,022,738 Texpool 56,590,370
More informationSAMPLE QUESTIONS. b = (30, 20, 40, 10, 50) T, c = (650, 1000, 1350, 1600, 1900) T.
SAMPLE QUESTIONS. (a) We first set up some constant vectors for our constraints. Let b = (30, 0, 40, 0, 0) T, c = (60, 000, 30, 600, 900) T. Then we set up variables x ij, where i, j and i + j 6. By using
More information6.2: The Simplex Method: Maximization (with problem constraints of the form )
6.2: The Simplex Method: Maximization (with problem constraints of the form ) 6.2.1 The graphical method works well for solving optimization problems with only two decision variables and relatively few
More informationCh.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 information6. For any event E, which is associated to an experiment, we have 0 P( 7. If E 1
CHAPTER PROBABILITY Points to Remember :. An activity which gives a result is called an experiment.. An experiment which can be repeated a number of times under the same set of conditions, and the outcomes
More information1.2 Start Thinking. 1.2 Warm Up. 1.2 Cumulative Review Warm Up
1.2 Start Thinking In 2007, the average American high school student spent 6.8 hours on homework per week. Suppose you kept track of the amount of time you spent on homework from last Monday through last
More informationUnit 4 Linear Functions
Algebra I: Unit 4 Revised 10/16 Unit 4 Linear Functions Name: 1 P a g e CONTENTS 3.4 Direct Variation 3.5 Arithmetic Sequences 2.3 Consecutive Numbers Unit 4 Assessment #1 (3.4, 3.5, 2.3) 4.1 Graphing
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 informationExercises - Linear Programming
Chapter 38 Exercises - Linear Programming By Sariel Har-Peled, December 10, 2007 1 Version: 1.0 This chapter include problems that are related to linear programming. 38.1 Miscellaneous Exercise 38.1.1
More information8.1 Apply Exponent Properties Involving Products. Learning Outcome To use properties of exponents involving products
8.1 Apply Exponent Properties Involving Products Learning Outcome To use properties of exponents involving products Product of Powers Property Let a be a real number, and let m and n be positive integers.
More informationLinear Modeling/Regression FUNCTION NOTATION
Linear Modeling/Regression FUNCTION NOTATION Given the function notation of a coordinate: a) Rewrite the coordinate as (x, y) b) Plot the point on the graph and give the quadrant it lies in 1) f() = 2)
More informationSeven is less than 11. Four more than seventeen. Four is not equal to three.
Prealgebra.1: Translations, Simplifying and Evaluating Expressions Words such as,, and indicate addition. Words such as,, and indicate subtraction. Translate each of the following into mathematical symbols.
More informationCollege Algebra. Word Problems
College Algebra Word Problems Example 2 (Section P6) The table shows the numbers N (in millions) of subscribers to a cellular telecommunication service in the United States from 2001 through 2010, where
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 informationSubtract 16 from both sides. Divide both sides by 9. b. Will the swing touch the ground? Explain how you know.
REVIEW EXAMPLES 1) Solve 9x + 16 = 0 for x. 9x + 16 = 0 9x = 16 Original equation. Subtract 16 from both sides. 16 x 9 Divide both sides by 9. 16 x Take the square root of both sides. 9 4 x i 3 Evaluate.
More informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Algebraic Concepts Review MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Solve the inequality. ) - - 0x - -x - ) A) x > -0 B) x < -0 C) x 0 D) x
More informationThis is Solving Linear Systems, chapter 4 from the book Beginning Algebra (index.html) (v. 1.0).
This is Solving Linear Systems, chapter 4 from the book Beginning Algebra (index.html) (v. 1.0). This book is licensed under a Creative Commons by-nc-sa 3.0 (http://creativecommons.org/licenses/by-nc-sa/
More informationDepartment Mission: Mandated Services: Department Overview:
Department: Treasurer FY 2019 Proposed Budget Department Mission: Our mission is to provide financial stewardship for Klamath County by safeguarding financial resources while maximizing investment return
More information3. If a forecast is too high when compared to an actual outcome, will that forecast error be positive or negative?
1. Does a moving average forecast become more or less responsive to changes in a data series when more data points are included in the average? 2. Does an exponential smoothing forecast become more or
More information2. Linear Programming Problem
. Linear Programming Problem. Introduction to Linear Programming Problem (LPP). When to apply LPP or Requirement for a LPP.3 General form of LPP. Assumptions in LPP. Applications of Linear Programming.6
More 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 informationToday: Linear Programming
Today: Linear Programming COSC 581, Algorithms March 27, 2014 Many of these slides are adapted from several online sources Today s class: Chapter 29.1 Reading Assignments Reading assignment for next Thursday
More informationOptimization Methods in Management Science
Problem Set Rules: Optimization Methods in Management Science MIT 15.053, Spring 2013 Problem Set 1 (Second Group of Students) Students with first letter of surnames G Z Due: February 12, 2013 1. Each
More informationSensitivity Analysis and Duality in LP
Sensitivity Analysis and Duality in LP Xiaoxi Li EMS & IAS, Wuhan University Oct. 13th, 2016 (week vi) Operations Research (Li, X.) Sensitivity Analysis and Duality in LP Oct. 13th, 2016 (week vi) 1 /
More informationLinear 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 informationDuality in LPP Every LPP called the primal is associated with another LPP called dual. Either of the problems is primal with the other one as dual. The optimal solution of either problem reveals the information
More 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 informationFixed Income Analytics Report
Fixed Income Analytics Report Prepared For: John Q Customer Presented By: Sample Report December 21, 2016 632880.1.0 Page 1 of 18 Disclaimer Individual bonds subject to price change and availability. Yields,
More informationINTERNET MAT 117. Solution for the Review Problems. (1) Let us consider the circle with equation. x 2 + 2x + y 2 + 3y = 3 4. (x + 1) 2 + (y + 3 2
INTERNET MAT 117 Solution for the Review Problems (1) Let us consider the circle with equation x 2 + y 2 + 2x + 3y + 3 4 = 0. (a) Find the standard form of the equation of the circle given above. (i) Group
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 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 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 informationOPERATIONS RESEARCH. Michał Kulej. Business Information Systems
OPERATIONS RESEARCH Michał Kulej Business Information Systems The development of the potential and academic programmes of Wrocław University of Technology Project co-financed by European Union within European
More 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 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 informationChapter 5 Integer Programming
Chapter 5 Integer Programming Chapter Topics Integer Programming (IP) Models Integer Programming Graphical Solution Computer Solution of Integer Programming Problems With Excel 2 1 Integer Programming
More informationEND3033 Operations Research I Sensitivity Analysis & Duality. to accompany Operations Research: Applications and Algorithms Fatih Cavdur
END3033 Operations Research I Sensitivity Analysis & Duality to accompany Operations Research: Applications and Algorithms Fatih Cavdur Introduction Consider the following problem where x 1 and x 2 corresponds
More informationParking Study MAIN ST
Parking Study This parking study was initiated to help understand parking supply and parking demand within Oneida City Center. The parking study was performed and analyzed by the Madison County Planning
More informationMean, Median, Mode, and Range
Mean, Median, Mode, and Range Mean, median, and mode are measures of central tendency; they measure the center of data. Range is a measure of dispersion; it measures the spread of data. The mean of a data
More information1 Review Session. 1.1 Lecture 2
1 Review Session Note: The following lists give an overview of the material that was covered in the lectures and sections. Your TF will go through these lists. If anything is unclear or you have questions
More informationReview for Intermediate Algebra (MATD 0390) Final Exam Oct 2009
Review for Intermediate Algebra (MATD 090) Final Eam Oct 009 Students are epected to know all relevant formulas, including: All special factoring formulas Equation of a circle All formulas for linear equations
More informationChapter 1 0+7= 1+6= 2+5= 3+4= 4+3= 5+2= 6+1= 7+0= How would you write five plus two equals seven?
Chapter 1 0+7= 1+6= 2+5= 3+4= 4+3= 5+2= 6+1= 7+0= If 3 cats plus 4 cats is 7 cats, what does 4 olives plus 3 olives equal? olives How would you write five plus two equals seven? Chapter 2 Tom has 4 apples
More informationActivity Predecessors Time (months) A - 2 B A 6 C A 4 D B 4 E C 2 F B,D 1 G D,E 2 H C 1. dummy0 C4 E2
AMS 341 (Spring, 2009) Exam 2 - Solution notes Estie Arkin Mean 68.56, median 70, high 99, low 13. 1. (12 points) A frazzled student is trying to plan all the work they must complete before graduating.
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 informationThe Dual Simplex Algorithm
p. 1 The Dual Simplex Algorithm Primal optimal (dual feasible) and primal feasible (dual optimal) bases The dual simplex tableau, dual optimality and the dual pivot rules Classical applications of linear
More informationIntroduction to optimization and operations research
Introduction to optimization and operations research David Pisinger, Fall 2002 1 Smoked ham (Chvatal 1.6, adapted from Greene et al. (1957)) A meat packing plant produces 480 hams, 400 pork bellies, and
More informationThe Simplex Method of Linear Programming
The Simplex Method of Linear Programming Online Tutorial 3 Tutorial Outline CONVERTING THE CONSTRAINTS TO EQUATIONS SETTING UP THE FIRST SIMPLEX TABLEAU SIMPLEX SOLUTION PROCEDURES SUMMARY OF SIMPLEX STEPS
More 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 informationUNIVERSITY of LIMERICK
UNIVERSITY of LIMERICK OLLSCOIL LUIMNIGH Department of Mathematics & Statistics Faculty of Science and Engineering END OF SEMESTER ASSESSMENT PAPER MODULE CODE: MS4303 SEMESTER: Spring 2018 MODULE TITLE:
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 informationChapter 1: Fundamentals of Algebra Lecture notes Math 1010
Section 1.1: The Real Number System Definition of set and subset A set is a collection of objects and its objects are called members. If all the members of a set A are also members of a set B, then A is
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 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 informationMulticriteria Decision Making
Multicriteria Decision Making Goal Programming Multicriteria Decision Problems Goal Programming Goal Programming: Formulation and Graphical Solution 1 Goal Programming Goal programming may be used to solve
More information(BASED ON MEMORY) HELD ON: TEST - I: REASONING ABILITY
RRB OFFICER (PT) (BASED ON MEMORY) HELD ON: 06-11-2016 TEST - I: REASONING ABILITY Directions (Q. 1-5): Study the given information carefully to answer the given questions. Eight people - E, F, G, H, Q,
More informationLecture Note 1: Introduction to optimization. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 1: Introduction to optimization Xiaoqun Zhang Shanghai Jiao Tong University Last updated: September 23, 2017 1.1 Introduction 1. Optimization is an important tool in daily life, business and
More informationSection 2.1 Objective 1: Determine If a Number Is a Solution of an Equation Video Length 5:19. Definition A in is an equation that can be
Section 2.1 Video Guide Linear Equations: The Addition and Multiplication Properties of Equality Objectives: 1. Determine If a Number Is a Solution of an Equation 2. Use the Addition Property of Equality
More informationIntermediate Mathematics League of Eastern Massachusetts
Intermediate Mathematics League of Eastern Massachusetts Meet #3 January, 2003 Category 1 Mystery 1. Jill is walking to school on June 2 nd and it occurs to her that there will be five Sundays this June.
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 informationWord Problems. Mathematics Division, IMSP, UPLB
Word Problems Objectives Upon completion, you should be able to: Translate English statements into mathematical statements Use the techniques learned in solving linear, quadratic and systems of equations
More informationCity of Eagleville Budget Presentation Fiscal Year 2018
City of Eagleville Budget Presentation Fiscal Year 2018 Work Sessions: March 9, 2017: March 23, 2017: April 13, 2017: General Fund Revenue Estimates Parks & Recreation State Street Aid Revenue and Expenses
More information2009 Math Olympics Level II Solutions
Saginaw Valley State University 009 Math Olympics Level II Solutions 1. f (x) is a degree three monic polynomial (leading coefficient is 1) such that f (0) 3, f (1) 5 and f () 11. What is f (5)? (a) 7
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 informationLinear Programming and Marginal Analysis
337 22 Linear Programming and Marginal Analysis This chapter provides a basic overview of linear programming, and discusses its relationship to the maximization and minimization techniques used for the
More information