This function returns the initial modified simplex tableau as an object of type 'llgpcptab'
for a lexicographical linear programming problem with complementary pivoting and
for the given objectives and achievement goals
A matrix with the coefficients of the linear objective functions
targets
A vector of target values for the objective functions
achievements
A data frame with the weights of the deviation variables for each objective along with the corresponding priority level
variable.classes
A data frame that defines the complementarity classes for each of the variables
Value
An object of class 'llgpcptab' which is a list with the following named components
iterCurrent iteration number initially set to zero
variablesNumber of decision variables
levelsNumber of priority levels in the achievement function
objectivesNumber of objective functions
nonbasicsNumber of non basic variables = variables + objectives
levelCurrent priority level
teElements matrix
tbVector b initially the target values
twTop stub matrix
tuLeft stub matrix
tiMatrix of index rows
taAchievement vector
row.headingsVector of row headings initially the negative deviation variables
col.headingsVector of column headings initially the decision and positive deviation variables
variable.classesData frame with the complementary classes of the decision variables
Details
The modified simplex tableau contains a top stub matrix, a left stub matrix, an elements matrix,
index rows and achievement vector as specified in Ignizio (1976). The tableau is augmented with
the variable classes frame.
References
Ignizio, J. P. (1976). Goal Programming and Extensions, Lexington Books, D. C. Heath and Company.