Linear programming is a powerful optimization technique and an important field in the areas of science, engineering, and business. Large-scale linear programming problems arise in many practical applications, and solving these problems requires an integration of dataanalysis and data-manipulation capabilities. Database technology has become a central component of today’s information systems. Al...

in the process of milk production, the highest cost relates to animal feed. based on reports provided by the experts, around seventy percent of dairy livestock costs included feed costs. in order to minimize the total price of livestock feed, according to the limits of feed sources in each region or season, and also the transportation and maintenance costs and ultimately milk price reduction, o...

many ranking methods have been proposed so far. however, there is yet no method that can always give a satisfactory solution to every situation; some are counterintuitive, not discriminating; some use only the local information of fuzzy values; some produce different ranking for the same situation. for overcoming the above problems, we propose a new method for ranking fuzzy quantities based on ...

In semide nite programming one minimizes a linear function subject to the constraint that an a ne combination of symmetric matrices is positive semide nite. Such a constraint is nonlinear and nonsmooth, but convex, so semide nite programs are convex optimization problems. Semide nite programming uni es several standard problems (e.g., linear and quadratic programming) and nds many applications ...

jahanshahloo has suggested a method for the solving linear programming problems with zero-one variables‎. ‎in this paper we formulate fully fuzzy linear programming problems with zero-one variables and a method for solving these problems is presented using the ranking function and also the branch and bound method along with an example is presented.

In semidefinite programming, one minimizes a linear function subject to the constraint that an affine combination of symmetric matrices is positive semidefinite. Such a constraint is nonlinear and nonsmooth, but convex, so semidefinite programs are convex optimization problems. Semidefinite programming unifies several standard problems (e.g., linear and quadratic programming) and finds many app...