Normal view MARC view ISBD view

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

By: Elkalla, Israa.
Contributor(s): Elbeltagi, Emad.
Publisher: New York Springer 2021Edition: Vol.102(1), March.Description: 267-278p.Subject(s): Civil EngineeringOnline resources: Click here In: Journal of the institution of engineers (India): Series ASummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode Item holds
Articles Abstract Database Articles Abstract Database School of Engineering & Technology (PG)
Archieval Section
Not for loan 2021-2022083
Total holds: 0

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.

There are no comments for this item.

Log in to your account to post a comment.

Click on an image to view it in the image viewer

Unique Visitors hit counter Total Page Views free counter
Implemented and Maintained by AIKTC-KRRC (Central Library).
For any Suggestions/Query Contact to library or Email: librarian@aiktc.ac.in | Ph:+91 22 27481247
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha