We show that Integer Programming (IP) can be used as an optimization technique for the instantiation of products of feature models. This is done by showing that the constraints of feature models can be written in linear form. As particular IP technique, we use Gomory cutting planes. We have applied this technique to a test suite of feature models from the literature, and found that the Gomory c...

this paper proposes a family of robust counterpart for uncertain linear programs (lp) which is obtained for a general definition of the uncertainty region. the relationship between uncertainty sets using norm bod-ies and their corresponding robust counterparts defined by dual norms is presented. those properties lead us to characterize primal and dual robust counterparts. the researchers show t...

in recent years according to the growing companies andproducts supplied, and competition between them has intensified. productsand diversity, one of the main concerns of commercial institutions.therefore, selecting the media to introduce and is important therelationship between customers’ products. given the multiplicity of mediain promoting and marketing the products, they are the optimalchoic...

abstract in current study, an irrigation examination and acquisition of environmental water in kor-river fields, that is dominated from doroudzan dam to bakhtegan lake, was done by an integrated economy-environmental model. the model was considered by economic, hydrologic and agronomic components. in the economic component, an optimal harvesting of water was done using non-linear programming in...

We define quasiconvex programming, a form of generalized linear programming in which one seeks the point minimizing the pointwise maximum of a collection of quasiconvex functions. We survey algorithms for solving quasiconvex programs either numerically or via generalizations of the dual simplex method from linear programming, and describe varied applications of this geometric optimization techn...

multi objective quadratic fractional programming (moqfp) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the object...