Nigel - thanks.
Is there anyway to save the basis so that from major iteration to major iteration it can use a "warm-start" when solving with the simplex method? Thanks - Jeff From: Nigel Galloway [mailto:[email protected]] Sent: Tuesday, April 26, 2011 6:36 AM To: Kelly, Jeff (ON0F); [email protected] Subject: Re: [Help-glpk] Calling GLPK successively/iteratively/recurisvely for nonlinear problems. See t1.cs in the examples directory -- Nigel Galloway [email protected] On Mon, 25 Apr 2011 07:33 -0400, "Kelly, Jeff (ON0F)" <[email protected]> wrote: All; I am wondering if anybody calls GLPK iteratively/successively/recursively to solve nonlinear problems similar to a sequential linear programming algorithm? My concern is calling GLPK multiple times where each LP subproblem is technically unrelated to a previous major iteration but successive calls to glp_set_row_bnds(), glp_set_col_bnds(),glp_set_obj_coef() and glp_load_matrix() are required. Although the structure of the LP subproblems do not change from major iteration to major iteration i.e., only the row/column bounds and objective/matrix coefficients change, I am wondering if there would be any problems using GLPK for this? Presumably if I call glp_delete_prob() after each major iteration has completed, then theoretically there should be no problem other than the overhead of setting up the LP subproblem each time. Any comments on this would be appreciated - Jeff _______________________________________________ Help-glpk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-glpk -- http://www.fastmail.fm - A no graphics, no pop-ups email service
_______________________________________________ Help-glpk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-glpk
