Dynamic lot-sizing with setup cost reduction

Article Abstract:

A dynamic lot-sizing prototype with setup cost reduction is employed to realize inventory reductions. Under the model, setup costs can be decreased by varying levels contingent on the amount invested. It was shown that inventory levels and total costs can be possibly decreased if proper investment levels in setup cost reductions are undertaken.

Inventory Control, Analysis, Just in time inventory systems, Just in time systems, Dynamic programming

---

Fractional programming with convex quadratic forms and functions

Article Abstract:

Solution to a fractional programming problem is derived using branch and bound algorithm. Problem deals with maximizing a ratio of convex function to convex function. Theoretical characteristics of problem are also analyzed.

Methods, Computer programming, Mathematics problems

---

Exact solutions to a class of stochastic generalized assignment problems

Article Abstract:

Solution for a stochastic generalized assignment problem is derived using branch and bound algorithm.

Tests, problems and exercises, Stochastic programming

Similar abstracts:

• Abstracts: Purchasing demand information in a stochastic-demand inventory system. Optimal shared-savings contracts in supply chains: linear contracts and double moral hazard
• Abstracts: Sampling on successive occasions to re-estimate future asset management expenditure. The Pearson system of utility functions
• Abstracts: Simulation techniques for the sensitivity analysis of multi-criteria decision models. Some notes on the reduction of network dimensionality in nested open queueing networks

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.