The document describes an optimization problem to maximize return on investment across three stock groups - blue chip, growth, and speculative - subject to constraints on total investment, maximum allocation percentages, and minimum investment amounts. The objective is to maximize total return (0.10X + 0.15Y + 0.20Z) subject to the constraints X+Y+Z ≤ $100,000, Y+Z ≤ 0.3*$100,000, and X+Z ≥ 0.5*$100,000.
The document describes an optimization problem to maximize return on investment across three stock groups - blue chip, growth, and speculative - subject to constraints on total investment, maximum allocation percentages, and minimum investment amounts. The objective is to maximize total return (0.10X + 0.15Y + 0.20Z) subject to the constraints X+Y+Z ≤ $100,000, Y+Z ≤ 0.3*$100,000, and X+Z ≥ 0.5*$100,000.
The document describes an optimization problem to maximize return on investment across three stock groups - blue chip, growth, and speculative - subject to constraints on total investment, maximum allocation percentages, and minimum investment amounts. The objective is to maximize total return (0.10X + 0.15Y + 0.20Z) subject to the constraints X+Y+Z ≤ $100,000, Y+Z ≤ 0.3*$100,000, and X+Z ≥ 0.5*$100,000.