scholarly journals Dual Simplex Method Based solution for a Fuzzy Transportation Problem

2021 ◽  
Vol 1947 (1) ◽  
pp. 012017
Author(s):  
V. Sangeetha ◽  
K. Thirisangu ◽  
P. Elumalai
Keyword(s):  
Simplex Method ◽  
Transportation Problem ◽  
Dual Simplex Method ◽  
Dual Simplex ◽  
Fuzzy Transportation Problem

scholarly journals The Intelligence of Dual Simplex Method to Solve Linear Fractional Fuzzy Transportation Problem

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
S. Narayanamoorthy ◽  
S. Kalyani
Keyword(s):  
Objective Function ◽  
Simplex Method ◽  
Transportation Problem ◽  
Optimal Solution ◽  
Dual Simplex Method ◽  
Transportation Problems ◽  
Dual Simplex ◽  
Fuzzy Transportation Problem

An approach is presented to solve a fuzzy transportation problem with linear fractional fuzzy objective function. In this proposed approach the fractional fuzzy transportation problem is decomposed into two linear fuzzy transportation problems. The optimal solution of the two linear fuzzy transportations is solved by dual simplex method and the optimal solution of the fractional fuzzy transportation problem is obtained. The proposed method is explained in detail with an example.

A dual simplex method for grey linear programming problems based on duality results

2020 ◽  
Vol 10 (2) ◽  
pp. 145-157
Author(s):  
Davood Darvishi Salookolaei ◽  
Seyed Hadi Nasseri
Keyword(s):  
Linear Programming ◽  
Programming Problem ◽  
Linear Programming Problem ◽  
Simplex Method ◽  
Dual Problem ◽  
Complementary Slackness ◽  
Dual Simplex Method ◽  
Content Type ◽  
Dual Simplex ◽  
Linear Programming Problems

PurposeFor extending the common definitions and concepts of grey system theory to the optimization subject, a dual problem is proposed for the primal grey linear programming problem.Design/methodology/approachThe authors discuss the solution concepts of primal and dual of grey linear programming problems without converting them to classical linear programming problems. A numerical example is provided to illustrate the theory developed.FindingsBy using arithmetic operations between interval grey numbers, the authors prove the complementary slackness theorem for grey linear programming problem and the associated dual problem.Originality/valueComplementary slackness theorem for grey linear programming is first presented and proven. After that, a dual simplex method in grey environment is introduced and then some useful concepts are presented.

Sign in / Sign up

Export Citation Format

Share Document