scholarly journals A Solution Algorithm for Interval Transportation Problems via Time-Cost Tradeoff

2018 ◽  
Vol 14 (2) ◽  
pp. 7691-7701
Author(s):  
Inci Albayrak ◽  
Mustafa Sivri ◽  
Gizem Temelcan
Keyword(s):  
Dynamic Programming ◽  
Linear Programming ◽  
Integer Programming ◽  
Goal Programming ◽  
Transportation Problem ◽  
Solution Algorithm ◽  
Time Cost ◽  
Mathematical Methods ◽  
Interval Time ◽  
Linear Programming Problems

In this paper, an algorithm for solving interval time-cost tradeoff transportation problemsis presented. In this problem, all the demands are defined as intervalto determine more realistic duration and cost. Mathematical methods can be used to convert the time-cost tradeoff problems to linear programming, integer programming, dynamic programming, goal programming or multi-objective linear programming problems for determining the optimum duration and cost. Using this approach, the algorithm is developed converting interval time-cost tradeoff transportation problem to the linear programming problem by taking into consideration of decision maker (DM).

scholarly journals An Improvement for Fuzzy Stochastic Goal Programming Problems

2017 ◽  
Vol 2017 ◽  
pp. 1-9
Author(s):  
Shu-Cheng Lin ◽  
Han-Wen Tuan ◽  
Peterson Julian
Keyword(s):  
Linear Programming ◽  
Goal Programming ◽  
Random Environment ◽  
Solution Process ◽  
Lower Side ◽  
Stochastic Goal Programming ◽  
Linear Programming Problems ◽  
Standard Linear ◽  
Standard Linear Programming

We examined the solution process for linear programming problems under a fuzzy and random environment to transform fuzzy stochastic goal programming problems into standard linear programming problems. A previous paper that revised the solution process with the lower-side attainment index motivated our work. In this paper, we worked on a revision for both-side attainment index to amend its definition and theorems. Two previous examples were used to examine and demonstrate our improvement over previous results. Our findings not only improve the previous paper with both-side attainment index, but also provide a theoretical extension from lower-side attainment index to the both-side attainment index.

scholarly journals A Computer Oriented Method for Solving Transportation Problem

2015 ◽  
Vol 63 (1) ◽  
pp. 1-7
Author(s):  
Sharmin Afroz ◽  
M Babul Hasan
Keyword(s):  
Linear Programming ◽  
Computer Program ◽  
Simplex Method ◽  
Transportation Problem ◽  
Linear Program ◽  
Numerical Examples ◽  
Linear Programming Problems

In this paper, an algorithm and its computer oriented program have been developed for solving transportation programming (TP) reducing it into a linear program (LP). After formulating it into linear programming problems the number of variables becomes large. It then, becomes more difficult and time-consuming if it is done manually with simplex method. By using the computer program the solution can be found in a shorter time. It will be shown that a TP with a large number of variables can be solved in few seconds by using this method. A number of numerical examples are presented to demonstrate the method developed in this research. DOI: http://dx.doi.org/10.3329/dujs.v63i1.21758 Dhaka Univ. J. Sci. 63(1): 1-7, 2015 (January)

scholarly journals A Microcomputer Linear Programming Package: An Alternative to Mainframes

1984 ◽  
Vol 16 (1) ◽  
pp. 183-186 ◽  
Author(s):  
David H. Laughlin
Keyword(s):  
Linear Programming ◽  
Integer Programming ◽  
Objective Function ◽  
Solution Algorithm ◽  
Present Form ◽  
Sensitivity Analyses ◽  
Problem Size ◽  
Right Hand ◽  
Research Problems ◽  
Programming Package

AbstractThis paper presents the capabilities and limitations of a microcomputer linear programming package. The solution algorithm is a version of the revised simplex. Rapid problem entry, user ease of operation, sensitivity analyses on objective function and right hand sides are advantages. A problem size of 150 activities and 64 constraints can be solved in present form. Due to problem size, limitations and lack of parametric and integer programming routines, this package is thought to have the most value in teaching applications and research problems in the smaller size categories.

Sign in / Sign up

Export Citation Format

Share Document