Linear programming, Financial Problem, Operation Research

How do I set this problem up for Excel:
A National Credit Union has $250,000 available to invest in a 12 month commitment. The money can be placed in Treasury notes yielding an 8% return or in mubnicipal bonds at an average rate of return of 9%. Credit uniion regulations require diversification to the extent that at least 50% of the investiment be placed in Treasury notes. Because of defaults in other municipalities, it is decided that NO MORE than 40% of the investiment be placed in bonds. How much should the credit union invest in each security so as to maximize its return on investment?
Posted Date: 3/6/2013 4:41:37 PM | Location : United States

Related Discussions:- Linear programming, Financial Problem, Assignment Help, Ask Question on Linear programming, Financial Problem, Get Answer, Expert's Help, Linear programming, Financial Problem Discussions

Write discussion on Linear programming, Financial Problem
Your posts are moderated
Related Questions
QUARTILES The three points on the scale  of observation ( or  values  of the variable) which  divide  the total  frequency  into four  equal  parts are called  quartiles for t

Customers arrive to a super market according to a Poisson process with intensity V = ½  per minute. The supermarket has two counters, that use a common queue. Counter 1 is always o

Normal 0 false false false EN-IN X-NONE X-NONE

find optimal solution for a 3*4 matrix 42 27 24 35 46 37 32 32 40 40 30 35 using modi method

The following linear programming is written to plan the production of two products. And the company wants to maximize profits. x1 = number of product 1 produced in each batch

Paired sample  sign Test Paired samples  sign test is applied  to a situation where two sample  are taken from  two population which  have continuous symmetrical distributi

Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignment

#question.Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0.