Hi, Do you have in mind something more complicated than adding a constraint to your MILP that says z<=upper_bound (where z is your objective function c1x1+c2x2+...cnxn)?
Take care, Mihai ----------------- Mihai Banciu PhD Candidate Operations Group, Katz Graduate School of Business University of Pittsburgh [EMAIL PROTECTED] wrote: > good morning, > > I am currently programming a MILP thanks GLPK. The objective function of > the MILP is a function to maximize for which I know an upper bound. > But how to integrate this upper bound into the solution process of GLPK ? > > Thank you for your answer and for your works. > > Sincerely yours, > > Alexis Aubry > 3rd year Ph.D. Student > G-SCOP (Grenoble - Sciences pour la Conception, l'Optimisation et la > Production) > Ensieg - Domaine Universitaire > B.P 46 > 38402 St-Martin d'Hères CEDEX > [EMAIL PROTECTED] > > > > > > > _______________________________________________ > Help-glpk mailing list > [email protected] > http://lists.gnu.org/mailman/listinfo/help-glpk > _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
