联系方式

  • QQ:99515681
  • 邮箱:99515681@qq.com
  • 工作时间:8:00-21:00
  • 微信:codinghelp

您当前位置:首页 >> Algorithm 算法作业Algorithm 算法作业

日期:2025-02-28 06:06

Math 132A Assignment 7

Due: Friday, March 15th at Midnight on Gradescope.

1. (a) Find a minimizer of subject to 2x1 + x2 = 1.

(b) If the constraint is changed to 2x1 + x2 = 1 + δ for a δ, estimate the change in value of the objective function. Compare this estimate with the actual change in value when δ = 0.25.

2. Let a1, a2, a3 be positive constants. Find a maximizer of the function f(x) = x1x2x3 subject the constraint

3. Find local minimizers of

4. For any vector c ∈ Rn solve the problem

5. Solve

6. Solve

(It may help to graph the feasible region to guess possible minimizers, but be sure to verify your guess(es) using the optimality conditions.)




版权所有:编程辅导网 2021 All Rights Reserved 联系方式:QQ:99515681 微信:codinghelp 电子信箱:99515681@qq.com
免责声明:本站部分内容从网络整理而来,只供参考!如有版权问题可联系本站删除。 站长地图

python代写
微信客服:codinghelp