python pulp包求解整数线性规划和线性规划

以整数线性规划为例

# -*- coding: utf-8 -*-
import pulp as pulp

def solve_ilp(objective , constraints) :
    print objective
    print constraints
    prob = pulp.LpProblem('LP1' , pulp.LpMaximize)
    prob += objective
    for cons in constraints :
        prob += cons
    print prob
    status = prob.solve()
    if status != 1 :
        #print 'status'