F. J. (Floyd Jerome) Gould's research while affiliated with University of Chicago and other places
What is this page?
This page lists the scientific contributions of an author, who either does not have a ResearchGate profile, or has not yet added these contributions to their profile.
It was automatically created by ResearchGate to create a record of this author's body of work. We create such pages to advance our goal of creating and maintaining the most comprehensive scientific repository possible. In doing so, we process publicly available (personal) data relating to the author as a member of the scientific community.
If you're a ResearchGate member, you can follow this page to keep up with this author's work.
If you are this author, and you don't want us to display this page anymore, please let us know.
It was automatically created by ResearchGate to create a record of this author's body of work. We create such pages to advance our goal of creating and maintaining the most comprehensive scientific repository possible. In doing so, we process publicly available (personal) data relating to the author as a member of the scientific community.
If you're a ResearchGate member, you can follow this page to keep up with this author's work.
If you are this author, and you don't want us to display this page anymore, please let us know.
Publications (8)
This paper considers an N period production planning problem in which a sequence of known demands d 1 , d 2 ,…, d N must be satisfied. The cost of production in period t consists of a setup cost K t plus a marginal cost per unit c t . The cost of carrying a unit of inventory into period t is h t − 1 . An optimal policy is a production plan that sat...
This paper presents algorithms for finding solutions and planning horizons to two related T period, one product, deterministic production problems with capacity constraints and penalty costs for unsatisfied demand. The algorithms are derived from an application of Lagrangian techniques to problems with inequality constraints.
Traducción de: Introductory management science Incluye bibliografía e índice
Traducción de: Introductory management science
Traducción de: Introductory management science Incluye índice
Citations
... We provide two examples of 0 -1 IP problems in Appendix B. Example 1 is the classical knapsack problem that can be found in various Operations Research textbooks (Gould et al., 1993, Hillier and Lieberman, 2021, Winston and Albright, 2019. Example 2 is a Set-Covering problem and similar problems can be found in several textbooks (Hillier and Lieberman, 2021, Winston, 2004, Taylor, 2018. ...
![[object Object]](https://i1.rgstatic.net/ii/profile.image/281138716266501-1444040101279_Q64/Gary-Eppen.jpg)
![[object Object]](https://i1.rgstatic.net/ii/profile.image/679074825523206-1538915463477_Q64/Charles-Schmidt-3.jpg)
... Deterministic Finite Piecewise linear convex Piecewise linear convex Piecewise linear convex Eppen and Gould (1968) [11] Deterministic Finite Strictly convex, increasing Linear Strictly convex, increasing Kunreuther and Morton (1973) [6] Deterministic Finite Piecewise linear, two pieces Convex N/A Kunreuther and Morton (1974) [7] Deterministic Finite Piecewise linear, two pieces Convex increas- ing Convex increas- ing Morton (1978) [12] Deterministic Infinite Weakly convex Weakly convex Weakly convex Smith and Zhang (1998) [31] Deterministic Infinite Convex Convex N/A Ghate and Smith (2009) [1] ...
... In particular, Wagner-Whitin algorithm can be efficiently solved in () On time [4]. A.Aggarwal and J.K.Park in 1993 [5] presented that a special 'Monge arrays' is applied to improve the performance of H.M.Wagner and T.M.Whitin algorithm with () On time and algorithm of G.D. Eppen, F.J. Gould and B.P. Pashigian in 1969 with ( log ) O n n time [6]. A. Federgruen and M. Tzur in 1991 proposed a simple forward algorithm which solves the general dynamic lot sizing (Wagner- Whitin model) in ( log ) O n n time while the well-known shortest path still runs this model with 2 () On time [7]. ...
... Programación Lineal: La programación lineal proporciona un ejemplo de lo que se conoce de manera más general como modelo de toma de decisiones con restricciones, también llamado modelo de optimización con restricciones (Eppen, Gould, Schmidt, Moore, & Weatherford, 2000). ...
... In fact, today, this technique is one of the most used tools for quantitative analysis. Immediate results can be seen without manipulating the real system [6]. ...
