Simulated annealing (SA) has been an effective means that can address difficulties related to optimization problems. is now a common discipline for research with several productive applications such as production planning. Due to the fact that aggregate production planning (APP) is one of the most considerable problems in production planning, in this paper, we present multi-objective linear programming model for APP and optimized by . During the course of optimizing for the APP problem, it uncovered that the capability of was inadequate and its performance was substandard, particularly for a sizable controlled problem with many decision variables and plenty of constraints. Since this algorithm works sequentially then the current state wi

Let R be a commutative ring with identity, and let M be a unity R-module. M is called a bounded R-module provided that there exists an element x?M such that annR(M) = annR(x). As a generalization of this concept, a concept of semi-bounded module has been introduced as follows: M is called a semi-bounded if there exists an element x?M such that . In this paper, some properties and characterizations of semi-bounded modules are given. Also, various basic results about semi-bounded modules are considered. Moreover, some relations between semi-bounded modules and other types of modules are considered.

      Faintly continuous (FC) functions, entitled faintly S-continuous and faintly δS-continuous functions have been introduced and investigated via a -open and -open sets. Several characterizations and properties of faintly S-continuous and faintly -Continuous functions were obtained. In addition, relationships between faintly s- Continuous and faintly S-continuous function and other forms of FC function were investigated. Also, it is shown that every faintly  S-continuous is weakly S-continuous. The Convers is shown to be satisfied only if the co-domain of the function is almost regular.

In this paper we generalize Jacobsons results by proving that any integer  in   is a square-free integer), belong to . All units of  are generated by the fundamental unit  having the forms

our generalization build on using the conditions

This leads us to classify the real quadratic fields  into the sets  Jacobsons results shows that  and Sliwa confirm that  and  are the only real quadratic fields in .

Transport is a problem and one of the most important mathematical methods that help in making the right decision for the transfer of goods from sources of supply to demand centers and the lowest possible costs, In this research, the mathematical model of the three-dimensional transport problem in which the transport of goods is not homogeneous was constructed. The simplex programming method was used to solve the problem of transporting the three food products (rice, oil, paste) from warehouses to the student areas in Baghdad, This model proved its efficiency in reducing the total transport costs of the three products. After the model was solved in (Winqsb) program, the results showed that the total cost of transportation is (269,