Description Format Author(s) References See Also Examples

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] *

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

Frederick Novomestky [email protected]

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

1 2 | ```
data( ignizio.example.3.1 )
soln <- llgp( coefficients, targets, achievements )
``` |

```
Loading required package: lpSolve
```

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.