Comment on “Solving the ‘Marketing Mix’ Problem using Geometric Programming”

DOI10.1287/mnsc.21.10.1204zbMath0322.60083OpenAlexW2087205833MaRDI QIDQ4085047

Kashi R. Balachandran, Henk C. Tijms

Publication date: 1975

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.21.10.1204

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (18)

Optimal design and control of queues ⋮ Markov-modulated fluid flow model with server maintenance period ⋮ On the M/G/1 queue with \(D\)-policy ⋮ Optimal control of the \(M^ X/G/1/K\) queue with multiple server vacations ⋮ Queue length and waiting time of the M/G/1 queue under the \(D\)-policy and multiple vacations ⋮ Entropy maximization and the busy period of some single-server vacation models ⋮ Numerical optimization of a queueing system by dynamic programming ⋮ A unified cost function for M/G/1 queueing systems with removable server ⋮ Optimal control policy of M/G/1 queueing system with delayed randomized multiple vacations under the modified min \((N, D)\)-policy control ⋮ A quorum queueing system under \(D\)-policy ⋮ Analysis of \(M^{(\lambda_1, \lambda_2)}/G/1\) queue with uninterrupted single vacation and server's workload controlled \(D\)-policy ⋮ The steady-state system size distribution for a modified D-policy Geo/G/1 queueing system ⋮ An analysis of the \(M/G/1\) system with \(N\) and \(T\) policy ⋮ A mean value formula for the M/G/1 queues controlled by workload ⋮ Performance of the MAP/G/1 queue under the dyadic control of workload and server idleness ⋮ New fluctuation analysis of \(D\)-policy bulk queues with multiple vacations ⋮ Unfinished work for the queue under \(D\)-policy with incomplete information on service times ⋮ On optimal exhaustive policies for the M/G/1-queue

This page was built for publication: Comment on “Solving the ‘Marketing Mix’ Problem using Geometric Programming”