Simplex2PTest

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): Unit

    Test the Simplex2P Algorithm for solving Linear Programming problems.

    Test the Simplex2P 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: Phase I solution - not needed Phase II solution x = (9, 9, 4), x_B = (0, 1, 2, 3, 6), f = 22 @see

24. def test2(): Unit

    Test case 2: Phase I solution - not needed Phase II solution x = (12, 28), x_B = (0, 1, 4), f = 800 @see

25. def test3(): Unit

    Test case 3: Phase I solution - not needed Phase II solution x = (1, 0, 1, 0), x_B = (0, 2, 4), f = 1 @see Cycles if you choose most positive objective function coefficient.

26. def test4(): Unit

    Test case 4: Phase I solution - not needed Phase II solution - no solution @see There is no solution since the LP is UNBOUNDED.

27. def test5(): Unit

    Test case 5: Phase I solution x = (4, 0), x_B = (0, 2), f = 0 Phase II solution x = (4, 4), x_B = (0, 1, 5), f = 12 @see Use -b_i to indicate a ">=" constraint (e.

    Test case 5: Phase I solution x = (4, 0), x_B = (0, 2), f = 0 Phase II solution x = (4, 4), x_B = (0, 1, 5), f = 12 @see Use -b_i to indicate a ">=" constraint (e.g., b_1 = -8).

28. def test6(): Unit

    Test case 6: Phase I solution x = (4, 0), x_B = (0, 2), f = 0 Phase II solution x = (0, 5), x_B = (0, 1, 5), f = 40 @see Use -b_i to indicate a ">=" constraint (e.

    Test case 6: Phase I solution x = (4, 0), x_B = (0, 2), f = 0 Phase II solution x = (0, 5), x_B = (0, 1, 5), f = 40 @see Use -b_i to indicate a ">=" constraint (e.g., b_4 = -5).

29. def toString(): String

    Definition Classes

    AnyRef → Any

30. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

    Definition Classes

    AnyRef

    Annotations

    @throws()