In this Chapter, we imagine a decision maker (or a group of experts) trying to establish or examine fair procedures to combine opinions about alternatives related to different points of view.

Multiple criteria decision making

This paper introduces a simplified presentation of a new computing procedure for solving the fuzzy Pythagorean transportation problem. To design the algorithm, we have described the Pythagorean fuzzy arithmetic and numerical conditions in three different models in Pythagorean fuzzy environment. To achieve our aim, we have first extended the initial basic feasible solution. Then an existing optimality method is used to obtain the cost of transportation. To justify the proposed method, few numerical experiments are given to show the effectiveness of the new model. Finally, some conclusion and future work are discussed.

/pdf/a-pythagorean-fuzzy-approach-to-the-transportation-problem-15p47r2rsu.pdf

A Pythagorean fuzzy approach to the transportation problem

Uncertain goal programming models for bicriteria solid transportation problem

Fixed charge solid transportation problem in uncertain environment and its algorithm

Portfolio selection can be regarded as a type of multi-objective decision problem. However, traditional solution methods rarely discussed the decision maker’s nonsatisfaction and hesitation degrees...

An Intuitionistic Fuzzy Multi-Objective Goal Programming Approach to Portfolio Selection

A new method using the principle of zero point method [10] is proposed for finding an optimal solution of solid transportation problems. The proposed method yields an optimal solution of the given solid transportation problem directly . It is very easy to understand and apply which can serve managers by providing the optimal solution to a variety of distribution problems involving three items. With help of a numerical example, the proposed method is illustrated. Mathematics Subject Classifications: 90C08, 90C90

http://www.m-hikari.com/ams/ams-2010/ams-69-72-2010/pandianAMS69-72-2010.pdf

A New Approach for Solving Solid Transportation Problems

A new method is proposed to obtain an optimal scheduling sequence for flow-shop scheduling problems involving transportation time, break down time and weights of jobs (constrained flow-shop scheduling problems) with 3-machines. The proposed method is very simple and easy to understand and also, provides an important tool for decision makers when they design a scheduling for constrained flow-shop scheduling problems with 3 machines. The proposed method is illustrated with help of numerical examples.

/pdf/solving-constrained-flow-shop-scheduling-problems-with-three-1u1lblh907.pdf

Solving Constrained Flow-Shop Scheduling Problems with Three Machines

A new method namely, blocking method for finding an optimal solution to bottleneck transportation problems which is very different from other existing methods. Then, for finding all efficient solutions of a bottleneck-cost transportation problem, another method namely, blocking zero point method is proposed which is based on zero point method [10]. Both the proposed methods will provide the necessary decision support to decision makers while they are handling time oriented logistic problems. Mathematics Subject Classifications: 90B06, 90B50

/pdf/a-new-method-for-solving-bottleneck-cost-transportation-2ma1rqru9v.pdf

A New Method for Solving Bottleneck-Cost Transportation Problems

A new method based on transportation algorithm is proposed for finding a optimal more-for-less (MFL) solution for transportation problems with mixed constraints. The optimal MFL solution procedure is illustrated with numerical example. The proposed method is very simple, easy to understand and apply. The existence of a more-for-less situation in distribution problems provides useful information to a manager in deciding on the plant in which capacities are to be increased, and to assess the markets in which it is worthwhile to pursue efforts to increase demand.

P. Pandian

Papers

A New Approach for Solving Solid Transportation Problems

Solving Constrained Flow-Shop Scheduling Problems with Three Machines

A New Method for Solving Bottleneck-Cost Transportation Problems

A New Approach for Solving Transportation Problems with Mixed Constraints

An innovative exact method for solving fully interval integer transportation problems