The following linear program (LP) represents our adaptation of Dras's method.
formula 3 represents the objective function, with 4 through 7 expressing constraints: subject to: x i,j denotes a candidate for which we are to make a decision on whether to include it in the simplification of a given text d. we mean x i,j to represent the j-th best compression for the i-th sentence in d. Constraint 4 dictates that we have exactly one compression candidate for each sentence in d. w ij indicates the number of changes or deletions we performed on the original sentence to create x ij : -1 if x ij has one less term than the original sentence it is a compression of; 0 if there is no change.