-
作者：RYAN, SM; BEAN, JC; SMITH, RL
作者单位：University of Michigan System; University of Michigan
摘要：We study discrete infinite horizon optimization problems without the common assumption of a unique optimum. A method based on solution set convergence is employed for finding optimal initial decisions by solving finite horizon problems. This method is applicable to general discrete decision models that satisfy a weak reachability condition. The algorithm, together with a stopping rule, is applied to production planning and capacity expansion, and computational results are reported.
-
作者：SAHINIDIS, NV; GROSSMANN, IE
摘要：The problem of selecting processes and capacity expansion policies for a chemical complex consisting of continuous chemical processes can be formulated as a multiperiod, mixed integer linear programming (MILP) problem. Based on a variable disaggregation technique which exploits lot sizing substructures, we propose two reformulations of the conventional MILP model. The first one is an NLP reformulation which very quickly yields good suboptimal solutions. The second is an MILP reformulation for ...
-
作者：WAGELMANS, A; VANHOESEL, S; KOLEN, A
作者单位：Maastricht University; Hasselt University
摘要：We consider the n-period economic lot sizing problem, where the cost coefficients are not restricted in sign. In their seminal paper, H. M. Wagner and T. M. Whitin proposed an O(n2) algorithm for the special case of this problem, where the marginal production costs are equal in all periods and the unit holding costs are nonnegative. It is well known that their approach can also be used to solve the general problem, without affecting the complexity of the algorithm. In this paper, we present an...
-
作者：ZIPKIN, P
摘要：Over the past decade, optimization models have been widely used to help select bond portfolios. Several different formulations are popular. The purposes of this paper are to clarify the basic structures of the models, to explain the relationships among them, and to assess their strengths and weaknesses.
