[Home ] [Archive]    
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Registration ::
Main Menu
Home::
Journal Information::
Articles archive::
Submission Instruction::
Registration::
Submit article::
Site Facilities::
Contact us::
::
Google Scholar

Citation Indices from GS

AllSince 2019
Citations85353571
h-index127
i10-index136

Search in website

Advanced Search
Receive site information
Enter your Email in the following box to receive the site news and information.
:: Search published articles ::
Showing 1 results for Mixed Integer Linear Fractional Program

M. Forhad Uddin,
Volume 5, Issue 1 (5-2014)
Abstract

Here, we consider single vendor-buyer model with multi-product and multi-customer and multi-facility location-production-distribution problem. It is assumed that the players of the supply chain are coordinated by sharing information. Vendor manufactures produce different products at different plants with limited capacities and then distribute the products to the consumers according to deterministic demands. A mixed integer linear fractional programming (MILFP) model is formulated and a solution approach for MILFP is discussed. Product distribution and allocation of different customers along with sensitivity of the key parameters and performance of the model are discussed through a numerical example. The results illustrate that profit achieved by the MILFP model is slightly higher than mixed integer programming (MIP) model. It is observed that increase in the opening cost decreases the profit obtained by both MILFP and MIP models. If the opening cost of a location decreases or increases, the demand and capacity of the location changes accordingly. The opening cost dramatically changes the demand rather than the capacity of the product. Finally, a conclusion is drawn in favor of the MILFP model as a relevant approach in a logistic model searching for the optimum solution.

Page 1 from 1     

مجله انجمن ایرانی تحقیق در عملیات Iranian Journal of Operations Research
Persian site map - English site map - Created in 0.07 seconds with 27 queries by YEKTAWEB 4645