Ignizio (1976) Example Data Sets

Description

The data set that corresponds to Example 3.3 found in Ignizio (1976). These are examples of goal programming problems solved using the methods described by author.

Find {mathbf{x}'} = [ x_1, x_2 ] , {mathbf{n}'} = [ n_1, n_2, n_3, n_4 ] and {mathbf{p}'} = [ p_1, p_2, p_3, p_4 ] that minimize mathbf{a} = [ (2 p_1 + 3p_2), (n_3), (p_4) ]
The objectives are as follows
x_1 + x_2 + n_1 - p_1 = 10
x_1 + n_2 - p_2 = 4
5 x_1 + 3 x_2 + n_3 - p_3 = 56
x_1 + x_2 + n_4 - p_4 = 12
mathbf{x}, mathbf{n}, mathbf{p} ≥ mathbf{0}
The solution is {mathbf{x}'} = [ 4, 6 ] and mathbf{a} = [ 0, 18, 0]

Format

The data set is an R file that creates the coefficients matrix, the vector of target values and the data frame of achievement goals.

Author(s)

Frederick Novomestky fnovomes@poly.edu

References

Ignizio, J. P. (1976). Goal Programming and Extensions, Lexington Books.

See Also

ignizio.datasets

Examples

  data( ignizio.example.3.3 )
  soln <- llgp( coefficients, targets, achievements )

Results