simplexR: simplexR

In dirkdegel/simplexR: Simplex Algorithm

Description

Solves (find an optimal solution or reports that the problem is not solveable) a generic linear program. Calls construct_tableau and simplex.

Usage

simplexR(A, b, c, sense = 1, relation = rep("<=", length(b)), max_iter = 100)

Arguments

A	matrix, coefficient matrix of the LP
b	vector, RHS
c	vector, coefficients of the objective function
sense	scalar, max = 1, min = -1 (default = 1)
relation	vector, "<=", "=", "=>" (default = "<=")
max_iter	scalar, maximum number of iterations (default = 100)

Value

Solves (find an optimal solution or reports that the problem is not solveable) a generic linear program. Calls construct_tableau and simplex.

dirkdegel/simplexR documentation built on Feb. 22, 2020, 11:25 a.m.