example.r

In jy-r/Rsimplex: Simplex algorithm for linear programing in R.

#Example 1
#------------------
A <- matrix(c(2,2,3,1,3,2),nrow=2,byrow=TRUE)
b <- c(28,21)
constrains <- c(FALSE, TRUE) #Contrains >= are 1, <= are 0
C <- c(77,27,56)

(sol <- Rsimplex(A,b,C,constrains,max=TRUEm, log = FALSE))
#------------------

#Example2
#------------------
A <- matrix(c(1,0,1,2,1,1),nrow=2,byrow=TRUE)
b <- c(24,30)
constrains <- c(TRUE, TRUE) #Contrains >= are 1, <= are 0
C <- c(8,2,5)

(sol <- Rsimplex(A,b,C,constrains,max=FALSE, log = TRUE))
#Solution 132, x3=24, x2=6
#------------------

#Example 3
#------------------
A <- matrix(c(2,1,1,1,2,1),nrow=2,byrow=TRUE)
b <- c(25,8)
constrains <- c(FALSE, FALSE) #Contrains >= are 1, <= are 0
C <- c(24,20,14)

(sol <- Rsimplex(A,b,C,constrains,max=TRUE, log = TRUE))
#Solution 192, x4=9, x1=8
#------------------

#Example 4
#-----------------
A <- matrix(c(3,1,-3,2,-2,2),nrow=2,byrow=TRUE)
b <- c(5,2)
constrains <- c(TRUE, FALSE) #Contrains >= are 1, <= are 0
C <- c(5,1,3)

(sol <- Rsimplex(A,b,C,constrains,max=TRUE, log = TRUE))
#Unbounded function 
#-----------------

#Example 5
#-----------------
A <- matrix(c(2,2,3,1,2,2),nrow=2,byrow=TRUE)
b <- c(16,20)
constrains <- c(FALSE, TRUE) #Contrains >= are 1, <= are 0
C <- c(63,27,56)

(sol <- Rsimplex(A,b,C,constrains,max=FALSE, log = TRUE))
#Unstable function, doesnt have a solution
#-----------------


#Example 1
#------------------
A <- matrix(c(2,2,3,1,3,2,2,2,3,1,3,2),nrow=4,byrow=TRUE)
b <- c(28,21,15,36)
constrains <- c(FALSE, TRUE, FALSE, TRUE) #Contrains >= are 1, <= are 0
C <- c(77,27,56)

(sol <- Rsimplex(A,b,C,constrains,max=TRUE, log = FALSE))
#------------------