A decisive disadvantage of high dimensional optimization problems is the large number parameters which make identification process difficult. Many this are reflected in mathematical properties objective function used for parameter identification. Ideally, has a simple, paraboloid-like form with single minimum whose location corresponds to desired set. Instead, unfavorable “landscape forms” occu...

In this paper, we present an algorithm to solve the inequality constrained multi-objective programming (MP) by using a penalty function with objective parameters and constraint penalty parameter. First, the penalty function with objective parameters and constraint penalty parameter for MP and the corresponding unconstraint penalty optimization problem (UPOP) is defined. Under some conditions, a...

Cryptographic Hash functions are used to achieve a number of security objectives. In this paper, we bring out the importance of hash functions, its various structures, design techniques, attacks and the progressive recent development in this field.

Abstract In this paper, the convex nonsmooth optimization problem with fuzzy objective function and both inequality equality constraints is considered. The Karush–Kuhn–Tucker necessary optimality conditions are proved for such a extremum problem. Further, exact $$l_{1}$$ l 1 </mml:...