Merge pull request #60 from ndcbe/contributed-notebooks

Contributions for Project 2

Author: adowling2

Diff for: _toc.yml

@@ -105,8 +105,16 @@ parts:
       - file: notebooks/contrib/race_car_extended.ipynb
       - file: notebooks/contrib/hot_air_balloon.ipynb
       - file: notebooks/contrib/reactor_design.ipynb
-    - file: notebooks/contrib/dfo.md
+      - file: notebooks/contrib/Disaster_Response_Plan.ipynb
+      - file: notebooks/contrib/Sudoku_Solver.ipynb
+      - file: notebooks/contrib/more_circle_packing.ipynb
+    - file: notebooks/contrib/modeling.md
       sections:
+      - file: notebooks/contrib/multi_objective.ipynb
+      - file: notebooks/contrib/advanced_stochastic_programming.ipynb
+    - file: notebooks/contrib/algorithms.md
+      sections:
+      - file: notebooks/contrib/Deterministic_Global_Optimization.ipynb
       - file: notebooks/contrib/Bayesian_Optimization1.ipynb
       - file: notebooks/contrib/Bayesian_Optimization2.ipynb
     - file: notebooks/contrib/sgd.md

Diff for: all_var.png

@@ -13,7 +13,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "### Sample Average Approximation\n",
+    "## Sample Average Approximation\n",
     "\n",
     "Sample average approximation (SAA) method is an approach for solving stochastic optimization problems by Monte Carlo simulation. It approximates the expected objective function of the stochastic problem by a sample average estimate derived from a random sample. The resulting sample average approximation problem is then solved by deterministic optimization techniques. \n",
     "\n",
@@ -32,7 +32,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "### Sparse Grids (Worst Case)\n",
+    "## Sparse Grids (Worst Case)\n",
     "\n",
     "Instead of Monte carlo sampling, sparse grids can be used to obtain efficient characterizations of the integrals in stochastic programs. Many computational problems are solved on full grids. While this is feasible if the dimentionality $d$ of the problem is low, 2 or 3, full grids become very expensive when facing a higher dimentional problem $d>4$. This is due to the curse of dimensionality, which states that the complexity of full grids grows exponentially with $d$. \n",
     "\n",
@@ -162,7 +162,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "### Reference \n",
+    "## Reference \n",
     "\n",
     "Biegler, L.T., 2010. Nonlinear programming: concepts, algorithms, and applications to chemical processes. Society for Industrial and Applied Mathematics.\n",
     "\n",

Diff for: fat.png

@@ -13,7 +13,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "### Sample Average Approximation\n",
+    "## Sample Average Approximation\n",
     "\n",
     "Sample average approximation (SAA) method is an approach for solving stochastic optimization problems by Monte Carlo simulation. It approximates the expected objective function of the stochastic problem by a sample average estimate derived from a random sample. The resulting sample average approximation problem is then solved by deterministic optimization techniques. \n",
     "\n",
@@ -32,7 +32,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "### Sparse Grids (Worst Case)\n",
+    "## Sparse Grids (Worst Case)\n",
     "\n",
     "Instead of Monte carlo sampling, sparse grids can be used to obtain efficient characterizations of the integrals in stochastic programs. Many computational problems are solved on full grids. While this is feasible if the dimentionality $d$ of the problem is low, 2 or 3, full grids become very expensive when facing a higher dimentional problem $d>4$. This is due to the curse of dimensionality, which states that the complexity of full grids grows exponentially with $d$. \n",
     "\n",
@@ -162,7 +162,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "### Reference \n",
+    "## Reference \n",
     "\n",
     "Biegler, L.T., 2010. Nonlinear programming: concepts, algorithms, and applications to chemical processes. Society for Industrial and Applied Mathematics.\n",
     "\n",