We propose to solve generalized bilevel programs by a trust region approach where the “model” takes the form of a bilevel program involving a linear program at the upper level and a linear variational inequality at the lower level. By coupling the concepts of trust region and linesearch in a novel way, we obtain an implementable algorithm that converges to a strong stationary point of the origi...

In this paper we describe the implementation of a technique for minimizing XOR circuits used in cryptographic algorithms. More precisely, we present our work from [4] for encoding this synthesis problem to SAT with a focus on the case study of optimizing an important component of the Advanced Encryption Standard (AES) [8]. In addition to these previously published contributions, we report on no...

In this paper, we model any nonconvex quadratic program having a mix of binary and continuous variables as a linear program over the dual of the cone of copositive matrices. This result can be viewed as an extension of earlier separate results, which have established the copositive representation of a small collection of NP-hard problems. A simplification, which reduces the dimension of the lin...

this experiment was conducted to determine the medullated content of‏ ‏inner coat of dromedary and ‎bactrian camels kept in different provinces of iran. a total of 438‎‏ ‏male and female (71 and 371) camels were ‎grouped into fifth classes and hair samples were taken from right midside of animals. analysis of variance was ‎performed using general linear model way sas package and the least squar...

We study the problem of rewriting a disjunctive datalog program into plain datalog. We show that a disjunctive program is rewritable if and only if it is equivalent to a linear disjunctive program, thus providing a novel characterisation of datalog rewritability. Motivated by this result, we propose weakly linear disjunctive datalog—a novel rule-based KR language that extends both datalog and l...

A linear programming (LP) approach is proposed for the weighted graph matching problem. A linear program is obtained by formulating the graph matching problem in L1 norm and then transforming the resulting quadratic optimization problem to a linear one. The linear program is solved using a Simplex-based algorithm. Then, approximate 0-1 integer solutions are obtained by applying the Hungarian me...

We introduce a convex optimization modeling framework that transforms a convex optimization problem expressed in a form natural and convenient for the user into an equivalent cone program in a way that preserves fast linear transforms in the original problem. By representing linear functions in the transformation process not as matrices, but as graphs that encode composition of linear operators...

  Because of the piecewise linear nature of the data envelopment analysis (DEA) frontier, the optimal multipliers of the DEA models may not be unique. Choosing weights from alternative optimal solutions of dual multiplier models is one of the most frequently studied subjects in the context of DEA. In this paper, the authors have been inspired by the idea of Cooper et al. (2011) to propose a li...