object SimplexFTTest extends App
The SimplexFT
object is used to test the SimplexFT
class.
- Alphabetic
- By Inheritance
- SimplexFTTest
- App
- DelayedInit
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
args: Array[String]
- Attributes
- protected
- Definition Classes
- App
- Annotations
- @deprecatedOverriding( "args should not be overridden" , "2.11.0" )
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
val
executionStart: Long
- Definition Classes
- App
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
main(args: Array[String]): Unit
- Definition Classes
- App
- Annotations
- @deprecatedOverriding( "main should not be overridden" , "2.11.0" )
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
test(a: MatriD, b: VectoD, c: VectoD, x_B: Array[Int] = null): Unit
Test the FT Simplex Algorithm for solving Linear Programming problems.
Test the FT Simplex Algorithm for solving Linear Programming problems.
- a
the constraint matrix
- b
the limit/RHS vector
- c
the cost vector
- x_B
the indices of the initial basis
-
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 FT Simplex, matrix 'a' must be augmented with an identity matrix and vector 'c' augmented with zeros. ------------------------------------------------------------------------- Minimize z = -1x_0 - 2x_1 + 1x_2 - 1x_3 - 4x_4 + 2x_5 Subject to 1x_0 + 1x_1 + 1x_2 + 1y_3 + 1y_4 + 1x_5 <= 6 2x_0 - 1x_1 - 2x_2 + 1y_3 + 0y_4 + 0x_5 <= 4 0x_0 + 0x_1 + 1x_2 + 1y_3 + 2y_4 + 1x_5 <= 4 where z is the objective variable and x is the decision vector. ------------------------------------------------------------------------- Solution: primal x_1 = 4, x_7 = 8, x_4 = 2 dual y_1 = -2, y_2 = 0, y_3 = -1 objF f = -16 i.e., x = (4, 8, 2), x_B = (1, 7, 4), y = (-2, 0, -1), f = -16
- See also
Linear Programming and Network Flows, Example 5.1
-
def
test2(): Unit
Test case 2: Solution: x = (2/3, 10/3, 0), x_B = (0, 1, 5), f = -22/3
Test case 2: Solution: x = (2/3, 10/3, 0), x_B = (0, 1, 5), f = -22/3
- See also
Linear Programming and Network Flows, Example 5.2
-
def
test3(): Unit
Test case 3: Solution: x = (1/3, 0, 13/3), x_B = (0, 2, 4), f = -17
Test case 3: Solution: x = (1/3, 0, 13/3), x_B = (0, 2, 4), f = -17
- See also
Linear Programming and Network Flows, Example 3.9
-
def
test4(): Unit
Test case 4: randomly generated LP problem.
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
Deprecated Value Members
-
def
delayedInit(body: ⇒ Unit): Unit
- Definition Classes
- App → DelayedInit
- Annotations
- @deprecated
- Deprecated
(Since version 2.11.0) the delayedInit mechanism will disappear