OR: Exercices Linear Programming
|
|
- Martha Greer
- 6 years ago
- Views:
Transcription
1 OR: Exercices Linear Programming N. Brauner Université Grenoble Alpes Exercice 1 : Wine Production (G. Finke) An American distillery produces 3 kinds of genuine German wines: Heidelberg sweet, Heidelberg regular and Deutschland extra dry. The basic products, the workforce and the profit per gallon are given in the following table. grapes - type A grapes - type B sugar workforce profit (bushel) (bushel) (kg) (hours) (=C) Heidelberg sweet Heidelberg regular Deutschl. extra dry The distillery owns 150 bushel of grapes of type A, 150 bushel of grapes of type B, 80 kg of sugar and can provide 225 hours of work. What quantity of each wine should be produced to maximize profit? Question 1 Formulate this problem as a linear program. Exercice 2 : Advertising A company has an advertising budget of 4800 monetary units (mu) for launching a new product. Its advertising campaign will consist of television commercials and newspaper advertisements. Each minute of television will reach new viewers and each page in the newspaper will be read by new readers. One minute of television costs 800mu and a page in the newspaper costs 600mu. The direction wants to broadcast at least 3 minutes of commercials and print at least one page in a newspaper. Its objective is to maximize the target audience (viewers and readers). Question 1 Model this problem as a linear program Question 2 Represent the feasible region graphically. Question 3 What is the optimal solution if the budget is increased from 4800 to 6000? Question 4 What is the optimal decsion if there is no constraint on the television time? Exercice 3 : Air company (Hillier and Lieberman, Introduction to Operations Research) UNION AIRWAYS is adding more flights to and from its hub airport, and so it needs to hire additional customer service agents. However, it is not clear just how many more should be hired. Management recognizes the need for cost control while also consistently providing a satisfactory level of service to customers. Therefore, an OR team is studying how to schedule the agents to provide satisfactory service with the smallest personnel cost. Based on the new schedule of flights, an analysis has been made of the minimum number 1
2 of customer service agents that need to be on duty at different times of the day to provide a satisfactory level of service. The rightmost column of Table 1 shows the number of agents needed for the time periods given in the first column. The other entries in this table reflect one of the provisions in the company s current contract with the union that represents the customer service agents. The provision is that each agent works an 8-hour shift 5 days per week, and the authorized shifts are Time Periods Covered Minimum number Time period shift 1 shift 2 shift 3 shift 4 shift 5 of agents needed 6:00 a.m. - 8:00 a.m. x 48 8:00 a.m.-10:00 a.m. x x 79 10:00 a.m.- noon x x 65 noon -2:00 p.m. x x x 87 2:00 p.m.-4:00 p.m. x x 64 4:00 p.m.-6:00 p.m. x x 73 6:00 p.m.-8:00 p.m. x x 82 8:00 p.m.-10:00 p.m. x 43 10:00 p.m.- midnight x x 52 midnight-6:00 a.m. x 15 Daily cost per agent 170 =C 160 =C 175 =C 180 =C 195 =C Table 1: Data for the Union Airways personnel scheduling problem Shift 1: 6:00 a.m. to 2:00 p.m. Shift 2: 8:00 a.m. to 4:00 p.m. Shift 3: Noon to 8:00 p.m. Shift 4: 4:00 p.m. to midnight Shift 5: 10:00 p.m. to 6:00 a.m. Checkmarks in the main body of Table 1 show the hours covered by the respective shifts. Because some shifts are less desirable than others, the wages specified in the contract differ by shift. For each shift, the daily compensation (including benefits) for each agent is shown in the bottom row. The problem is to determine how many agents should be assigned to the respective shifts each day to minimize the total personnel cost for agents, based on this bottom row, while meeting (or surpassing) the service requirements given in the rightmost column. Question 1 Model this problem as a linear program. Find the redundant constraints. Exercice 4 : Olive oil production (J.-F. Hêche) A company produces 3 different qualities of olive oil. The maximal quantities that can be sold each month, together with the retail prices are given in the following table: Product maximal sale retail price (liters) (=C/liter) Oil A Oil B Oil C The company pays 1000=C per ton of olives. Each ton of olives provides either 300 liters 2
3 of Oil A or 200 liters of Oil B (the processing costs are not modeled). Each liter of Oil A can be refined to produce 6 dl of oil B and 3 dl of oil C. The cost of such a refinement is 0.5=C per liter. Likewise, each liter of oil B can be refined to obtain 8 dl of oil C. The cost of this refinement is 0.3=C per liter. Question 1 Write a linear program that helps the company establish a monthly production plan that maximizes its profit. Specify clearly the decision variables, the objective function and the constraints. Exercice 5 : Bergamot (J.-F. Hêche) A distillery produces bergamot essence for the perfume manufacturers in the region. The production of one liter of bergamot essence generates 0.4 liters of liquid waste pollutant. The distillery can either have the waste treated by a treatment plant before dumping it into the river, or dump it directly in the river. The wastewater treatment plant processes at most 8000 liters of waste per week. The treatment process is not perfect: 20% of the waste processed by the station and then released in the river is still pollutant. For each liter of waste transiting through the waste treatment plant, 5=C are charged to the distillery. The state charges a tax of 15=C per liter of polluting waste dumped into the river regardless of whether it has passed through the wastewater treatment plant or not. The law limits the number of liters of pollutant waste that can be dumped into the river every week to The retail price of one liter of bergamot essence is 110=C and the raw materials cost 20=C per liter. Question 1 The distillery wants to maximize its weekly profit. Assuming that the distillery always succeeds in selling its whole production, model this problem as a linear program. Exercice 6 : Linear and canonical forms (J.-F. Hêche) Question 1 Formulate the following linear programs in canonical and standard forms. 1. Maximize z = 2x 1 x 2 1 s.t. 3 x 1 + x 2 = 2 2x 1 + 5x 2 7 x 1 + x 2 4 x 1 0 x 2 R 2. Minimize z = 3x 1 + x 3 s.t. x x 2 3x 3 2 4x 2 + x 3 = 5 x 1, x 3 0 x Minimize z = 2x 1 3x 2 s.t. x 2 3 2x 1 x 2 = 2 x 1 + 3x 2 1 x 1 0 3
4 Exercice 7 : Linearization (J.-F. Hêche) Question 1 Formulate the following linear programs in canonical form. 1. Minimize z = max (2x 1 3x 2, x 1 2x 2 + 4x 3 ) s.t. 2x 1 + x 3 = 12 x 1 + 2x 2 5 x 1, x 2, x Minimize z = x 1 2x 3 + x 1 + 3x 2 + x 3 s.t. x 1 4x 2 + x 3 = 5 5x 2 3x 3 6 x 1, x 2, x Minimize z = x max (2x 2 4, 3x 1 4x 3 ) s.t. x 1 + x 2 1 max ( x 1 + x 2 + x 3, x 1 x 2 2x 3 ) 7 x 1, x 2, x 3 0 Exercice 8 : Graphical solution (J.-F. Hêche) Consider the following linear program: Question 1 Draw the feasible region R. Question 2 Solve this problem graphically. max z = 3x + 2y s.c. x y 2 2x + y 8 x + y 5 x 0 y 0 Exercice 9 : Bases (J.-F. Hêche) Consider the system of linear equations Ax = b with A = ( ) and b = Question 1 Describe all the bases of matrix A. For each basis, indicate the associated basic solution and whether it is feasible. Question 2 Represent graphically the projections of the basic solutions and the projections of the two equations of the system in the x 1 and x 2 plane. ( 1 4 ) Exercice 10 : Bases (J.-F. Hêche) Consider the canonical linear program 4
5 Question 1 Draw its feasible domain. max z = 2x 1 + 5x 2 s.t. 2x 1 4x 2 1 3x 1 + 4x 2 24 x 2 4 x 1 5 x 1, x 2 0 Question 2 Identify on your graphic the point corresponding to the basic solution for each of the following bases. B1 = {x 3, x 4, x 5, x 6 } B2 = {x 1, x 2, x 3, x 5 } B3 = {x 2, x 3, x 5, x 6 } B4 = {x 1, x 2, x 5, x 6 } Remark. The variables x 3, x 4, x 5 and x 6 correspond to the slack variables introduced when passing to the standard form. Question 3 Using your picture, indicate the number of bases of the L.P., the number of feasible bases and the number of extreme points of its feasible domain. Question 4 Give all the optimal bases of the L.P. together with the optimal solutions and their values. Exercice 11 : Simplex (J.-F. Hêche) Question 1 Solve the following linear program using the simplex algorithm: max z = 3x 1 + 2x 2 s.c. 2x 1 + x 2 7 x 1 3 x 1 + x 2 5 x 1, x 2 0 Specify at each iteration the basic variables, the non-basic variables and the corresponding extreme point. Exercice 12 : Simplex The simplex methods ends with the following equations: z = 10 x 1 2x 6 x 4 = 3 2x 1 x 5 + x 6 x 2 = 9 x 1 2x 5 2x 6 x 3 = 7 + x 1 2x 5 x 6 Question 1 Describe the corresponding optimal solution. Question 2 Find a second optimal basic solution. Question 3 Describe another optimal solution which is not a basic solution. 5
6 Exercice 13 : The right form?(from Olivier Briant) For each of the following linear programs, indicate whether it is in the form of a step of the simplex algorithm as seen in the course and if possible, describe the associated basic solution. Is this basic solution feasible? Is it optimal? If the basic solution is feasible but not optimal, perform one simplex iteration. a) z = 12 + x 1 + 2x 4 x 1 = 3 + x 2 + 2x 3 + 2x 4 x 2 = 7 + 3x 3 + 5x 4 b) z = 3 + 2x 1 + x 4 x 3 = 11 5x 1 + 3x 2 x 4 x 5 = 2 + 3x 1 + x 2 c) z = 10 5x 1 + 2x 2 x 3 = 1 + x 1 + 7x 2 x 4 = 2 x 1 + 3x 2 d) z = 17 x 1 + 3x 2 x 3 = 6 + x 1 + 3x 2 x 4 = 2 x 1 7x 2 x 5 = 4 + 8x 1 + 2x 2 e) z = 12 2x 1 3x 5 x 4 = 0 + x 1 x 5 = 1 2x 1 x 2 x 3 = 4 x 1 + 3x 2 f) z = 3 + 3x 1 x 3 x 2 = 1 + x 1 2x 3 x 4 = 4 + 2x 1 5x 3 g) z = x 2 + x 3 x 4 x 1 = 1 2x 2 3x 4 x 3 = 4 + 8x 2 2x 4 6
9.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 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 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 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 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 informationMA Lesson 29 Notes
MA 15910 Lesson 9 Notes Absolute Maximums or Absolute Minimums (Absolute Extrema) in a Closed Interval: Let f be a continuous function on a closed interval [a, b].. Let c be a number in that interval.
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 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 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 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 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 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 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 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 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 informationLinear programming I João Carlos Lourenço
Decision Support Models Linear programming I João Carlos Lourenço joao.lourenco@ist.utl.pt Academic year 2012/2013 Readings: Hillier, F.S., Lieberman, G.J., 2010. Introduction to Operations Research, 9th
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 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 informationIntroduction to Operations Research. Linear Programming
Introduction to Operations Research Linear Programming Solving Optimization Problems Linear Problems Non-Linear Problems Combinatorial Problems Linear Problems Special form of mathematical programming
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 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 informationIntroduction to Operations Research
Introduction to Operations Research Linear Programming Solving Optimization Problems Linear Problems Non-Linear Problems Combinatorial Problems Linear Problems Special form of mathematical programming
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 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 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 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 informationLINEAR PROGRAMMING. Lessons 28. Lesson. Overview. Important Terminology. Making inequalities (constraints)
LINEAR PROGRAMMING Learning Outcomes and Assessment Standards Learning Outcome 2: Functions and algebra Assessment Standard 12.2.8 Solve linear programming problems by optimising a function in two variables,
More information1.4 Linear Functions of Several Variables
.4 Linear Functions of Several Variables Question : What is a linear function of several independent variables? Question : What do the coefficients of the variables tell us? Question : How do you find
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 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 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 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 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 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 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 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 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 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 informationMATH 1010 Assignment 2 Solutions 14R-T1
MATH 1010 Assignment 2 Solutions 14R-T1 Attempt all questions and show all your work. Due A01: Thu Oct 17, A02: Fri Oct 18. Assignments must be handed in during class time. Any assignment handed in after
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 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 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 informationRO: Exercices Mixed Integer Programming
RO: Exercices Mixed Integer Programming N. Brauner Université Grenoble Alpes Exercice 1 : Knapsack A hiker wants to fill up his knapsack of capacity W = 6 maximizing the utility of the objects he takes.
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 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 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 informationThe Simplex Algorithm and Goal Programming
The Simplex Algorithm and Goal Programming In Chapter 3, we saw how to solve two-variable linear programming problems graphically. Unfortunately, most real-life LPs have many variables, so a method is
More 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 informationLINEAR EQUATIONS Modeling Linear Equations Common Core Standards
E Linear Equations, Lesson 1, Modeling Linear Functions (r. 2018) LINEAR EQUATIONS Modeling Linear Equations Common Core Standards F-BF.A.1 Write a function that describes a relationship between two quantities.
More informationOperations Research. Duality in linear programming.
Operations Research Duality in linear programming Duality in linear programming As we have seen in past lessons, linear programming are either maximization or minimization type, containing m conditions
More informationLinear Programming. Our market gardener example had the form: min x. subject to: where: [ acres cabbages acres tomatoes T
Our market gardener eample had the form: min - 900 1500 [ ] suject to: Ñ Ò Ó 1.5 2 â 20 60 á ã Ñ Ò Ó 3 â 60 á ã where: [ acres caages acres tomatoes T ]. We need a more systematic approach to solving these
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 informationOperations Research. Jihyun Rachel Lee Honors Thesis Spring Acknowledgment: Kazem Mahdavi
Operations Research Jihyun Rachel Lee Jlee12@ithaca.edu Honors Thesis Spring 2014 Acknowledgment: Kazem Mahdavi Kazemmahdavi@gmail.com 0 Table of Contents 1. Introduction 2. Linear Programming 2.1 Standard
More informationSheerSense. Independent Distributor. Compensation Plan
SheerSense Independent Compensation Plan Two Ways to Earn Income 1. Sales Income & 2. Commission Income It All Begins With A Demonstration & A Choice to Become a Customer or a Guest Guest Guests May Choose
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 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 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 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 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 informationTheory of Linear Programming
SCHOOL OF BUSINESS, ECONOMICS AND MANAGEMENT BF360 Operations Research Unit Two Theory of Linear Programming Moses Mwale e-mail: moses.mwale@ictar.ac.zm BF360 Operations Research Contents Unit 2: Theory
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 informationSignature: Name (PRINT CLEARLY) and ID number:
AMS 540 / MBA 540 (Fall, 2008) Estie Arkin Linear Programming - Midterm Do all problems. Write your answers on the exam. You are permitted to use the text, your notes and any material handed out in class.
More informationΩ R n is called the constraint set or feasible set. x 1
1 Chapter 5 Linear Programming (LP) General constrained optimization problem: minimize subject to f(x) x Ω Ω R n is called the constraint set or feasible set. any point x Ω is called a feasible point We
More informationMODELING (Integer Programming Examples)
MODELING (Integer Programming Eamples) IE 400 Principles of Engineering Management Integer Programming: Set 5 Integer Programming: So far, we have considered problems under the following assumptions:
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 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 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 informationChapter 5. Increasing and Decreasing functions Theorem 1: For the interval (a,b) f (x) f(x) Graph of f + Increases Rises - Decreases Falls
Chapter 5 Section 5.1 First Derivative and Graphs Objectives: The student will be able to identify increasing and decreasing functions and local extrema The student will be able to apply the first derivative
More informationMarquette University Executive MBA Program Statistics Review Class Notes Summer 2018
Marquette University Executive MBA Program Statistics Review Class Notes Summer 2018 Chapter One: Data and Statistics Statistics A collection of procedures and principles
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 informationLinear Programming. Xi Chen. Department of Management Science and Engineering International Business School Beijing Foreign Studies University
Linear Programming Xi Chen Department of Management Science and Engineering International Business School Beijing Foreign Studies University Xi Chen (chenxi0109@bfsu.edu.cn) Linear Programming 1 / 148
More informationLinear Programming. Dr. Xiaosong DING
Linear Programming Dr. Xiaosong DING Department of Management Science and Engineering International Business School Beijing Foreign Studies University Dr. DING (xiaosong.ding@hotmail.com) Linear Programming
More 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 informationPractice Paper 1. Section I. Attempt Questions 1 15 (15 marks) Allow about 20 minutes for this section
45 Section I Attempt Questions 5 (5 marks) Allow about 0 minutes for this section Which of the following is the highest pay? A $44. per week B $884.68 per fortnight C $647.50 per month D $75 000 per annum
More informationMATH 4211/6211 Optimization Linear Programming
MATH 4211/6211 Optimization Linear Programming Xiaojing Ye Department of Mathematics & Statistics Georgia State University Xiaojing Ye, Math & Stat, Georgia State University 0 The standard form of a Linear
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 informationSlack Variable. Max Z= 3x 1 + 4x 2 + 5X 3. Subject to: X 1 + X 2 + X x 1 + 4x 2 + X X 1 + X 2 + 4X 3 10 X 1 0, X 2 0, X 3 0
Simplex Method Slack Variable Max Z= 3x 1 + 4x 2 + 5X 3 Subject to: X 1 + X 2 + X 3 20 3x 1 + 4x 2 + X 3 15 2X 1 + X 2 + 4X 3 10 X 1 0, X 2 0, X 3 0 Standard Form Max Z= 3x 1 +4x 2 +5X 3 + 0S 1 + 0S 2
More informationMonday 9 June 2014 Morning
H Monday 9 June 2014 Morning GCSE APPLICATIONS OF MATHEMATICS A381/02 Applications of Mathematics 1 (Higher Tier) * 3 0 5 2 7 0 0 6 9 1 * Candidates answer on the Question Paper. OCR supplied materials:
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 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 informationWelcome to CPSC 4850/ OR Algorithms
Welcome to CPSC 4850/5850 - OR Algorithms 1 Course Outline 2 Operations Research definition 3 Modeling Problems Product mix Transportation 4 Using mathematical programming Course Outline Instructor: Robert
More informationChapter 7: Hypothesis Testing - Solutions
Chapter 7: Hypothesis Testing - Solutions 7.1 Introduction to Hypothesis Testing The problem with applying the techniques learned in Chapter 5 is that typically, the population mean (µ) and standard deviation
More informationMidterm: Wednesday, January 23 rd at 8AM Midterm Review
Name: Algebra 1 CC Period: Midterm: Wednesday, January 23 rd at 8AM Midterm Review Unit 1: Building Blocks of Algebra Number Properties (Distributive, Commutative, Associative, Additive, Multiplicative)
More information56:171 Fall 2002 Operations Research Quizzes with Solutions
56:7 Fall Operations Research Quizzes with Solutions Instructor: D. L. Bricker University of Iowa Dept. of Mechanical & Industrial Engineering Note: In most cases, each quiz is available in several versions!
More informationName: Section Registered In:
Name: Section Registered In: Math 125 Exam 1 Version 1 February 21, 2006 60 points possible 1. (a) (3pts) Define what it means for a linear system to be inconsistent. Solution: A linear system is inconsistent
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 informationFormulating and Solving a Linear Programming Model for Product- Mix Linear Problems with n Products
Formulating and Solving a Linear Programming Model for Product- Mix Linear Problems with n Products Berhe Zewde Aregawi Head, Quality Assurance of College of Natural and Computational Sciences Department
More informationx ax 1 2 bx2 a bx =0 x = a b. Hence, a consumer s willingness-to-pay as a function of liters on sale, 1 2 a 2 2b, if l> a. (1)
Answers to Exam Economics 201b First Half 1. (a) Observe, first, that no consumer ever wishes to consume more than 3/2 liters (i.e., 1.5 liters). To see this, observe that, even if the beverage were free,
More informationChapter 12: Inference about One Population
Chapter 1: Inference about One Population 1.1 Introduction In this chapter, we presented the statistical inference methods used when the problem objective is to describe a single population. Sections 1.
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 informationThe Review has 16 questions. Simplify all answers, include all units when appropriate.
Math 1 Midterm Eam Review with Answers Name Date The Review has 16 questions. Simplify all answers, include all units when appropriate. 1. [Sec. 1.] Solve the following problems. a. A company s profit
More informationFUNCTIONS PRACTICE. If one Jumbo Burger costs 2.15, what is the cost, in pence, of one regular coke?
FUNCTIONS PRACTICE 1. At Jumbo s Burger Bar, Jumbo burgers cost J each and regular cokes cost C each. Two Jumbo burgers and three regular cokes cost 5.95. Write an equation to show this. If one Jumbo Burger
More informationApplications of 2 x 2 Systems of Equations
Systems of equations can be applied to any problem situation which satisfies two criteria: Two unknowns can be identified and assigned variables. Two equations can be formulated using the variables. 1.
More informationIntroduction to Operations Research Economics 172A Winter 2007 Some ground rules for home works and exams:
Introduction to Operations Research Economics 172A Winter 2007 Some ground rules for home works and exams: Write your homework answers on the sheets supplied. If necessary, you can get new sheets on the
More informationChapter 5 Linear Programming (LP)
Chapter 5 Linear Programming (LP) General constrained optimization problem: minimize f(x) subject to x R n is called the constraint set or feasible set. any point x is called a feasible point We consider
More informationLinear programming: introduction and examples
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
More informationARITHMETIC SOLVED QUESTIONS
ARITHMETIC SOLVED QUESTIONS Problem Solving 1) A boy has a few articles, all identical. If he sells them at $8 apiece, he loses $250. However, if he sells them at $9 per piece he gains $125. How many articles
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 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 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 information