Myths and Counterexamples in   Mathematical Programming

Myths and Counterexamples in Mathematical Programming (2010)

Cached

Download Links

by Harvey J. Greenberg

BibTeX

@MISC{Greenberg10mythsand,
    author = {Harvey J. Greenberg},
    title = { Myths and Counterexamples in Mathematical Programming },
    year = {2010}
}

Bookmark

OpenURL

Abstract

Citations

66	On self-organizing sequential search heuristics - Rivest - 1976
32	Amortized e ciency of list update and paging rules - Sleator, Tarjan - 1985
22	The Use of the Optimal Partition in a Linear Programming Solution for Postoptimal Analysis - Greenberg - 1993
18	Centralized and competitive inventory models with demand substitution - Netessine, Rudi - 2003
15	Asumptotic behavior of an allocation policy for revenue management - Cooper - 2002
15	Counter-intuitive throughput behaviors in networks under end-to-end control - Tang, Wang, et al. - 2006
9	A counterexample to a conjecture in optimal list ordering - Anderson, Nash, et al. - 1982
6	A Paradox in Equipment Replacement under Technological Improvement - Cheevaprawatdomrong, Smith
6	Constant absolute risk aversion, bankruptcy, and wealth-dependent decisions - Lippman, McCall, et al. - 1980
6	On the e ect of demand randomness on inventories and costs - Gerchak, Mossman - 1992
5	Facility location in the presence of congested regions with the rectilinear distance metric. Socio-Economic Planning Sciences - Butt, Cavalier - 1997
5	Rearrangement clustering: Pitfalls, remedies, and applications - Climer, Zhang
4	Min-max regret robust optimization approach on interval data uncertainty - Assavapokee, Realff, et al.
4	Stochastic programming and decision analysis: An apparent dilemma - Blau - 1974
4	Comparisons and evaluations of alternative approaches to the treatment of congestion in DEA - Cooper, Gu, et al.
4	Admissible decision rules for the Emodel of chance-constrained programming - Eisner, Kaplan, et al. - 1971
4	Commentary on facility location in the presence of congested regions with the rectilinear distance metric. Socio-Economic Planning Sciences - Sarkar, Butta, et al. - 2004
3	A comment on Blau's dilemma in stochastic programming and Bayesian decision analysis - Charnes, Cooper - 1975
3	Measuring super-e ciency in DEA in the presence of infeasibility - Chen
3	Bowie Kuhn's worst nightmare - Cochran - 2004
3	On mixed-strategy solutions to chance-constraint mathematical programs - Greenberg - 1968
3	Decision problems under risk and chance constrained programming: Dilemmas in the transition - Hogan, Morris, et al. - 1981
3	Response to 'on the Bayesability of chance-constrained programming problems' by LaValle - Jagannathan - 1987
3	Notes on sensitivity and stability of the classi cations of returns to scale in data envelopment analysis - Jahanshahloo, Lofti, et al. - 2005
3	On information-augmented chance-constrained programs - Lavalle - 1986
3	On the `Bayesability' of chance-constrained programming problems - Lavalle - 1986
3	Response to Use of Sample Information in Stochastic Recourse and Chance-Constrained Programming Models : On the `Bayesabillity' of CCP's - Lavalle - 1986
3	Negative answer to the conjecture on the convexity of the greatest eigenvalue - Liu, Liu - 2001
3	Blau's dilemma revisited - Nau - 1987
3	Notes on sensitivity and stability of the classi cations of returns to scale in data envelopment analysis: A comment - Seiford, Zhu - 2005
3	A comment on Measuring super-e ciency in DEA in the presence of infeasibility - Soleimani-damaneh, Jahanshahloo, et al. - 2006
3	Conditions that cause risk pooling to increase inventory - Yang, Schrage - 1993
3	When is the greatest eigenvalue of a parametrized symmetric matrix a convex function of the parameter? Linear Algebra and Its Applications - Ye - 1992
2	Validation and assessment issues of energy models - Greenberg, Murphy - 1979
2	On the unimodality of the manufacturer's objective function in the newsvendor model - Paul
1	and protocols in DEA - Pitfalls - 2001