Displaying 61 – 80 of 113

Showing per page

The single (and multi) item profit maximizing capacitated lot–size (PCLSP) problem with fixed prices and no set–up

Kjetil K. Haugen, Asmund Olstad, Krystsina Bakhrankova, Erik Van Eikenhorst (2010)

Kybernetika

This paper proposes a specialized LP-algorithm for a sub problem arising in simple Profit maximising Lot-sizing. The setting involves a single (and multi) item production system with negligible set-up costs/times and limited production capacity. The producer faces a monopolistic market with given time-varying linear demand curves.

The Variance Location Problem on a Network with Continuously distributed demand

Ma Cruz López de los Mozos, Juan A. Mesa (2010)

RAIRO - Operations Research

Most location problems on networks consider discrete nodal demand. However, for many problems, demands are better represented by continuous functions along the edges, in addition to nodal demands. Several papers consider the optimal location problem of one or more facilities when demands are continuously distributed along the network, and the objective function dealt with is the median one. Nevertheless, in location of public services it is desirable to use an equity criterion. One of the latter...

Currently displaying 61 – 80 of 113