Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Solving Fuzzy Time–Cost Trade-Off in Construction Projects Using Linear Programming

Solving Fuzzy Time–Cost Trade-Off in Construction Projects Using Linear Programming The time–cost trade-off has been recognized as a very significant aspect of construction management. Generally, time–cost trade-off can be modeled as a fuzzy linear programming problem with symmetric or non-symmetric fuzzy numbers. However, it was successfully solved when the fuzzy membership functions are only symmetric. In the present work, a novel approach is introduced to solve fuzzy linear programming problem with non-symmetric fuzzy membership functions by transforming it to its corresponding nearest symmetric one. The transformed problem is then converted to its crisp linear programming problem and then solved by the standard primal simplex method. Two examples are presented to show the effectiveness of the proposed approach, and the results are discussed. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of The Institution of Engineers (India): Series A Springer Journals

Solving Fuzzy Time–Cost Trade-Off in Construction Projects Using Linear Programming

Loading next page...
 
/lp/springer-journals/solving-fuzzy-time-cost-trade-off-in-construction-projects-using-LogxQlRzIz
Publisher
Springer Journals
Copyright
Copyright © The Institution of Engineers (India) 2020
ISSN
2250-2149
eISSN
2250-2157
DOI
10.1007/s40030-020-00489-7
Publisher site
See Article on Publisher Site

Abstract

The time–cost trade-off has been recognized as a very significant aspect of construction management. Generally, time–cost trade-off can be modeled as a fuzzy linear programming problem with symmetric or non-symmetric fuzzy numbers. However, it was successfully solved when the fuzzy membership functions are only symmetric. In the present work, a novel approach is introduced to solve fuzzy linear programming problem with non-symmetric fuzzy membership functions by transforming it to its corresponding nearest symmetric one. The transformed problem is then converted to its crisp linear programming problem and then solved by the standard primal simplex method. Two examples are presented to show the effectiveness of the proposed approach, and the results are discussed.

Journal

Journal of The Institution of Engineers (India): Series ASpringer Journals

Published: Nov 7, 2020

There are no references for this article.