‎in this paper, using the idea of convexificators, we study boundedness and nonemptiness of lagrange multipliers satisfying the first order necessary conditions. we consider a class of nons- mooth fractional programming problems with equality, inequality constraints and an arbitrary set constraint. within this context, define generalized mangasarian-fromovitz constraint qualification and show t...

A constraint satisfaction problem involves finding values for variables subject to constraints on which combinations of values are allowed. In some cases it may be impossible or impractical to solve these problems completely. We may seek to partially solve the problem in an "optimal" or "sufficient" sense. A formal model is presented for defining and studying such partial constraint satisfactio...

The tractability conjecture for constraint satisfaction problems (CSPs) describes the constraint languages over a finite domain whose CSP can be solved in polynomial-time. The precise formulation of the conjecture uses basic notions from universal algebra. In this talk, we give a short introduction to the universal-algebraic approach to the study of the complexity of CSPs. Finally, we discuss a...

A controversial hypothesis has proposed that lizards are subject to a speed-dependent axial constraint that prevents effective lung ventilation during moderate- and high-speed locomotion. This hypothesis has been challenged by results demonstrating that monitor lizards (genus Varanus) experience no axial constraint. Evidence presented here shows that, during locomotion, varanids use a positive ...

The discrete additive multiple-access arbitrarily varying channel (AVC) with two senders and one receiver is considered. Necessary and sufficient conditions are given for its deterministic-code average-probability-of-error capacity region under a state constraint to have a nonempty interior. In the case that no state constraint is present, the capacity region is characterized exactly. In the ca...

In this paper, we study the problem of constructing an energy efficient data aggregation tree for data gathering in wireless sensor networks. We consider a real-time scenario where the data aggregation must be performed within a specified latency constraint. The objective is to minimize the overall energy cost of the sensor nodes in the aggregation tree subject to the latency constraint. We pro...

Performance of a resource-efficient provisioning framework (RPF) is evaluated in this paper in wavelengthcontinuous optical networks under static traffic. The structure of the survivable routing problem is unraveled by an integer linear programming (ILP) model. Numerical results from direct ILP approaches show that the RPF still achieves more than 10% capacity savings over the traditional provi...

The optimal design of risers for castings has been the subject of numerous investigations and this paper determines the optimal dimensions when Chvorinov’s rule for solidification is obeyed by both the riser and casting and solidification time is the only constraint involved .This problem can be formulated to minimize the riser volume subject to the constraint that the riser solidification time...

Given a tree T (V, E) endowed with a length function l and a cost function c, the diameter lowering problem consists in finding the reals 0 ≤ x(e) ≤ l(e), e E such that the tree obtained from T by decreasing the length of every edge e by x(e) units has a minimal diameter subject to the constraint ¥e Ec(e)x(e) ≤ B, where B is the available budget (analogously, one can minimize the cost of loweri...

PracTools is an R package with functions that compute sample sizes for various types of finite population sampling designs when totals or means are estimated. One-, two-, and three-stage designs are covered as well as allocations for stratified sampling and probability proportional to size sampling. Sample allocations can be computed that minimize the variance of an estimator subject to a budge...