diff --git a/examples/Example/Monad/LinearProgramming.hs b/examples/Example/Monad/LinearProgramming.hs
new file mode 100644
index 0000000..d7293b0
--- /dev/null
+++ b/examples/Example/Monad/LinearProgramming.hs
@@ -0,0 +1,74 @@
+{-# LANGUAGE LambdaCase #-}
+{-# LANGUAGE ScopedTypeVariables #-}
+module Example.Monad.LinearProgramming
+  ( run )
+  where
+
+import Control.Monad
+import Control.Monad.IO.Class (liftIO)
+
+import Data.Maybe
+import Text.Printf
+
+import Debug.Trace
+
+import Z3.Monad
+
+-- Credits to 18.310A Principles of Discrete Applied Mathematics by Prof Michel Goemans at MIT
+-- SEE: "Lecture notes on linear programming.", https://math.mit.edu/~goemans/18310S15/18310A.html
+run = evalZ3 $ do
+  {-
+    Let
+      x_t = number of tables made per week
+      x_c = number of chairs made per week
+
+    Constraints
+    total work time:  6 x_t + 3 x_c <= 40
+    customer demand:  x_c >= 3 x_t
+    storage space:    (x_c / 4) + x_t <= 4
+
+    all variables are non-negative: x_t, x_c >= 0
+
+    Objective:        maximise P(x_t, x_c)
+    where
+      profit P(x_t, x_c) = 30 x_t + 10 x_c
+
+    Solution
+    x_c = 10.667, x_t = 1.333 and the corresponding profit = 146.667
+   -}
+  [zero, three, four, six, ten, thirty, fourty] <- mapM mkRealNum [0.0, 3.0, 4.0, 6.0, 10.0, 30.0, 40.0]
+  x_t <- mkFreshRealVar "x_t"
+  x_c <- mkFreshRealVar "x_c"
+
+  -- non-negative constraints
+  optimizeAssert =<< mkGe x_t zero
+  optimizeAssert =<< mkGe x_c zero
+
+  -- total work time
+  optimizeAssert =<< mkGe fourty =<< mkAdd =<< sequence [mkMul [six, x_t], mkMul [three, x_c]]
+
+  -- customer demand
+  optimizeAssert =<< mkGe x_c =<< mkMul [three, x_t]
+
+  -- storage space
+  optimizeAssert =<< mkGe four =<< mkAdd =<< (:[x_t]) <$> mkDiv x_c four
+
+  -- objective
+  objective <- mkAdd =<< sequence [mkMul [thirty, x_t], mkMul [ten, x_c]]
+  -- specify minimization
+  optimizeMaximize objective
+
+  optimizeCheck [] >>= \case
+    Sat -> do
+      model <- optimizeGetModel
+      profit :: Double <- fromRational <$> fromJust <$> evalReal model objective
+      tables :: Double <- fromRational <$> fromJust <$> evalReal model x_t
+      chairs :: Double <- fromRational <$> fromJust <$> evalReal model x_c
+      liftIO $ printf "tables (x_t): %f, chairs (x_c): %f, profit: %f" tables chairs profit
+    Unsat -> do
+      traceShowM =<< optimizeGetUnsatCore
+      error "Unsat"
+    _ -> do
+      error <$> optimizeGetReasonUnknown
+
+
diff --git a/examples/Examples.hs b/examples/Examples.hs
index f3d5a3b..f3e2a1c 100644
--- a/examples/Examples.hs
+++ b/examples/Examples.hs
@@ -13,6 +13,7 @@ import qualified Example.Monad.Tuple
 import qualified Example.Monad.ParserInterface
 import qualified Example.Monad.ParserEvalInterface
 import qualified Example.Monad.IntList
+import qualified Example.Monad.LinearProgramming
 
 import System.Environment
 
@@ -48,10 +49,14 @@ examples =
     , Example.Monad.ParserInterface.run
     )
   , ("parserEvalInterface"
-    , Example.Monad.ParserEvalInterface.run)
+    , Example.Monad.ParserEvalInterface.run
+    )
   , ("intList"
     , Example.Monad.IntList.run
     )
+  , ("linearProgramming"
+    , Example.Monad.LinearProgramming.run
+    )
   ]
 
 runExample :: String -> IO ()
diff --git a/z3.cabal b/z3.cabal
index 3ffcf23..68bd816 100644
--- a/z3.cabal
+++ b/z3.cabal
@@ -112,6 +112,7 @@ Executable examples
 
   Other-Modules:       Example.Monad.Queens4
                        Example.Monad.Queens4All
+                       Example.Monad.LinearProgramming
                        Example.Monad.DataTypes
                        Example.Monad.FuncModel
                        Example.Monad.MutuallyRecursive