Improved Upper Bound to Product Rate Variation Problem

Authors

  • Shree Ram Khadka Central Department of Mathematics, Institute of Science and Technology, Tribhuvan University, Kathmandu

DOI:

https://doi.org/10.3126/nmsr.v37i1-2.34069

Keywords:

Improved Upper Bound to Product Rate Variation Problem, Bound, Non-linear integer programming problem

Abstract

The sequencing problem which minimizes the deviation between the actual (integral) and the ideal (rational) cumulative production of a variety of models of a common base product is called the product rate variation problem. If the objective is to minimize the maximum deviation, the problem is bottleneck product rate variation problem and the problem with the objective of minimizing all the deviations is the total product rate variation problem. The problem has been widely studied with several pseudo-polynomial time exact algorithms and heurism-tics. The lower bound of a feasible solution to the problem has been investigated to be tight. However, the upper bound of a feasible solution had been established in the literature which could further be improved. In this paper, we propose the improved upper bound for BPRVP and TPRVP.

Downloads

Download data is not yet available.
Abstract
182
pdf
88

Downloads

Published

2020-12-31

How to Cite

Khadka, S. R. (2020). Improved Upper Bound to Product Rate Variation Problem. The Nepali Mathematical Sciences Report, 37(1-2), 47–54. https://doi.org/10.3126/nmsr.v37i1-2.34069

Issue

Section

Articles