Generalized Algebraic Data Types are a generalization of Algebraic Data Types with additional type equality constraints. These found their use in many functional programs, including the development of embedded domain specific programming languages and generic programming. Recently, several authors published novel inference algorithms and corresponding type system specifications. These approache...

In this paper, we propose a new method to obtain the eigenvalues and fuzzy triangular eigenvectors of matrix $$\left( {\tilde{A}} \right)$$ , where elements are given. For purpose, solve 1-cut eigenvectors. Considering interval system $$\left[ \right]_{\alpha } \left[ {\tilde{X}} = {\tilde{\lambda }} 0 \le \alpha 1$$ as α-cut $$\tilde{A}\tilde{X} \tilde{\lambda }\tilde{X}$$ determine left right...

we present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step q-superlinear convergence. the approach is based on an adaptive structured scheme due to mahdavi-amiri and bartels of the exact penalty method of coleman and conn for nonlinearly constrained optimization problems. the structured adaptation also makes use of the ideas of n...

‎in this paper‎, ‎some kkt type sufficient global optimality conditions‎ ‎for general mixed integer nonlinear programming problems with‎ ‎equality and inequality constraints (minpp) are established‎. ‎we achieve‎ ‎this by employing a lagrange function for minpp‎. ‎in addition‎, ‎verifiable sufficient global optimality conditions for general mixed‎ ‎integer quadratic programming problems are der...

in this paper, stochastic generalizations of some fixed point for operators satisfying random contractively generalized hybrid and some other contractive condition have been proved. we discuss also the existence of a solution to a nonlinear random integral equation in banah spaces.

the product rate variation problem minimizes the variation in the rate at which different models of a common base product are produced on the assembly lines with the assumption of negligible switch-over cost and unit processing time for each copy of each model. the assumption of significant setup and arbitrary processing times forces the problem to be a two phase problem. the first phase determ...