EMGT 501 HW #1 Chapter 2 - SELF TEST 18 Chapter 2 - SELF TEST 20 Chapter 3 - SELF TEST 28 Chapter 4 - SELF TEST 3 Chapter 5 - SELF TEST 6

1 / 35

# EMGT 501HW 1Chapter 2 - SELF TEST 18Chapter 2 - SELF TEST 20Chapter 3 - SELF TEST 28Chapter 4 - SELF TEST 3Chapter 5 - - PowerPoint PPT Presentation

EMGT 501 HW #1 Chapter 2 - SELF TEST 18 Chapter 2 - SELF TEST 20 Chapter 3 - SELF TEST 28 Chapter 4 - SELF TEST 3 Chapter 5 - SELF TEST 6 Due Day: Sep 13 . Ch. 2 – 18 For the linear program. Write this linear program in standard form.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about 'EMGT 501HW 1Chapter 2 - SELF TEST 18Chapter 2 - SELF TEST 20Chapter 3 - SELF TEST 28Chapter 4 - SELF TEST 3Chapter 5 - ' - Sharon_Dale

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

EMGT 501

HW #1

Chapter 2 - SELF TEST 18

Chapter 2 - SELF TEST 20

Chapter 3 - SELF TEST 28

Chapter 4 - SELF TEST 3

Chapter 5 - SELF TEST 6

Due Day: Sep 13

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/InvestmentAnnual 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

40

30

15

Basis

5

2

0

3

20

1

2

0

25

0

1

-1/2

0

1

0

0

0

0

1

0

0

0

0

1

• 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.

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)

The Overall Procedure

1.Initialization:

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].

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

0

Row1~N

Coefficient of:

Right

Side

Iteration

BV

-3 -5 0 0 0 0

1 0 1 0 0 4

0

0 2 0 1 0 12

3 2 0 0 1 18

Coefficient of:

Right

Side

Iteration

BV

0 0 0

1 0 1 0 0 4

1

0 1 0 0 6

3 0 0 -1 1 6

Coefficient of:

Right

Side

Iteration

BV

-3 0 0 0

1 0 1 0 0 4

1

0 1 0 0 6

3 0 0 -1 1 6

Coefficient of:

Right

Side

Iteration

BV

-3 0 0 0

1 0 1 0 0 4

1

0 1 0 0 6

3 0 0 -1 1 6

so

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

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

Coefficient of:

Right

Side

Iteration

BV

0 0 0

0 0 1 2

2

0 1 0 0 6

1 0 0 2

Coefficient of:

Right

Side

Iteration

BV

0 0 0 1

0 0 1 2

2

0 1 0 0 6

1 0 0 2

so

Coefficient of:

Right

Side

Iteration

BV

0 0 0 1 36

0 0 1 2

2

0 1 0 0 6

1 0 0 2