In this paper we use steepest descent method for solving zero-one nonlinear programming problem. Using penalty function we transform this problem to an unconstrained optimization problem and then by steepest descent method we obtain the original...

. The determination of a crisp maximizing decision [2] is used for a defuzzification of these problems. The crisp problems obtained after the defuzzification are non-linear and non-convex in general. We propose here the ”augmented lagrangian penalty function method...

In this paper, we concentrate on linear programming problems in which both the right-hand side

and the technological coefficients are fuzzy numbers. We consider here only the case of fuzzy

numbers with linear ...