# -*- coding: utf-8 -*-

"""
OIA 2 mai 2018

Trouver la bonne combinaison de nutriments au meilleur coût !

"""

from ortools.linear_solver import pywraplp

import numpy as np

def solve_diet(N):
t = 'Diet'
s = pywraplp.Solver(t,pywraplp.Solver.GLOP_LINEAR_PROGRAMMING)
nbF,nbN = len(N)-2, len(N[0])-3
FMin,FMax,FCost,NMin,NMax = nbN,nbN+1,nbN+2,nbF,nbF+1

f = [s.NumVar(N[i][FMin], N[i][FMax],'') for i in range(nbF)]

for j in range(nbN):
s.Add(s.Sum([f[i]*N[i][j] for i in range(nbF)]) >= N[NMin][j])
s.Add(s.Sum([f[i]*N[i][j]