Modelling and solving a bi-objective single period problem with incremental and all unit discount within stochastic constraints: NSGAII and MOPSO

Author(s):  
Mahsa Najimi ◽  
Seyed Hamid Reza Pasandideh
2011 ◽  
Vol 54 (5-6) ◽  
pp. 1273-1285 ◽  
Author(s):  
Ata Allah Taleizadeh ◽  
Farnaz Barzinpour ◽  
Hui-Ming Wee

2008 ◽  
Author(s):  
Ata Allah Taleizadeh ◽  
Hassan Shavandi ◽  
Afshin Riazi

2015 ◽  
Vol 48 (3) ◽  
pp. 1357-1361 ◽  
Author(s):  
Anna V. Kitaeva ◽  
Valentina I. Subbotina ◽  
Natalia V. Stepanova

2009 ◽  
Vol 2009 ◽  
pp. 1-15 ◽  
Author(s):  
Neale R. Smith ◽  
Jorge Limón Robles ◽  
Leopoldo Eduardo Cárdenas-Barrón

We formulate and solve a single-item joint pricing and master planning optimization problem with capacity and inventory constrains. The objective is to maximize profits over a discrete-time multiperiod horizon. The solution process consists of two steps. First, we solve the single-period problem exactly. Second, using the exact solution of the single-period problem, we solve the multiperiod problem using a dynamic programming approach. The solution process and the importance of considering both capacity and inventory constraints are illustrated with numerical examples.


2011 ◽  
Vol 18 (6) ◽  
pp. 1553-1563 ◽  
Author(s):  
A.A. Taleizadeh ◽  
H. Shavandi ◽  
R. Haji

Sign in / Sign up

Export Citation Format

Share Document