EMGT 501 HW #1 Due Day: Sep 13 Chapter 2 - SELF TEST 18

Slides:



Advertisements
Similar presentations
EMGT 501 HW #1 Due Day: Sep 13 Chapter 2 - SELF TEST 18
Advertisements

EMGT 501 HW #1 Solutions Chapter 2 - SELF TEST 18
Lesson 08 Linear Programming
Assignment (6) Simplex Method for solving LP problems with two variables.
Transportation Problem (TP) and Assignment Problem (AP)
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Solving Linear Programming Problems: The Simplex Method
Computational Methods for Management and Economics Carla Gomes Module 6a Introduction to Simplex (Textbook – Hillier and Lieberman)
Water Resources Development and Management Optimization (Linear Programming) CVEN 5393 Feb 18, 2013.
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Chapter 6 Linear Programming: The Simplex Method
The Simplex Method: Standard Maximization Problems
Operation Research Chapter 3 Simplex Method.
EMGT 501 HW #2 Due Day: Sep 27 Chapter 6 - SELF TEST 21
Q 2-31 Min 3A + 4B s.t. 1A + 3B ≧ 6 B = - 1/3A + 2 1A + 1B ≧ 4
Linear Programming (LP)
The Simplex Method.
1 1 Slide LINEAR PROGRAMMING: THE GRAPHICAL METHOD n Linear Programming Problem n Properties of LPs n LP Solutions n Graphical Solution n Introduction.
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
Kerimcan OzcanMNGT 379 Operations Research1 LP: Sensitivity Analysis and Interpretation of Solution Chapter 3.
LINEAR PROGRAMMING SIMPLEX METHOD.
Chapter 19 Linear Programming McGraw-Hill/Irwin
Linear Programming - Standard Form
Topic III The Simplex Method Setting up the Method Tabular Form Chapter(s): 4.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming: The Simplex Method Chapter 5.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Public Policy Modeling Simplex Method Tuesday, October 13, 2015 Hun Myoung Park, Ph.D. Public Management & Policy Analysis Program Graduate School of International.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
1 Chapter 7 Linear Programming. 2 Linear Programming (LP) Problems Both objective function and constraints are linear. Solutions are highly structured.
Chapter 6 Supplement Linear Programming.
Transparency Masters to accompany Heizer/Render – Principles of Operations Management, 5e, and Operations Management, 7e © 2004 by Prentice Hall, Inc.,
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 5 Systems and Matrices Copyright © 2013, 2009, 2005 Pearson Education, Inc.
Solving Linear Programming Problems: The Simplex Method
Algebraic Simplex Active Learning – Module 4 J. René Villalobos and Gary L. Hogg Arizona State University Paul M. Griffin Georgia Institute of Technology.
LINEAR PROGRAMMING APPLICATIONS IN MARKETING, FINANCE, AND OPERATIONS MANAGEMENT (2/3) Chapter 4 MANGT 521 (B): Quantitative Management.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
A LINEAR PROGRAMMING PROBLEM HAS LINEAR OBJECTIVE FUNCTION AND LINEAR CONSTRAINT AND VARIABLES THAT ARE RESTRICTED TO NON-NEGATIVE VALUES. 1. -X 1 +2X.
Chapter 6 Simplex-Based Sensitivity Analysis and Duality
 Minimization Problem  First Approach  Introduce the basis variable  To solve minimization problem we simple reverse the rule that is we select the.
1 1 Slide © 2005 Thomson/South-Western Linear Programming: The Simplex Method n An Overview of the Simplex Method n Standard Form n Tableau Form n Setting.
Chapter 4 Linear Programming: The Simplex Method
Sensitivity analysis LI Xiao-lei. A graphical introduction to sensitivity analysis Sensitivity analysis is concerned with how changes in an LP’s parameters.
1 1 Slide © 2005 Thomson/South-Western Simplex-Based Sensitivity Analysis and Duality n Sensitivity Analysis with the Simplex Tableau n Duality.
Introduction to linear programming:- - Linear programming (LP) applies to optimization models in which the objective and constraints functions are strictly.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
University of Colorado at Boulder Yicheng Wang, Phone: , Optimization Techniques for Civil and Environmental Engineering.
Simplex Method for solving LP problems with two variables.
10/9 More optimization Test 2 is scheduled for next Monday, October pm Come to this room, FB 200, to take the test. This is a room change from what.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
3 Components for a Spreadsheet Optimization Problem  There is one cell which can be identified as the Target or Set Cell, the single objective of the.
Foundations-1 The Theory of the Simplex Method. Foundations-2 The Essence Simplex method is an algebraic procedure However, its underlying concepts are.
Decision Support Systems INF421 & IS Simplex: a linear-programming algorithm that can solve problems having more than two decision variables.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
The Simplex Method. and Maximize Subject to From a geometric viewpoint : CPF solutions (Corner-Point Feasible) : Corner-point infeasible solutions 0.
Solving Linear Program by Simplex Method The Concept
Linear Programming Dr. T. T. Kachwala.
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Chapter 5 Simplex-Based Sensitivity Analysis and Duality
Chapter 4 Linear Programming: The Simplex Method
ENGM 631 Optimization Ch. 4: Solving Linear Programs: The Simplex Method.
The Theory of the Simplex Method Asst. Prof. Dr. Nergiz Kasımbeyli
St. Edward’s University
Solving Linear Programming Problems: Asst. Prof. Dr. Nergiz Kasımbeyli
Well, just how many basic
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Simplex method (algebraic interpretation)
Presentation transcript:

EMGT 501 HW #1 Due Day: Sep 13 Chapter 2 - SELF TEST 18

Ch. 2 – 18 For the linear program Write this linear program in standard form. Find the optimal solution using the graphical solution procedure. What are the values of the three slack variables at the optimal solution?

Ch. 2 – 20 Embassy Motorcycle (EM) manufactures two lightweight motorcycles designed for easy handling and safety. The EZ-Rider model has a new engine and a low profile that make it easy to balance. The Lady-Sport model is slightly larger, uses a more traditional engine, and is specifically designed to appeal to women riders. Embassy produces the engines for both models at its Des Moines, Iowa, plant. Each EZ-Rider engine requires 6 hours of manufacturing time and each Lady-Sport engine requires 3 hours of manufacturing time. The Des Moines plant has 2100 hours of engine manufacturing time available for the next production period. Embassy’s motorcycle frame supplier can supply as many EZ-Rider frames as needed.

However, the Lady-Sport frame is more complex and the supplier can provide only up to 280 Lady-Sport frames for the next production period. Final assembly and testing requires 2 hours for each EZ-Rider model and 2.5 hours for each Lady-Sport model. A maximum of 1000 hours of assembly and testing time are available for the next production period. The company’s accounting department projects a profit contribution of $2400 for each EZ-Rider produced and $1800 for each Lady-Sport produced.

Formulate a linear programming model that can be used to determine the number of units of each model that should be produced in order to maximize the total contribution to profit. Find the optimal solution using the graphical solution procedure. Which constraints are binding.

Ch. 3 – 28 National Insurance Associates carries an investment portfolio of stocks, bonds, and other investment alternatives. Currently $200,000 of funds are available and must be considered for new investment opportunities. The four stock options National is considering and the relevant financial data are as follows: Stock A B C D Price per share $100 $50 $80 $40 Annual rate of return 0.12 0.08 0.06 0.10 Risk measure per dollar invested 0.10 0.07 0.05 0.08 The risk measure indicates the relative uncertainty associated with the stock in terms of its realizing the projected annual return; higher values indicate greater risk. The risk measures are provided by the firm’s top financial advisor.

National’s top management has stipulated the following investment guidelines: the annual rate of return for the portfolio must be at least 9% and no one stock can account for more than 50% of the total dollar investment. Use linear programming to develop an investment portfolio that minimizes risk. If the firm ignores risk and uses a maximum return-on-investment strategy, what is the investment portfolio? What is the dollar difference between the portfolios in parts (a) and (b)? Why might the company prefer the solution developed in part (a)?

Ch. 4 – 3 The employee credit union at State University is planning the allocation of funds for the coming year. The credit union makes four types of loans to its members. In addition, the credit union invests in risk-free securities to stabilize income. The various revenue-producing investments together with annual rates of return are as follows: Type of Loan/Investment Annual Rate of Return (%) Automobile loans 8 Furniture loans 10 Other secured loans 11 Signature loans 12 Risk-free securities 9

The credit union will have $2,000,000 available for investment during the coming year. State laws and credit union policies impose the following restrictions on the composition of the loans and investments. Risk-free securities may not exceed 30% of the total funds available for investment. Signature loans may not exceed 10% of the funds invested in all loans (automobile, furniture, other secured, and signature loans). Furniture loans plus other secured loans may not exceed the automobile loans Other secured loans plus signature loans may not exceed the funds invested in risk-free securities.

How should the $2,000,000 be allocated to each of the loan/investment alternatives to maximize total annual return? What is the projected total annual return?

Ch. 5 – 6 Basis 5 2 3 20 1 2 25 1 -1/2 1 1 1 40 30 15 Complete the initial tableau. Write the problem in tableau form. What is the initial basis? Does this basis correspond to the origin? Explain. What is the value of the objective function at this initial solution?

e. For the next iteration, which variable should enter the basis, and which variable should leave the basis? f. How many units of the entering variable will be in the next solution? Before making this first iteration, what do you think will be the value of the objective function after the first iteration? g. Find the optimal solution using the simplex method.

Theory of Simplex Method

A two-variable linear programming problem Max s.t. and For any LP problem with n decision variables, each CPF (Corner Point Feasible) solution lies at the intersection of n constraint boundaries; i.e., the simultaneous solution of a system of n constraint boundary equations.

Max s.t.

Original Form Augmented Form Max s.t. Max s.t. (1) Matrix Form (2)

Matrix Form (2) is Max s.t. (3) or Max s.t. (4) where

Then, we have Max s.t. (5) (6) where

Eq. (6) becomes (7) Putting Eq. (7) into (5), we have (8) So, (9) (10)

Eq. (10) can be expressed by (11) From Eq. (2), (12)

Thus, initial and later simplex tableau are

The Overall Procedure 1. Initialization: 2. Iteration: Same as for the original simplex method. 2. Iteration: Step 1 Determine the entering basic variable: Same as for the Simplex method.

Step 2 Determine the leaving basic variable: Same as for the original simplex method, except calculate only the numbers required to do this [the coefficients of the entering basic variable in every equation but Eq. (0), and then, for each strictly positive coefficient, the right-hand side of that equation].

3. Optimality test: Step 3 Determine the new BF solution: Derive and set 3. Optimality test: Same as for the original simplex method, except calculate only the numbers required to do this test, i.e., the coefficients of the nonbasic variables in Eq. (0).

Fundamental Insight Z RHS Z 1 Row0 Row1~N

Coefficient of: Right Side Iteration BV -3 -5 0 0 0 0 1 0 1 0 0 4 0 2 0 1 0 12 3 2 0 0 1 18

1 Coefficient of: Right Side Iteration BV 0 0 0 1 0 1 0 0 4 0 1 0 0 6 0 0 0 1 0 1 0 0 4 1 0 1 0 0 6 3 0 0 -1 1 6

1 Coefficient of: Right Side Iteration BV -3 0 0 0 1 0 1 0 0 4 -3 0 0 0 1 0 1 0 0 4 1 0 1 0 0 6 3 0 0 -1 1 6

1 Coefficient of: Right Side Iteration BV -3 0 0 0 1 0 1 0 0 4 -3 0 0 0 1 0 1 0 0 4 1 0 1 0 0 6 3 0 0 -1 1 6

1 so Coefficient of: Right Side Iteration BV -3 0 0 0 30 1 0 1 0 0 4 -3 0 0 0 30 1 0 1 0 0 4 1 0 1 0 0 6 3 0 0 -1 1 6

The most negative coefficient 4 6 minimum The most negative coefficient Coefficient of: Right Side Iteration BV -3 0 0 0 30 1 0 1 0 0 4 1 0 1 0 0 6 3 0 0 -1 1 6

2 Coefficient of: Right Side Iteration BV 0 0 0 0 0 1 2 0 1 0 0 6 0 0 0 0 0 1 2 2 0 1 0 0 6 1 0 0 2

2 Coefficient of: Right Side Iteration BV 0 0 0 1 0 0 1 2 0 1 0 0 6 0 0 0 1 0 0 1 2 2 0 1 0 0 6 1 0 0 2

2 so Coefficient of: Right Side Iteration BV 0 0 0 1 36 0 0 1 2 0 0 0 1 36 0 0 1 2 2 0 1 0 0 6 1 0 0 2