Computational method for the profit bounds of inventory model with interval demand and unit cost
From MaRDI portal
Publication:864804
DOI10.1016/j.amc.2006.05.080zbMath1127.90307OpenAlexW2084135866MaRDI QIDQ864804
Publication date: 13 February 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.080
Related Items (5)
An interval programming approach for developing economic order quantity model with imprecise exponents and coefficients ⋮ An efficient interval computing technique for bound-constrained uncertain optimization problems ⋮ Cultural particle swarm optimization algorithms for uncertain multi-objective problems with interval parameters ⋮ Optimal value bounds in nonlinear programming with interval data ⋮ Using geometric programming to profit maximization with interval coefficients and quantity discount
Cites Work
- Unnamed Item
- Unnamed Item
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Optimal joint pricing and lot sizing with fixed and variable capacity
- Linearization method of global optimization for generalized geometric programming
- A new two-level linear relaxed bound method for geometric programming problems
- A return-on-inventory-investment maximization model for intermediate firms
- An Illustrative Application of Idea (Imprecise Data Envelopment Analysis) to a Korean Mobile Telecommunication Company
- Joint replenishment problem under continuous unit cost change
- Optimal inventory policies under decreasing cost functions via geometric programming
- The fundamental relations between geometric programming duality, parametric programming duality, and ordinary Lagrangian duality
- Solving posynomial geometric programming problems via generalized linear programming
This page was built for publication: Computational method for the profit bounds of inventory model with interval demand and unit cost
