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

Slides:



Advertisements
Similar presentations
Chapter 4 Decision Making
Advertisements

Overview of Working Capital Management
1 Chapter 14 Making the most of things: Linear Programming.
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
February 21, 2002 Simplex Method Continued
Thursday, March 7 Duality 2 – The dual problem, in general – illustrating duality with 2-person 0-sum game theory Handouts: Lecture Notes.
February 7, 2002 A brief review of Linear Algebra Linear Programming Models Handouts: Lecture Notes.
10.1 Trading Strategies Involving Options Chapter 10.
Quiz Number 1 Group 1 – North of Newark Thamer AbuDiak Reynald Benoit
SIMPLEX METHOD.
Enrolling in your group program with Standard Life Express TM Plan for life TM.
Hedging Strategies Using Futures
QUANTITATIVE METHODS FOR BUSINESS 8e
Chapter 2 Supply and Demand.
LP Formulation Practice Set 1
Copyright © Cengage Learning. All rights reserved.
6/11/2014 Question: XYZ Furniture Ltd. is involved in producing Chairs and Tables. The firm makes a profit of Rs. 200 per chair and Rs. 300 per table.
SENSITIVITY ANALYSIS. luminous lamps produces three types of lamps A, B And C. These lamps are processed on three machines X, Y and Z. the full technology.
Activity 1………………Saving vs. Investing Activity 2……….….Saving for a Rainy Day Activity 3…………………… = Saving Activity 4…..Investing for the Long Term.
NEFE High School Financial Planning Program Unit Three – Investing: Making Money Work for You Investing: Making Money Work for You Investing: Making Money.
Capacity Planning For Products and Services
Capacity Planning For Products and Services
Cost of Capital Chapter 13.
Chapter 6 The Mathematics of Diversification
LONG RUN A period of time over which the number of firms in an industry can change their production facilities. In the long run, firms can enter or leave.
Artificial Variables, 2-Phase and Big M Methods
The simplex algorithm The simplex algorithm is the classical method for solving linear programs. Its running time is not polynomial in the worst case.
LP—Graphical Solution Method MSci331—Week Convex Set and Extreme Points 2.
Simplex Method MSci331—Week 3~4.
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Operations Management - 5 th Edition Chapter 13 Supplement Roberta.
Chapter Organisation 6.1 Bond Valuation 6.2 Common Stock Valuation
Chapter 5: Time Value of Money: The Basic Concepts
Chapter 25 Risk Assessment. Introduction Risk assessment is the evaluation of distributions of outcomes, with a focus on the worse that might happen.
10b.1 Van Horne and Wachowicz, Fundamentals of Financial Management, 13th edition. © Pearson Education Limited Created by Gregory Kuhlemeyer. Chapter.
The Cost of Capital Chapter 10  Sources of Capital  Component Costs  WACC  Adjusting for Flotation Costs  Adjusting for Risk 10-1.
CHAPTER 10 The Cost of Capital
2 x0 0 12/13/2014 Know Your Facts!. 2 x1 2 12/13/2014 Know Your Facts!
Fundamentals of Cost Analysis for Decision Making
Copyright © 2008 Pearson Addison-Wesley. All rights reserved. Chapter 15 Interest Rates and the Capital Market.
IEOR 4004 Midterm Review (part I)
Capital Structure Debt versus Equity. Advantages of Debt Interest is tax deductible (lowers the effective cost of debt) Debt-holders are limited to a.
Chapter 5 The Mathematics of Diversification
16.410: Eric Feron / MIT, Spring 2001 Introduction to the Simplex Method to solve Linear Programs Eric Feron Spring 2001.
EMIS 8374 LP Review: The Ratio Test. 1 Main Steps of the Simplex Method 1.Put the problem in row-0 form. 2.Construct the simplex tableau. 3.Obtain an.
Linear Programming – Simplex Method: Computational Problems Breaking Ties in Selection of Non-Basic Variable – if tie for non-basic variable with largest.
Production Mix Problem Graphical Solution med lrg Electronics Cabinetry Profit (10,20) (Optimal Product Mix!) Profit.
BA 555 Practical Business Analysis
Quiz Number 2 Group 1 – North of Newark Thamer AbuDiak Reynald Benoit Jose Lopez Rosele Lynn Dave Neal Deyanira Pena Professor Kenneth D. Lawerence New.
EMGT 501 HW #1 Solutions Chapter 2 - SELF TEST 18
9.4 Linear programming and m x n Games: Simplex Method and the Dual Problem In this section, the process of solving 2 x 2 matrix games will be generalized.
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
EMGT 501 HW #2 Due Day: Sep 27 Chapter 6 - SELF TEST 21
EMGT 501 HW #1 Due Day: Sep 13 Chapter 2 - SELF TEST 18
The Simplex Method.
D Nagesh Kumar, IIScOptimization Methods: M3L4 1 Linear Programming Simplex method - II.
LINEAR PROGRAMMING SIMPLEX METHOD.
A model consisting of linear relationships representing a firm’s objective and resource constraints Linear Programming (LP) LP is a mathematical modeling.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Mechanical Engineering Department 1 سورة النحل (78)
 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
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 6.3 The student will be able to formulate the dual problem. The student.
Simplex Method for solving LP problems with two variables.
GOOD MORNING CLASS! In Operation Research Class, WE MEET AGAIN WITH A TOPIC OF :
Chapter 4 The Simplex Algorithm and Goal Programming
Linear Programming Dr. T. T. Kachwala.
Chapter 4 Linear Programming: The Simplex Method
Linear Programming SIMPLEX METHOD.
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.

EMGT 501 HW #1 Solutions Chapter 2 - SELF TEST 18

Ch. 2 – 18 (a)

Ch. 2 – 18 (b) (c) s1 = 0, s2 = 0, s3 = 4/7

Ch. 2 – 20 (a) Let E = number of units of the EZ-Rider produced L = number of units of the Lady-Sport produced

Ch. 2 – 20 (b)

Ch. 2 – 20 (c) The binding constraints are the manufacturing time and the assembly and testing time.

Ch. 3 – 28 (a) Let A = number of shares of stock A B = number of shares of stock B C = number of shares of stock C D = number of shares of stock D To get data on a per share basis multiply price by rate of return or risk measure value.

Solution: A = 333.3, B = 0, C = 833.3, D = 2500 Risk: 14,666.7 Return: 18,000 (9%) from constraint 2

Ch. 3 – 28 (b) Solution: A = 1000, B = 0, C = 0, D = 2500 Risk: 10A + 3.5B + 4C + 3.2D = 18,000 Return: 22,000 (11%)

Ch. 3 – 28 (c) The return in part (b) is $4,000 or 2% greater, but the risk index has increased by 3,333. Obtaining a reasonable return with a lower risk is a preferred strategy in many financial firms. The more speculative, higher return investments are not always preferred because of their associated higher risk.

Ch. 4 – 3 x1 = $ automobile loans x2 = $ furniture loans x3 = $ other secured loans x4 = $ signature loans x5 = $ "risk free" securities

Solution Annual Return $188,800 (9.44%)

Ch. 5 – 6 (a)

Ch. 5 – 6 (b)

Ch. 5 – 6 (c) The original basis consists of s1, s2, and s3. It is the origin since the nonbasic variables are x1, x2, and x3 and are all zero. (d) 0 x3 enters because it has the largest negative zj - cj and s2 will leave because row 2 has the only positive coefficient. (e) (f) 30; objective function value is 30 times 25 or 750. (g) Optimal Solution: x1 = 10 s1 = 20 x2 = 0 s2 = 0 x3 = 30 s3 = 0 z = 800.