A Comparative Study on Objective Functions of Product Rate Variation and Discrete Apportionment Problems
DOI:
https://doi.org/10.3126/jist.v19i1.13830Keywords:
Objective function, product rate variation, sequencing, discrete apportionmentAbstract
Setting the proper objective functions to optimize the decision making situations is prevalent in most of the mathematical programming problems. In this paper, we formulate the mathematical models of product rate variation and discrete apportionment problems. Furthermore, a brief comparative study of the objective functions to both the problems is reported in terms of inequality measures, precisely indicating the equitably efficient frontier for production rate variation problem via discrete apportionment. The largest reminder algorithm and rank-index algorithm for the apportionment problem are discussed briefly.
Journal of Institute of Science and Technology, 2014, 19(1): 69-74
Downloads
Downloads
Published
How to Cite
Issue
Section
License
The views and interpretations in this journal are those of the author(s). They are not attributable to the Institute of Science and Technology, T.U. and do not imply the expression of any opinion concerning the legal status of any country, territory, city, area of its authorities, or concerning the delimitation of its frontiers of boundaries.
The copyright of the articles is held by the Institute of Science and Technology, T.U.