An innovative exact method for solving fully interval integer transportation problems
نویسندگان
چکیده
منابع مشابه
Solving Fully Interval Transshipment Problems
A new method namely, splitting method is proposed for finding an optimal solution to a transshipment problem in which all parameters are real intervals. With the help of a numerical example, the proposed method is illustrated. The splitting method is extended to fully fuzzy transshipment problems. Mathematical Subject Classification: 03E72
متن کاملTowards an efficient interval method for solving inverse kinematic problems
In this paper we present a new algehrwic analysis of the closure equation obtained for arbitrary single loop spatial kinematic chains, which allows us to design an eficient interval method for solving their inverse kinematics. The solution of a kinematic equation can be factored into a solution of both its rotational and its translational components. We have obtained general and simple expressi...
متن کاملA New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints
Most research on bilevel linear programming problem is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...
متن کاملA new approach for solving neutrosophic integer programming problems
Linear programming is one of the most important usages of operation research methods in real life, that includes of one objective function and one or several constraints which can be in the form of equality and inequality. Most of the problems in the real world are include of inconsistent and astute uncertainty, because of this reason we can’t obtain the optimal solution easily. In this paper, ...
متن کاملA NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Informatics in Medicine Unlocked
سال: 2018
ISSN: 2352-9148
DOI: 10.1016/j.imu.2018.04.007