Description
Note: for this Homework set, I suggest using the Ipopt solver in JuMP. I veri ed that it works on my system (after running Pkg.update() and restarting Julia). Be sure to make use of the macros @NLconstraint and @NLobjective when specifying nonlinear constraints or objectives respectively.

Hexagon construction. The goal is to gure out the optimal geometry of a hexagon such that (1) the hexagon’s area is maximized and (2) the hexagon’s diameter does not exceed 1. The diameter of the hexagon is the largest distance between any pair of points belonging to the hexagon. There are many di erent ways to solve this problem. A few suggestions/hints:


Place one of the vertices at the origin so that you don’t need as many decision variables.



A simple way of computing the area of a hexagon is to split it into four triangles that share a common vertex. The area of the hexagon is then the sum of the areas of the four triangles.



The optimal solution will look like a legitimate hexagon. It will not be degenerate (no coincident vertices), nor will it be perfectly regular (all sidelengths equal).

Plot a picture of the optimal hexagon.

Fertilizer in uence model. A series of experiments is conducted to determine the e ect of a particular fertilizer on wheat crop yield. Here are the results: Such situations typically involve some sort
fertilizer rate (x) crop yield (y)

127

151

379

421

460

426
of \diminishing returns”. So there is a limit to how much the fertilizer can boost the yield. A popular model for this relationship is the following:

= k_{1} + k_{2} exp(k_{3}x)
Use nonlinear least squares to determine the values of (k_{1}; k_{2}; k_{3}) that provide the best t to the data.
We are expecting coe cients in the neighborhood of (500; 200; 1).
To display your result, produce a plot of the original data points and the best t curve.
1 of 1