[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Help-glpk] feasibility problem

From: Anselmo Pitombeira
Subject: Re: [Help-glpk] feasibility problem
Date: Sun, 18 Apr 2010 11:58:40 -0300
User-agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv: Gecko/20100416 Shredder/3.0.5pre

I am wondering if GLPK solves feasibility problem,that is the problem
without objective function just with constraints.
The feasibility problem is a particular case of the optimization
problem, where the objective function is a constant (usually zero).

If Yes,what kind of formulation it accepts.
The same as in the general case.

I think the feasibility problem is solved by the artificial problem, this is, the problem of finding an initial basic feasible solution by the Simplex Algorithm.

Help-glpk mailing list

reply via email to

[Prev in Thread] Current Thread [Next in Thread]