Sequential buying policies

DOI10.1016/S0377-2217(98)00386-5zbMath0976.90118OpenAlexW2041327661MaRDI QIDQ1579489

Peng-Sheng You

Publication date: 13 January 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00386-5

zbMATH Keywords

dynamic programmingpurchasing

Mathematics Subject Classification ID

Dynamic programming (90C39) Economic growth models (91B62)

Related Items (4)

STOCHASTIC SEQUENTIAL ASSIGNMENT PROBLEM WITH ARRIVALS ⋮ CUSTOMER SELECTION PROBLEM WITH SEARCH COST, DUE DATE, SIDELINE PROFIT, AND NO WAITING ROOM ⋮ Optimal admission and pricing control problems in service industries with multiple servers and sideline profit ⋮ Optimal admission and pricing control problem with deterministic service times and sideline profit

Cites Work

• Unnamed Item
• Unnamed Item
• Dynamic programming of some sequential sampling design
• On optimal stopping of a sequence of independent random variables- probability maximizing approach
• THE OPTIMAL STOPPING PROBLEM IN WHICH THE SUM OF THE ACCEPTED OFFER'S VALUE AND THE REMAINING SEARCH BUDGET IS AN OBJECTIVE FUNCTION
• GAME THEORETIC ANALYSIS FOR AN OPTIMAL STOPPING PROBLEM BY MEANS OF MOMENTS OF A DISTRIBUTION FUNCTION

This page was built for publication: Sequential buying policies