-
作者：Adida, E; Perakis, G
作者单位：Massachusetts Institute of Technology (MIT); Massachusetts Institute of Technology (MIT)
摘要：In this paper, we present a robust optimization formulation for dealing with demand uncertainty in a dynamic pricing and inventory control problem for a make-to-stock manufacturing system. We consider a multi-product capacitated, dynamic setting. We introduce a demand-based fluid model where the demand is a linear function of the price, the inventory cost is linear, the production cost is an increasing strictly convex function of the production rate and all coefficients are time-dependent. A k...
-
作者：Cheung, KKH; Cunningham, WH; Tang, L
作者单位：Carleton University; University of Waterloo; Hong Kong Monetary Authority (HKMA)
摘要：Given an undirected graph G = (V, E) and three specified terminal nodes t(1), t(2), t(3), a 3-cut is a subset A of E such that no two terminals are in the same component of G\A. If a non-negative edge weight c(e) is specified for each e. E, the optimal 3-cut problem is to find a 3-cut of minimum total weight. This problem is NP-hard, and in fact, is max-SNP-hard. An approximation algorithm having performance guarantee 7/6 has recently been given by Calinescu, Karloff, and Rabani. It is based o...
-
作者：Rockafellar, R. Tyrrell; Uryasev, Stan; Zabarankin, Michael
作者单位：University of Washington; University of Washington Seattle; State University System of Florida; University of Florida; Stevens Institute of Technology
摘要：Optimality conditions are derived for problems of minimizing a general measure of deviation of a random variable, with special attention to situations where the random variable could be the rate of return from a portfolio of financial instruments. General measures of deviation go beyond standard deviation in satisfying axioms that do not demand symmetry between ups and downs. The optimality conditions are applied to characterize the generalized ``master funds'' which elsewhere have been develo...
-
作者：Kaul, Hemanshu; Jacobson, Sheldon H.
作者单位：University of Illinois System; University of Illinois Urbana-Champaign; University of Illinois System; University of Illinois Urbana-Champaign
摘要：The Kauffman NK model has been used in theoretical biology, physics and business organizations to model complex systems with interacting components. This paper presents new global optima results for the NK model by developing tools for handling dependency in the cases where K grows with N; this generalizes the previous work that focused on the analysis of the (independent) case K=N-1. A dependency graph is defined and studied to handle dependencies among underlying random variables in the NK m...
-
作者：Song, W; Zang, R
作者单位：Harbin Normal University; Chinese University of Hong Kong
摘要：This paper deals with bounded linear regularity, linear regularity and the strong conical hull intersection property (CHIP) of a collection of finitely many closed convex intersecting sets in Banach spaces. It is shown that, as in finite dimensional space setting (see [6]), the standard constraint qualification implies bounded linear regularity, which in turn yields the strong conical hull intersection property, and that the collection of closed convex sets {C-1, . . . ,C-n} is bounded linearl...
-
作者：Pflug, Georg Ch.
作者单位：University of Vienna
摘要：Measures of risk appear in two categories: Risk capital measures serve to determine the necessary amount of risk capital in order to avoid ruin if the outcomes of an economic activity are uncertain and their negative values may be interpreted as acceptability measures (safety measures). Pure risk measures (risk deviation measures) are natural generalizations of the standard deviation. While pure risk measures are typically convex, acceptability measures are typically concave. In both cases, th...
-
作者：Jansen, K
作者单位：University of Kiel
摘要：We propose an approximation algorithm for, the general max-min resource sharing problem with M nonnegative concave constraints on a convex set B. The algorithm is based on a Lagrangian decomposition method and it uses a c-approximation algorithm (called approximate block solver) for a simpler maximization problem over the convex set B. We show that our algorithm achieves within O( M(1nM + is an element of(-2) 1n is an element of(-1))) iterations or calls to the approximate block solver a solut...
-
作者：Wachter, A; Biegler, LT
作者单位：International Business Machines (IBM); IBM USA; Carnegie Mellon University
摘要：We present a primal-dual interior-point algorithm with a filter line-search method for nonlinear programming. Local and global convergence properties of this method were analyzed in previous work. Here we provide a comprehensive description of the algorithm, including the feasibility restoration phase for the filter method, second-order corrections, and inertia correction of the KKT matrix. Heuristics are also considered that allow faster performance. This method has been implemented in the IP...
-
作者：Fortz, B; Mahjoub, AR; McCormick, ST; Pesneau, P
作者单位：Universite Catholique Louvain; Universite Clermont Auvergne (UCA); Centre National de la Recherche Scientifique (CNRS); University of British Columbia
摘要：We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a ring) to which each edge belongs, does not exceed a given length K. We identify a class of inequalities, called cycle inequalities, valid for the problem and show that these inequalities together with the so-called cut inequalities yield an integer programming formulation of the problem in the space of the natural design variables. We then study the po...
-
作者：Frangioni, A; Gentile, C
作者单位：University of Pisa; Consiglio Nazionale delle Ricerche (CNR); Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti (IASI-CNR)
摘要：We show that the convex envelope of the objective function of Mixed-Integer Programming problems with a specific structure is the perspective function of the continuous part of the objective function. Using a characterization of the subdifferential of the perspective function, we derive perspective cuts, a family of valid inequalities for the problem. Perspective cuts can be shown to belong to the general family of disjunctive cuts, but they do not require the solution of a potentially costly ...
