From 9fa3ff6139521b1c5c6f61db9a7942f5feace3a8 Mon Sep 17 00:00:00 2001 From: "St. Elmo Wilken" Date: Sun, 17 Dec 2023 16:08:54 +0100 Subject: [PATCH] slightly change wording in example --- docs/src/mixed-integer-optimization.jl | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/docs/src/mixed-integer-optimization.jl b/docs/src/mixed-integer-optimization.jl index c6e23a9..1dcebf7 100644 --- a/docs/src/mixed-integer-optimization.jl +++ b/docs/src/mixed-integer-optimization.jl @@ -1,10 +1,10 @@ # # Example: Mixed integer optimization # -# In this example we demonstrate the use of binary constraints and values. -# We assume that the reader is already familiar with the construction of -# `ConstraintTree`s; if not, it is advisable to read the previous part -# of the documentation first. +# In this example we demonstrate the use of binary, and integer valued +# variables. We assume that the reader is already familiar with the construction +# of `ConstraintTree`s; if not, it is advisable to read the previous part of the +# documentation first. # The simple problem we will solve is: # max x + y + 3 z