ignizio.example.3.1: Ignizio (1976) Example Data Sets

In goalprog: Weighted and lexicographical goal programming and optimization

Description

The data set that corresponds to Example 3-1 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 ] and {\mathbf{p}'} = [ p_1, p_2, p_3 ] that minimize \mathbf{a} = [ (2 p_1), (n_2), (n_3) ]
The objectives are as follows
10 x_1 + 15 x_2 + n_1 - p_1 = 40
100 x_1 + 100 x_2 + n_2 - p_2 = 1000
x_2 + n_3 - p_3 = 7
\mathbf{x}, \mathbf{n}, \mathbf{p} ≥ \mathbf{0}
The solution is {\mathbf{x}'} = [ 4, 0 ] and \mathbf{a} = [ 0, 600, 7]

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 [e-mail]

References

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

See Also

ignizio.datasets

Examples

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

Example output

Loading required package: lpSolve

goalprog documentation built on May 30, 2017, 5:07 a.m.