[Top][All Lists]

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

[Help-glpk] adjacent condition in primal simplex for separable programmi

From: Fedor Nikitin
Subject: [Help-glpk] adjacent condition in primal simplex for separable programming
Date: Sun, 30 Sep 2018 00:01:41 +0300

Hi all,

There is a way to solve nonlinear programming problem with separable objective and linear constraints.
Problem is reduced to LP with additional condition on optimal basis. Namely for certain set of variables at most one variable 
from the set is allowed to be in basis. These conditions are called adjacent conditions. It seems to me that 
modifying simplex algorithm with additional constraints on basis is not that hard. 

Does GLPK support it?

Kind regards,

reply via email to

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