metadata changes

Intro-Math-Programming/baseText/Mathematical Programming and Operations Research.ilg

@@ -0,0 +1,4 @@
+This is makeindex, version 2.15 [TeX Live 2019] (kpathsea + Thai support).
+Scanning input file Mathematical Programming and Operations Research.idx...done (0 entries accepted, 0 rejected).
+Nothing written in Mathematical Programming and Operations Research.ind.
+Transcript written in Mathematical Programming and Operations Research.ilg.

Intro-Math-Programming/baseText/Mathematical Programming and Operations Research.tex

@@ -252,8 +252,8 @@
 
 \usetikzlibrary{arrows.meta,positioning}
 
-\usepackage[disable]{todonotes}
-%\usepackage[colorinlistoftodos]{todonotes}
+%\usepackage[disable]{todonotes}
+\usepackage[colorinlistoftodos]{todonotes}
 \usepackage{etoolbox}
 
 \newcommand\getcurrentref[1]{%
@@ -355,9 +355,8 @@ \chapter*{Introduction}
 %% Comment definition to remove part 1
 \part{Linear Programming}
 
-\input{optimization/fractional-knapsack}
 
-%\def\partOne{Show Part One}
+\def\partOne{Show Part One}
 \ifdefined\partOne
 %%%%%%%%%%%%%%%%
 
@@ -366,6 +365,8 @@ \part{Linear Programming}
 Notes:  This Part applies to DORI.   We hope for 80\% completion by January 2023, and 100\% completion for January 2024}
 
 \input{optimization/modeling-linear-programming.tex}
+\input{optimization/fractional-knapsack}
+
 \input{lineqlpbook/linearProgrammingIntegerLinearProgramming}
 \input{Christopher_Griffin_Penn_State_University/Section2.tex}
 	\input{lineqlpbook/linearProgrammingGraphicalExample.tex}

Intro-Math-Programming/baseText/optimization/figures/figures-static/00_METADATA.bib

@@ -12,6 +12,13 @@ @Online{wiki/File/William_Rowan_Hamilton_painting.jpg
   options =	 {skipbib=true},
 }
 
+@Online{network-flow.png,
+  author =	 {{Robert Hildebrand [CC BY-SA 4.0]}},
+  title =	 {Network flow example},
+  shorttitle =	 {Network Flow},
+  year =	 {2023},
+  options =	 {skipbib=true},
+}
 
 @Online{jssp.png,
   author =	 {{Robert Hildebrand [CC BY-SA 4.0]}},

Intro-Math-Programming/baseText/optimization/modeling-linear-programming.tex

@@ -435,7 +435,6 @@ \subsection{Assignment Problem}
 \todo[inline]{Add mathematical model}
 
 
-
 The assignment problem has an integrality property, such that if we remove the binary restriction on the $x$ variables (now just non-negative, i.e., $x_{ij} \ge 0$) then we still get binary assignments, despite the fact that it is now an LP.  This property is very interesting and useful. Of course, the objective function might not quite what we want, we might be interested ensuring that the team with the worst assignment is as good as possible (a fairness criteria). One way of doing this is to modify the assignment problem using a max-min objective:
 
 \medskip {\bf Max-min Assignment-like Formulation} \\
@@ -724,7 +723,7 @@ \subsubsection{Maximum Flow Problem}
 
 
 \todo[inline]{Make tikz/python graphs uniform.}
-\includefigurestatic[][scale = 0.5][h]{network-flow}
+\includefigurestatic[][scale = 0.5][h]{network-flow.png}
 
 
 \includefigurestatic[][scale = 0.5][h]{network-flow-solution}