Exam. Name. Use the indicated region of feasible solutions to find the maximum and minimum values of the given objective function.
|
|
- Esmond Bell
- 6 years ago
- Views:
Transcription
1 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 designs and sells two types of rings: the VIP and the SST. They can produce up to 24 rings each day using up to 60 total man-hours of labor. It takes 3 man-hours to make one VIP ring and 2 man-hours to make one SST ring. How many of each type of ring should be made daily to maximize the company's profit, if the profit on a VIP ring is $30 and on an SST ring is $40? (5, 0) Use graphical methods to solve the linear programming 2) Maximize z = 8x + 12y subject to: 40x + 80y x + 8y 72 x 0 y 0 y x x 4) Zach is planning to invest up to $50,000 in corporate and municipal bonds. The least he will invest in corporate bonds is $6000 and he does not want to invest more than $29,000 in corporate bonds. He also does not want to invest more than $28,174 in municipal bonds. The interest is 8.5% on corporate bonds and 6.8% on municipal bonds. This is simple interest for one year. What is the maximum value of his investment after one year? 5) An airline with two types of airplanes, P1 and P2, has contracted with a tour group to provide transportation for a minimum of 400 first class, 900 tourist class, and 1500 economy class passengers. For a certain trip, airplane P1 costs $10,000 to operate and can accomodate 20 first class, 50 tourist class, and 110 economy class passengers. Airplane P2 costs $8500 to operate and can accomodate 18 first class, 30 tourist class, and 44 economy class passengers. How many of each type of airplane should be used in order to minimize the operating cost? Pivot once about the circled element in the simplex tableau, and read the solution from the result. 6) 1
2 7) 8) Write the solutions that can be read from the simplex tableau. 13) x1 x2 x3 s1 s2 z ) x1 x2 s1 s2 s3 z ) 15) x1 x2 s1 s2 s3 z Introduce slack variables as necessary, and write the initial simplex tableau for the 10) Find x1 0 and x2 0 such that 5x1 + 10x x1 + 15x2 136 and z = 2x1 + 5x2 is maximized. 11) Find x1 0 and x2 0 such that 2x1 + 5x2 7 3x1 + 3x2 18 and z = 4x1 + x2 is maximized. 12) Find x1 0 and x2 0 such that x1 + x2 64 3x1 + x2 171 and z = 2x1 + x2 is maximized. 16) x1 x2 x3 s1 s2 z ) x1 x2 x3 s1 s2 z A manufacturing company wants to maximize profits on products A, B, and C. The profit margin is $3 for A, $6 for B, and $15 for C. The production requirements and departmental capacities are as follows: Department Production requirement by product (hours) Assembling Painting Finishing A B C Departmental capa (Total hours) 30,000 38,000 28,000 18) What is the maximum profit if the capacity of the painting department changes to 40,000 hours? 19) What is the maximum profit if the profit margin on A changes to $7.00? 20) What is the constraint for the finishing department? 2
3 The initial tableau of a linear programming problem is given. Use the simplex method to solve the 21) x1 x2 x3 s1 s2 s3 z Use the simplex method to solve the linear programming 22) Maximize z = 2x1 + 5x2 + 3x3 subject to: 2x1 + x2 + 3x3 9 4x1 + 3x2 + 5x3 12 with, x3 0 23) Maximize z = x1 + 3x2 + x3 + 2x4 subject to: 2x1 + x2 + 5x3 + 6x4 25 5x1 + 3x2 + 4x3 + x4 60 with, x3 0, x4 0 24) Maximize z = x1 + 2x2 + 4x3 + 6x4 subject to: x1 + 2x2 + 3x3 + x x1 + x2 + 2x3 + x4 75 with, x3 0, x4 0 A toy making company has at least 300 squares of felt, 700 oz of stuffing, and 230 ft of trim to make dogs and dinosaurs. A dog uses 1 square of felt, 4 oz of stuffing, and 1 ft of trim. A dinosaur uses 2 squares of felt, 3 oz of stuffing, and 1 ft of trim. 25) It costs the company $1.65 to make each dog and $1.52 for each dinosaur. What is the company's minimum cost? 26) It costs the company $1.72 to make each dog and $1.88 for each dinosaur. The company wants to minimize its costs. What are the coefficients of the objective function? 27) It costs the company $1.62 to make each dog and $1.83 for each dinosaur. The company wants to minimize its costs. What are the coefficients of the constraint inequality for trim? Each day Larry needs at least 10 units of vitamin A, 12 units of vitamin B, and 20 units of vitamin C. Pill #1 contains 4 units of A and 3 of B. Pill #2 contains 1 unit of A, 2 of B, and 4 of C. Pill #3 contains 10 units of A, 1 of B, and 5 of C. 28) Pill #1 costs 10 cents, pill #2 costs 7 cents, and pill #3 costs 3 cents. Larry wants to minimize cost. What is the constraint inequality for vitamin A? 29) Pill #1 costs 9 cents, pill #2 costs 9 cents, and pill #3 costs 1 cent. How many of each pill must Larry take to minimize his cost? State the dual Use y1, y2, y3 and y4 as the variables. Given: y1 0, y2 0, y3 0, and y ) Maximize z = 5x1 + 7x2 subject to: 9x1 + 3x2 190 x1 + x2 18 2x1 + 6x ) Minimize w = 2x1 + 3x2 + x3 subject to: x1 + 3x2 + 2x3 31 2x1 + 4x2 + 3x3 67, x3 0 32) Minimize w = 6x1 + 2x2 + 3x3 + 2x4 subject to: 4x1 + 5x2 + 4x3 + 3x4 45 4x1 + 6x2 + 5x3 + 11x4 55, x3 0, x4 0 33) Maximize z = x1 + 2x2 + 3x3 subject to: 6x1 + 3x2 + x3 16 4x1 + 7x2 + 3x3 21, x3 0 34) Minimize w = 6x1 + 3x2 subject to: 3x1 + 2x2 28 2x1 + 5x2 48 3
4 35) Maximize z = 3x1 + 2x2 subject to: x1 + x2 28 2x1 + x2 22 Use the simplex method to solve the linear programming 36) Minimize w = y1 + 4y2 subject to: 4y1 + 3y2 75 3y1 + 5y2 93 y1 0, y2 0 37) Minimize w = 5y1 + 3y2 subject to: 2y1 + 3y2 9 2y1 + y2 11 y1 0, y2 0 4
5 Answer Key Testname: 1324-SIMP-PT 1) Maximum of 60; minimum of ) Maximum of 100 when x = 8 and y = 3 3) 0 VIP and 24 SST 4) $53,893 5) 14 P1 planes and 7 P2 planes 6) x2 = 2, s2 = 4, s3 = 2, z = 12; x1, x3, s1 = 0 7) x3 = 5, x2 = -7, z = -10; x1, s1, s2 = 0 8) x3 = 5, s2 = 1, s3 = -27, z = 15; x1, x2, s1 = 0 9) x3 = 14, s2 = -6, s3 = 4, z = 42; x1, x2, s1 = 0 10) x1 x2 s1 s2 z ) x1 x2 s1 s2 z ) x1 x2 s1 s2 z ) x1 = 4, s1 = 3, z = 2; x2, x3, s2 = 0 14) s1 = 9, s3 = 16, x2 = 20, z = 21; x1, s2 = 0 15) s2 = 16, s1 = 18, x1 = 17, z = 10; x2, s3 = 0 16) s2 = 10, x2 = 8, z = 16; x1, x3, s1 = 0 17) x1, x2, s1 = 0, x3 = 21, s2 = 14, z = 20 18) $225,000 19) $225,000 20) 2A + 3B + C 28,000 21) Maximum at 15 for x2 = 3, s1 = 2, s3 = 8 22) Maximum is 20 when x1 = 0, x2 = 4, x3 = 0 23) Maximum is 60 when x1 = 0, x2 = 20, x3 = 0, x4 = 0 24) Maximum is 450 when x1 = 0, x2 = 0, x3 = 0, x4 = 75 25) $317 26) 1.72, ) 1, 1 28) 4P1 + P2 + 10P ) P1 = 0, P2 = 0, P3 = 12 30) Minimize w = 190y1 + 18y2 + 85y3 subject to: 9y1 + y2 + 2y3 5 3y1 + y2 + 6y3 7 31) Maximize z = 31y1 + 67y2 subject to: y1 + 2y2 2 3y1 + 4y2 3 2y1 + 3y2 1 32) Maximize z = 45y1 + 55y2 subject to: 4y1 + 4y2 6 5y1 + 6y2 2 4y1 + 5y2 3 3y1 + 11y2 2 33) Minimize w = 16y1 + 21y2 subject to: 6y1 + 4y2 1 3y1 + 7y2 2 y1 + 3y2 3 34) Maximize z = 28y1 + 48y2 subject to: 3y1 + 2y2 6 2y1 + 5y2 3 35) Minimize w = 28y1 + 22y2 subject to: y1 + 2y2 3 y1 + y2 2 36) 31 when y1 = 31 and y2 = 0 37) 27.5 when y1 = 5.5 and y2 = 0 5
MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Stud Guide for Test II Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Graph the linear inequalit. 1) 3 + -6 1) - - - - A) B) - - - - - - - -
More informationExam 2 Review Math1324. Solve the system of two equations in two variables. 1) 8x + 7y = 36 3x - 4y = -13 A) (1, 5) B) (0, 5) C) No solution D) (1, 4)
Eam Review Math3 Solve the sstem of two equations in two variables. ) + 7 = 3 3 - = -3 (, 5) B) (0, 5) C) No solution D) (, ) ) 3 + 5 = + 30 = -, B) No solution 3 C) - 5 3 + 3, for an real number D) 3,
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 informationFinite Mathematics MAT 141: Chapter 4 Notes
Finite Mathematics MAT 141: Chapter 4 Notes The Simplex Method David J. Gisch Slack Variables and the Pivot Simplex Method and Slack Variables We saw in the last chapter that we can use linear programming
More informationSHORT ANSWER. Write the word or phrase that best completes each statement or answers the question.
Math 132 Eam 2 Review (.1 -.5, 7.1-7.5) SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question. Determine whether the given ordered set of numbers is a solution
More informationMATH M118 Practice Test Chapter 7
MATH M118 Practice Test Chapter 7 Problems #1-10: Identify the best answer from the given choices. Place the letter on the answer line. 1) Select the correct graph of x 5 C. A. D. B. E. Answer to #1 2)
More information1. Introduce slack variables for each inequaility to make them equations and rewrite the objective function in the form ax by cz... + P = 0.
3.4 Simplex Method If a linear programming problem has more than 2 variables, solving graphically is not the way to go. Instead, we ll use a more methodical, numeric process called the Simplex Method.
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 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 informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Math 4 review exam MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Convert the constraints into linear equations by using slack variables. ) Maximize
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 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 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 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 informationMATH 210 EXAM 3 FORM A November 24, 2014
MATH 210 EXAM 3 FORM A November 24, 2014 Name (printed) Name (signature) ZID No. INSTRUCTIONS: (1) Use a No. 2 pencil. (2) Work on this test. No scratch paper is allowed. (3) Write your name and ZID number
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 informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Math324 - Test Review 2 - Fall 206 MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Determine the vertex of the parabola. ) f(x) = x 2-0x + 33 ) (0,
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 informationLinear Programming: Sensitivity Analysis
Linear Programming: Sensitivity Analysis Riset Operasi 1 3-1 Chapter Topic Sensitivity Analysis 3-2 Beaver Creek Pottery Example Sensitivity Analysis (1 of 4) Sensitivity analysis determines the effect
More informationMATH 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 informationPractice Final Exam Answers
Practice Final Exam Answers 1. AutoTime, a manufacturer of electronic digital timers, has a monthly fixed cost of $48,000 and a production cost $8 per timer. The timers sell for $14 apiece. (a) (3 pts)
More informationSection 4.1 Solving Systems of Linear Inequalities
Section 4.1 Solving Systems of Linear Inequalities Question 1 How do you graph a linear inequality? Question 2 How do you graph a system of linear inequalities? Question 1 How do you graph a linear inequality?
More informationMath Finite Mathematics Instructor - Dalip Sondhi Exam 1
Math - Finite Mathematics Instructor - Dalip Sondhi Eam Name Date PLEASE SUBMIT THIS TEST, SUMMARIZE YOUR ANSWERS ON IT, STAPLE YOUR SUPPORTING WORK TO IT & SCANTRON INSERTED BEHIND PAGE, UNSTAPLED. GRADING
More informationNon-Standard Constraints. Setting up Phase 1 Phase 2
Non-Standard Constraints Setting up Phase 1 Phase 2 Maximizing with Mixed Constraints Some maximization problems contain mixed constraints, like this: maximize 3x 1 + 2x 2 subject to 2x 1 + x 2 50 (standard)
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 informationUNIT-4 Chapter6 Linear Programming
UNIT-4 Chapter6 Linear Programming Linear Programming 6.1 Introduction Operations Research is a scientific approach to problem solving for executive management. It came into existence in England during
More informationc) Place the Coefficients from all Equations into a Simplex Tableau, labeled above with variables indicating their respective columns
BUILDING A SIMPLEX TABLEAU AND PROPER PIVOT SELECTION Maximize : 15x + 25y + 18 z s. t. 2x+ 3y+ 4z 60 4x+ 4y+ 2z 100 8x+ 5y 80 x 0, y 0, z 0 a) Build Equations out of each of the constraints above by introducing
More informationAM 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 informationBrief summary of linear programming and duality: Consider the linear program in standard form. (P ) min z = cx. x 0. (D) max yb. z = c B x B + c N x N
Brief summary of linear programming and duality: Consider the linear program in standard form (P ) min z = cx s.t. Ax = b x 0 where A R m n, c R 1 n, x R n 1, b R m 1,and its dual (D) max yb s.t. ya c.
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 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 informationProfessor Alan H. Stein October 31, 2007
Mathematics 05 Professor Alan H. Stein October 3, 2007 SOLUTIONS. For most maximum problems, the contraints are in the form l(x) k, where l(x) is a linear polynomial and k is a positive constant. Explain
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 information56:270 Final Exam - May
@ @ 56:270 Linear Programming @ @ Final Exam - May 4, 1989 @ @ @ @ @ @ @ @ @ @ @ @ @ @ Select any 7 of the 9 problems below: (1.) ANALYSIS OF MPSX OUTPUT: Please refer to the attached materials on the
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 informationMATH 1324 (Finite Mathematics or Business Math I) Lecture Notes Author / Copyright: Kevin Pinegar
MATH 34 Module 3 Notes: SYSTEMS OF INEQUALITIES & LINEAR PROGRAMMING 3.3 SOLVING LINEAR PROGRAMMING PROBLEMS GEOMETRICALLY WE WILL BEGIN THIS SECTION WITH AN APPLICATION The Southern States Ring Company
More informationUnderstanding the Simplex algorithm. Standard Optimization Problems.
Understanding the Simplex algorithm. Ma 162 Spring 2011 Ma 162 Spring 2011 February 28, 2011 Standard Optimization Problems. A standard maximization problem can be conveniently described in matrix form
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 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 informationChapter 4 Test Review. 1. Sketch the graph of the equation 3x + 5y = Sketch the graph of the equation 4x + 3y = 24.
Name Chapter 4 Test Review Per. 1. Sketch the graph of the equation 3x + 5y = 30. 2. Sketch the graph of the equation 4x + 3y = 24. 3. Sketch the graph of the inequality 2x + 4y 12. 4. Sketch the graph
More information(b) For the change in c 1, use the row corresponding to x 1. The new Row 0 is therefore: 5 + 6
Chapter Review Solutions. Write the LP in normal form, and the optimal tableau is given in the text (to the right): x x x rhs y y 8 y 5 x x x s s s rhs / 5/ 7/ 9 / / 5/ / / / (a) For the dual, just go
More informationReview Questions, Final Exam
Review Questions, Final Exam A few general questions 1. What does the Representation Theorem say (in linear programming)? 2. What is the Fundamental Theorem of Linear Programming? 3. What is the main idea
More informationFinite Math Section 4_1 Solutions and Hints
Finite Math Section 4_1 Solutions and Hints by Brent M. Dingle for the book: Finite Mathematics, 7 th Edition by S. T. Tan. DO NOT PRINT THIS OUT AND TURN IT IN!!!!!!!! This is designed to assist you in
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 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 informationMath 354 Summer 2004 Solutions to review problems for Midterm #1
Solutions to review problems for Midterm #1 First: Midterm #1 covers Chapter 1 and 2. In particular, this means that it does not explicitly cover linear algebra. Also, I promise there will not be any proofs.
More information4.4 The Simplex Method and the Standard Minimization Problem
. The Simplex Method and the Standard Minimization Problem Question : What is a standard minimization problem? Question : How is the standard minimization problem related to the dual standard maximization
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 information3.1 Linear Programming Problems
3.1 Linear Programming Problems The idea of linear programming problems is that we are given something that we want to optimize, i.e. maximize or minimize, subject to some constraints. Linear programming
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 informationMath 210 Finite Mathematics Chapter 4.2 Linear Programming Problems Minimization - The Dual Problem
Math 2 Finite Mathematics Chapter 4.2 Linear Programming Problems Minimization - The Dual Problem Richard Blecksmith Dept. of Mathematical Sciences Northern Illinois University Math 2 Website: http://math.niu.edu/courses/math2.
More informationA = Chapter 6. Linear Programming: The Simplex Method. + 21x 3 x x 2. C = 16x 1. + x x x 1. + x 3. 16,x 2.
Chapter 6 Linear rogramming: The Simple Method Section The Dual roblem: Minimization with roblem Constraints of the Form Learning Objectives for Section 6. Dual roblem: Minimization with roblem Constraints
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 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 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 informationOptimization 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 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 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 informationMath Models of OR: Sensitivity Analysis
Math Models of OR: Sensitivity Analysis John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 8 USA October 8 Mitchell Sensitivity Analysis / 9 Optimal tableau and pivot matrix Outline Optimal
More informationMAT016: 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 informationLinear Programming Duality P&S Chapter 3 Last Revised Nov 1, 2004
Linear Programming Duality P&S Chapter 3 Last Revised Nov 1, 2004 1 In this section we lean about duality, which is another way to approach linear programming. In particular, we will see: How to define
More informationTheoretical questions and problems to practice Advanced Mathematics and Statistics (MSc course)
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
More information1. (7pts) Find the points of intersection, if any, of the following planes. 3x + 9y + 6z = 3 2x 6y 4z = 2 x + 3y + 2z = 1
Math 125 Exam 1 Version 1 February 20, 2006 1. (a) (7pts) Find the points of intersection, if any, of the following planes. Solution: augmented R 1 R 3 3x + 9y + 6z = 3 2x 6y 4z = 2 x + 3y + 2z = 1 3 9
More informationM340(921) Solutions Problem Set 6 (c) 2013, Philip D Loewen. g = 35y y y 3.
M340(92) Solutions Problem Set 6 (c) 203, Philip D Loewen. (a) If each pig is fed y kilograms of corn, y 2 kilos of tankage, and y 3 kilos of alfalfa, the cost per pig is g = 35y + 30y 2 + 25y 3. The nutritional
More informationChapter 1: Linear Programming
Chapter 1: Linear Programming Math 368 c Copyright 2013 R Clark Robinson May 22, 2013 Chapter 1: Linear Programming 1 Max and Min For f : D R n R, f (D) = {f (x) : x D } is set of attainable values of
More information4. Duality and Sensitivity
4. Duality and Sensitivity For every instance of an LP, there is an associated LP known as the dual problem. The original problem is known as the primal problem. There are two de nitions of the dual pair
More informationmin 4x 1 5x 2 + 3x 3 s.t. x 1 + 2x 2 + x 3 = 10 x 1 x 2 6 x 1 + 3x 2 + x 3 14
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. If necessary,
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 information1 Answer Key for exam2162sp07 vl
Ma 162 College Algebra Second Exam vl 9 1 Answer Key for exam2162sp07 vl 1. [ x =, 2, y =, 3, z =, 1, w =, 3, Mary, [63.5, 2, 1]] 2. ABC: 1 L1 L2 1CDE:L1 11 L2 3. P =1.8 x +1.8 y +1.5 z 0 x,0 y 9 x +10y
More informationThe use of shadow price is an example of sensitivity analysis. Duality theory can be applied to do other kind of sensitivity analysis:
Sensitivity analysis The use of shadow price is an example of sensitivity analysis. Duality theory can be applied to do other kind of sensitivity analysis: Changing the coefficient of a nonbasic variable
More informationMath Homework 3: solutions. 1. Consider the region defined by the following constraints: x 1 + x 2 2 x 1 + 2x 2 6
Math 7502 Homework 3: solutions 1. Consider the region defined by the following constraints: x 1 + x 2 2 x 1 + 2x 2 6 x 1, x 2 0. (i) Maximize 4x 1 + x 2 subject to the constraints above. (ii) Minimize
More information(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 informationLinear Programming: Chapter 5 Duality
Linear Programming: Chapter 5 Duality Robert J. Vanderbei September 30, 2010 Slides last edited on October 5, 2010 Operations Research and Financial Engineering Princeton University Princeton, NJ 08544
More informationOptimum Solution of Linear Programming Problem by Simplex Method
Optimum Solution of Linear Programming Problem by Simplex Method U S Hegde 1, S Uma 2, Aravind P N 3 1 Associate Professor & HOD, Department of Mathematics, Sir M V I T, Bangalore, India 2 Associate Professor,
More information4.7 Sensitivity analysis in Linear Programming
4.7 Sensitivity analysis in Linear Programming Evaluate the sensitivity of an optimal solution with respect to variations in the data (model parameters). Example: Production planning max n j n a j p j
More informationPrelude to the Simplex Algorithm. The Algebraic Approach The search for extreme point solutions.
Prelude to the Simplex Algorithm The Algebraic Approach The search for extreme point solutions. 1 Linear Programming-1 x 2 12 8 (4,8) Max z = 6x 1 + 4x 2 Subj. to: x 1 + x 2
More informationMATH 373 Section A1. Final Exam. Dr. J. Bowman 17 December :00 17:00
MATH 373 Section A1 Final Exam Dr. J. Bowman 17 December 2018 14:00 17:00 Name (Last, First): Student ID: Email: @ualberta.ca Scrap paper is supplied. No notes or books are permitted. All electronic equipment,
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 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 informationSpring 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 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 informationMath 125 Fall 2011 Exam 2 - Solutions
Math 5 Fall 0 Exam - Solutions. (0 points) Suppose an economy consists of three industries: natural gas, oil, and electricity. For each $ of natural gas produced, $0.0 of natural gas is consumed, $0.0
More informationLecture 11 Linear programming : The Revised Simplex Method
Lecture 11 Linear programming : The Revised Simplex Method 11.1 The Revised Simplex Method While solving linear programming problem on a digital computer by regular simplex method, it requires storing
More informationM= 4 s. 112j 127J. 20f25 Determine whether the given ordered set ofnumbers is a solution ofthe system ofequations.
Striving to provide a online education experience TM Note: You will only be allowed to submit this test one time. Your score will be averaged in your overall course grade and you will not be able to submit
More informationThe 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 informationThe Big M Method. Modify the LP
The Big M Method Modify the LP 1. If any functional constraints have negative constants on the right side, multiply both sides by 1 to obtain a constraint with a positive constant. Big M Simplex: 1 The
More informationReview Solutions, Exam 2, Operations Research
Review Solutions, Exam 2, Operations Research 1. Prove the weak duality theorem: For any x feasible for the primal and y feasible for the dual, then... HINT: Consider the quantity y T Ax. SOLUTION: To
More informationSystems 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 informationSlide 1 Math 1520, Lecture 10
Slide 1 Math 1520, Lecture 10 In this lecture, we study the simplex method which is a powerful method for solving maximization/minimization problems developed in the late 1940 s. It has been implemented
More informationEcon 172A, Fall 2007: Midterm A
Econ 172A, Fall 2007: Midterm A Instructions The examination has 5 questions. Answer them all. You must justify your answers to Questions 1, 2, and 5. (if you are not certain what constitutes adequate
More informationDEPARTMENT OF STATISTICS AND OPERATIONS RESEARCH OPERATIONS RESEARCH DETERMINISTIC QUALIFYING EXAMINATION. Part I: Short Questions
DEPARTMENT OF STATISTICS AND OPERATIONS RESEARCH OPERATIONS RESEARCH DETERMINISTIC QUALIFYING EXAMINATION Part I: Short Questions August 12, 2008 9:00 am - 12 pm General Instructions This examination is
More information21. Solve the LP given in Exercise 19 using the big-m method discussed in Exercise 20.
Extra Problems for Chapter 3. Linear Programming Methods 20. (Big-M Method) An alternative to the two-phase method of finding an initial basic feasible solution by minimizing the sum of the artificial
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 informationMathematics (JAN12MD0201) General Certificate of Education Advanced Level Examination January Unit Decision TOTAL.
Centre Number Candidate Number For Examiner s Use Surname Other Names Candidate Signature Examiner s Initials Mathematics Unit Decision 2 Wednesday 25 January 2012 General Certificate of Education Advanced
More informationThe 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 informationThe Simplex Method. Lecture 5 Standard and Canonical Forms and Setting up the Tableau. Lecture 5 Slide 1. FOMGT 353 Introduction to Management Science
The Simplex Method Lecture 5 Standard and Canonical Forms and Setting up the Tableau Lecture 5 Slide 1 The Simplex Method Formulate Constrained Maximization or Minimization Problem Convert to Standard
More information5.3 Linear Programming in Two Dimensions: A Geometric Approach
: A Geometric Approach A Linear Programming Problem Definition (Linear Programming Problem) A linear programming problem is one that is concerned with finding a set of values of decision variables x 1,
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 5 Linear programming duality and sensitivity analysis
MVE165/MMG631 Linear and integer optimization with applications Lecture 5 Linear programming duality and sensitivity analysis Ann-Brith Strömberg 2017 03 29 Lecture 4 Linear and integer optimization with
More informationMetode Kuantitatif Bisnis. Week 4 Linear Programming Simplex Method - Minimize
Metode Kuantitatif Bisnis Week 4 Linear Programming Simplex Method - Minimize Outlines Solve Linear Programming Model Using Graphic Solution Solve Linear Programming Model Using Simplex Method (Maximize)
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 information