# Question: A stockbroker Richard Smith has just received a call from

A stockbroker, Richard Smith, has just received a call from his most important client, Ann Hardy. Ann has $50,000 to invest and wants to use it to purchase two stocks. Stock 1 is a solid blue-chip security with a respectable growth potential and little risk involved. Stock 2 is much more speculative. It is being touted in two investment newsletters as having outstanding growth potential but also is considered very risky. Ann would like a large return on her investment but also has considerable aversion to risk. Therefore, she has instructed Richard to analyze what mix of investments in the two stocks would be appropriate for her.

Ann is used to talking in units of thousands of dollars and 1,000-share blocks of stocks. Using these units, the price per block is 20 for stock 1 and 30 for stock 2. After doing some research, Richard has made the following estimates. The expected return per block is 5 for stock 1 and 10 for stock 2. The variance of the return on each block is 4 for stock 1 and 100 for stock 2. The covariance of the return on one block each of the two stocks is 5.

Without yet assigning a specific numerical value to the minimum acceptable expected return, formulate a nonlinear programming model for this problem. (To be continued in Prob. 13.7-6.)

Ann is used to talking in units of thousands of dollars and 1,000-share blocks of stocks. Using these units, the price per block is 20 for stock 1 and 30 for stock 2. After doing some research, Richard has made the following estimates. The expected return per block is 5 for stock 1 and 10 for stock 2. The variance of the return on each block is 4 for stock 1 and 100 for stock 2. The covariance of the return on one block each of the two stocks is 5.

Without yet assigning a specific numerical value to the minimum acceptable expected return, formulate a nonlinear programming model for this problem. (To be continued in Prob. 13.7-6.)

## Answer to relevant Questions

Consider the following nonlinear programming problem: Maximize Subject to x1 – x2 ≤ 2 and x1 ≥ 0, x2 ≥ 0. (a) Use the KKT conditions to demonstrate that (x1, x2) = (4, 2) is not optimal. Consider the following linearly constrained convex programming problem: Minimize Z = x21 – 6x1 + x32 – 3x2, Subject to x1 + x2 ≤ 1 and x1 ≥ 0, x2 ≥ 0. (a) Obtain the KKT conditions for this problem. Consider the following quadratic programming problem: Maximize f (x) = 8x1 – x12 + 4x2 – x22, subject to x1 + x2 ≤ 2 and x1 ≥ 0, x2 ≥ 0. The B. J. Jensen Company specializes in the production of power saws and power drills for home use. Sales are relatively stable throughout the year except for a jump upward during the Christmas season. Since the production ...Reconsider the linearly constrained convex programming model given in Prob. 13.6-5. Starting from the initial trial solution (x1, x2) ≥ (0, 0), use one iteration of the Frank-Wolfe algorithm to obtain exactly the same ...Post your question