Home > other >  MILP problems, R language
MILP problems, R language

Time:10-12

A company should be in 3 months (1, 2, 3) X and Y the two products, the company has three machines (1, 2, and 3), each machine can work 160 hours per month, the production cost of these machines, machine 1, 2, and 3 respectively, 10, 11 and 12 yuan/hour, no machine manufacture product X need 1 hour, and manufacture products for 0.5 hours, Y products X and Y, respectively, with the final price of 30 yuan and 20 yuan, in the first month must be at least 200 kinds of products, in the next month must be at least 400 kinds of products, must be at least 250 kinds of products in the third month, a linear programming model is put forward, make the company benefit maximization,
Add constraints to the following assumptions:
For each machine must be at least a month, if you use a machine, you should rest next month,
Regardless of when to use machines 1 or 2, 3, can't use machine if it USES the meter 1 and 2, the computer can't use the computer 3,
All parts are independent,
Language requirements: R,
Need a mathematical model, thank you,
  • Related