DualSimplexTest

Value Members

1. final def !=(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

2. final def !=(arg0: Any): Boolean

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

5. final def ==(arg0: Any): Boolean

   Definition Classes

   Any

6. def args: Array[String]

   Attributes

   protected

   Definition Classes

   App

7. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

8. def clone(): AnyRef

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws()

9. def delayedInit(body: ⇒ Unit): Unit

   Definition Classes

   App → DelayedInit

10. final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

11. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

12. val executionStart: Long

    Definition Classes

    App

13. def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws()

14. final def getClass(): java.lang.Class[_]

    Definition Classes

    AnyRef → Any

15. def hashCode(): Int

    Definition Classes

    AnyRef → Any

16. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

17. def main(args: Array[String]): Unit

    Definition Classes

    App

18. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

19. final def notify(): Unit

    Definition Classes

    AnyRef

20. final def notifyAll(): Unit

    Definition Classes

    AnyRef

21. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

22. def test(a: MatrixD, b: VectorD, c: VectorD, x_B: Array[Int]): Unit

    Test the DualSimplex Algorithm for solving Linear Programming problems.

    Test the DualSimplex Algorithm for solving Linear Programming problems.

    a

    the constraint matrix

    b

    the limit/RHS vector

    c

    the cost vector

23. def test1(): Unit

    Test case 1: Initialize matrix 'a', vectors 'b' and 'c', and optionally the basis 'x_B'.

    Test case 1: Initialize matrix 'a', vectors 'b' and 'c', and optionally the basis 'x_B'. For DualSimplex, matrix 'a' and vector 'c' are not augmented. -------------------------------------------------------------------------- Minimize z = 2x_0 + 3x_1 + 4x_2 Subject to 1x_0 + 2x_1 + 1x_2 >= 3 2x_0 - 1x_1 + 3x_2 >= 4 where z is the objective variable and x is the decision vector. Since constraints are >=, multiply by rows by -1 -------------------------------------------------------------------------- Dual Solution: x = (11/5, 2/5), x_B = (0, 1), f = 28/5

    See also

    Linear Programming and Network Flows, Example 6.6

24. def toString(): String

    Definition Classes

    AnyRef → Any

25. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws()

26. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws()

27. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws()