Improved upper bound to product rate variation problem

DOI10.3126/NMSR.V37I1-2.34069MaRDI QIDQ5040197zbMATH OpenOpenAlexFDO

Authors Shree Ram Khadka

Publication date 11 October 2022

Published in The Nepali Mathematical Sciences Report (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3126/nmsr.v37i1-2.34069

zbMATH Keywords

boundnonlinear integer programming problemproduct rate variation problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Production theory, theory of the firm (91B38)

Recommendations

• Bottleneck product rate variation problem with absolute-deviation objective
• A note on bottleneck product rate variation problem with square-deviation objective
• Modelling and solving the production rate variation problem (PRVP)
• Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem
• Optimality of the cyclic sequence on bottleneck product rate variation problem with a general objective

Cited in

(7)

• A simple approach to the product rate variation problem via axiomatics
• Modelling and solving the production rate variation problem (PRVP)
• Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem
• Output rate variation problem: some heuristic paradigms and dynamic programming
• A note on bottleneck product rate variation problem with square-deviation objective
• Bottleneck product rate variation problem with absolute-deviation objective
• Optimality of the cyclic sequence on bottleneck product rate variation problem with a general objective

This page was built for publication: Improved upper bound to product rate variation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5040197)