This paper introduces a tool to design structurally informed assemblages of interlocking blocks. First, the static problem limit analysis is extended with openings and running bond pattern. Then, method measure assemblage infeasibility due sliding resistance violation (namely infeasibility) described. An optimization procedure finally presented minimise measured by automatically changing shape ...

as regards of supper efficiency models which increased thediscrimination power of the standard dea models, still infeasibility mayoccure. in literature there exists some models overcome this difficulty.in this paper a new procedure has been mooted in order to remove thisshortcoming in a way that both input savings and output surplus arebeing considered. this procedure deals with nonradial chang...

The alternating direction method of multipliers (ADMM) is a powerful operator splitting technique for solving structured optimization problems. For convex optimization problems, it is well-known that the iterates generated by ADMM converge to a solution provided that it exists. If a solution does not exist, then the ADMM iterates do not converge. Nevertheless, we show that the ADMM iterates yie...

Explaining the causes of infeasibility of Boolean formulas has practical applications in various fields. We are generally interested in a minimum explanation of infeasibility that excludes irrelevant information. A smallest-cardinality unsatisfiable subset, called a minimum unsatisfiable core, can provide a succinct explanation of infeasibility and is valuable for applications. However little a...

We consider the problem of deciding whether an assembly of polyhedra can partitioned by an arbitrary sequence of translations. Di erent subassemblies may be moved at di erent stages. It is shown that certain D dimensional arrangements of hyperplanes can be searched in the following way: only a single connected component is traversed during the search, and the arrangement is searched as an arran...

Examples of weakly infeasible semidefinite programs are useful to test whether semidefinite solvers can detect infeasibility. However, finding non trivial such examples is notoriously difficult. This note shows how to use Lasserre’s semidefinite programming relaxations for polynomial optimization in order to generate examples of weakly infeasible semidefinite programs. Such examples could be us...

While some software engineering applications perform static analysis over the whole program call graph, others are more interested in specific call chains within a program’s call graph. It is thus important to identify when a particular static call chain for an object-oriented program may not be executable, or feasible, such that there is no input for which the chain will be taken. This paper e...