production_planning

nproducts

profit for each product (1-D vector)

profit

names of each product (1-D vector)

pnames

nresources

amount of each resource available (1-D vector)

capacity

names of each resource (1-D vector)

rnames

units of each resource required to produce 
1 unit of product (2-D vector to be provided as 1-D vector)

consumption

simple production planning problem taken from
https://github.com/MiniZinc/minizinc-examples
Goal is to maximize the profit

Constraint optimization, or constraint programming, is the name given to identifying
feasible solutions out of a very large set of candidates, where the problem can be modeled in terms
of arbitrary constraints. 'MiniZinc' is a free and open-source constraint modeling language.
Constraint satisfaction and discrete optimization problems can be formulated in a high-level
modeling language. Models are compiled into an intermediate representation that is understood by a
wide range of solvers. 'MiniZinc' itself provides several solvers, for instance 'GeCode'. R users
can use the package to solve constraint programming problems without using 'MiniZinc' directly,
modify existing 'MiniZinc' models and also create their own models.

production_planning: production planning problem

Description

Usage

Arguments