From 3ad168784458445c850873eee50ccb310ce14898 Mon Sep 17 00:00:00 2001
From: "Matthias C. M. Troffaes" <matthias.troffaes@gmail.com>
Date: Sat, 14 Sep 2024 18:13:52 +0100
Subject: [PATCH] Simplify linear programming example.

---
 docs/source/linprog.rst | 21 ++-------------------
 1 file changed, 2 insertions(+), 19 deletions(-)

diff --git a/docs/source/linprog.rst b/docs/source/linprog.rst
index ea5a519..cb128f5 100644
--- a/docs/source/linprog.rst
+++ b/docs/source/linprog.rst
@@ -1,30 +1,13 @@
 .. testsetup::
 
-   import cdd
    import cdd.gmp
    from fractions import Fraction
 
 Solving Linear Programs
 =======================
 
->>> mat = cdd.gmp.matrix_from_array([[Fraction(4, 3),-2,-1],[Fraction(2, 3),0,-1],[0,1,0],[0,0,1]])
->>> mat.obj_type = cdd.LPObjType.MAX
->>> mat.obj_func = (0,3,4)
->>> mat.rep_type = cdd.RepType.INEQUALITY
->>> print(mat)
-H-representation
-begin
- 4 3 rational
- 4/3 -2 -1
- 2/3 0 -1
- 0 1 0
- 0 0 1
-end
-maximize
- 0 3 4
->>> print(mat.obj_func)
-[Fraction(0, 1), Fraction(3, 1), Fraction(4, 1)]
->>> lp = cdd.gmp.linprog_from_matrix(mat)
+>>> array = [[Fraction(4, 3),-2,-1],[Fraction(2, 3),0,-1],[0,1,0],[0,0,1],[0,3,4]]
+>>> lp = cdd.gmp.linprog_from_array(array, obj_type=cdd.LPObjType.MAX)
 >>> cdd.gmp.linprog_solve(lp)
 >>> lp.status == cdd.LPStatusType.OPTIMAL
 True