AN INDEFINITE-QUADRATIC-PROGRAMMING MODEL FORA CONTINUOUS-PRODUCTION PROBLEM
|
|
- Ashlynn Owen
- 6 years ago
- Views:
Transcription
1 R734 Philips Res. Repts 25, ,1970 AN INDEFINITE-QUADRATIC-PROGRAMMING MODEL FORA CONTINUOUS-PRODUCTION PROBLEM by F. A. LOOTSMA and J. D. PEARSON Abstract A model is presented for a problem of scheduling the lengths of N production periods on one machine, which will manufacture q products. The problem is to choose production periods so as to minimize the sum of inventory costs for the q products in the presence of given demands. Mathematically, the problem is one of minimizing an indefinite quadratic function subject to linear constraints. A numerical example concludes the paper. 1. Definitions Suppose there are q products, and these have sales rates SI and production rates PI> i = 1,..., q. The products are to be produced on one machine according to a sequence denoted by a, a -tuple of integers ai' a2,..., a, such that at the jth production period a product al' ~ al ::::;;q, is being produced. If al = 0 then the machine is idle. Given the production sequence a, the activity of the machine can be represented by an activity matrix A = [al}] such that al} is the rate of increase of product i in period j. The elements of A are clearly given by (1.1) where Ol,k denotes the Kronecker delta. Finally, a convention is adopted that the machine is idle after each production period, i.e. a2j = 0; j = 1, 2,..., N, (1.2) a2}+ I =j::. 0; j = O, 1, 2,..., N - 1. (1.3) This allows the possibility of enforcing a changeover-time constraint. With two products and six production periods a machine schedule is shown in fig. 1. In this case the sequence a is given by (1, 0, 2, 0, 1, 0). There are three production periods and three idle periods. The activity matrix takes on the form PI-SI -si, -SI -SI PI-SI -SI ). -S2 -S2 P2-S2 -S2 -S2 -S2 (
2 PROGRAMMING FOR CONTINUOUS-PRODUCTION PROBLEM 245 Product 1 Product2 Fig Period Let tj be the length of the jth period (j = 1,..., ) and let VI be the initial inventory level for the ith product (i = 1,..., q). Using the activity matrix it is evident that the inventory for product i at the end of any period j is given by J (1.4) VI + ~ alk t k ; = 1,...,. k= 1 2. The constraints on the problem The problem at hand, due to Van den Meerendonk 2), is to find the optimum production lengths i I, i 3,, i -I, the optimum idle times (2' i 4,.-., i, and the optimum initial inventories VI'..., V q, so as to minimize total holding cost over one cycle; production of the q products is arranged in a given, cyclic production sequence a = (al'..., a ) which is repeated indefinitely. In ref. 2, this problem is part of a mixed integer-nonlinear programming problem to find an optimum sequence a, an optimum time schedule i = (il' i 2,, i ), and optimum initial inventories VI>..., v q with the same objective. The constraints on the problem are as follows. (a) All variables (production lengths, idle times, initial inventories) are nonnegative. Production must be such that one can always deliver from stock. (b) The inventory at the end of each cycle, for each product, is the inventory for the beginning of the next cycle. Over each cycle, production equals sales exactly. (c) The total cycle time is T units; T is a given quantity. In what follows we take t and V to denote vectors with components ti,..., t and VI>, Vq, respectively. Mathematically, the restrictions may now be formulated in the following way. (a) The inventory for a product is clearly lowest just before the start of a production period. There are N production periods and for the first one the initial inventory is known and equal to VUI' constrained to be nonnegative. Hence, there are N - 1 additional constraints: the inventory to be produced in period 2j + 1, designated giv,t) is nonnegative (j = 1, 2,..., N -1). Thus,
3 246 F. A. LOOTSMA and J. D.PEARSON 2j gj(v,t) = Vm + ~ amk tk ~ 0; m = 0"2j+1; j = 1,2,..., N -1. (2.1) k=l (b) The inventory at the end of the cycle of periods is given by V, + ~ a,k tk; i = 1,..., q. k=1 Because the next cycle starts with inventory v, for product i, the excess of production over sales given by the term must be zero. However, it is sometimes advantageous to be able to replace an equality constraint by an inequality constraint so as to enlarge the initial set of feasible solutions. In this case note that if the production of product i exceeds sales, then production can always be reduced feasibly by decreasing the length ofthe last production time for product i and increasing the following slack time. Since this procedure reduces the inventory cost for product i, the set of q inequality constraints gn+i(v,t) = ~ a,k tk ;;?; 0; i = 1,..., q, k=1 (2.2) will suffice to enforce the equality of production and sales, giving inventory v, at the end of each cycle as desired. (c) Finally, the total length of the N production periods and the N idle periods must be T time units, whence ~ t j = T. j= 1 (2.3) This completes the description of the constraints, which are clearly all linear. 3. The objective function Suppose that the holding cost for the inventory of product i is C, per unit, per unit time. The total holding cost is C, times the area under the inventory. curve (see fig. 2) and this can be computed in terms of the t/s as follows. At the start of the jth period the inventory W'J of product i can be written as j-l W'J = V, + ~ a,k tk. k=l (3.1) After period j it stands (see fig. 3) at level B (if al) < 0, product i not produced) or at level A (if al) > 0, product i is produced in period j). It follows
4 PROGRAMMING FOR CONTINUOUS-PRODUCTION PROBLEM 247 Inventory product i r Inventory ""dl' ; tj tj+1 tj+2 tj+3 tj+4 tj+5 Fig.2. Fig.3. I. tj from the diagram that the area of the figure of width tj, under either OB or OA, is given by j-1~ (v, + ~ a'k tk) tj k=1 +!al} ti, so that the total area and cost over periods of production and idle time is given by j-i C, ~ u-. + ~ a,k tk) tj + tal} ti] j= 1 k= 1 The cost of holding q products is the sum over i of the terms above. Thus, the objective function can be written as '" j-i f(v,t) = ~ c, ~ [(v, + ~ a'k Ik) tj + tal} t/j. '=1 j=l k=1 (3.2), This is a quadratic function. We demonstrate by an example that its matrix of second-order partial derivatives is indefinite. The quantities WI} defined by (3.1) have derivatives ()WI} _ f all' I ~j - 1, bi; - to, t» j -1, ()WI} --= 011' ()V,
5 248 F. A. LOOTSMA and J. D. PEARSON In terms of wij the objective function takes on the form q j(v,/) = ~ Cl ~ (wij IJ + tal) 1/), 1=1 J=1 from which the derivatives can be calculated. This yields "Dj -= Cl ~ IJ, "Dvl J=1 "Dj a - = ~ Cl (Wil + all 2: Ik). "DI, 1=1 k=l Finally, the second-order derivatives are "D2j ---=Ch "Dv i "DIJ "D2j q ---=~Clall; k :»]. "DIk "Dt l 1=1 For q = 2 and N = 2 the resulting matrix of second-order partial derivatives has the structure 2: Cl all 2: Cl all ~ Cl all ~ Cl all Cl C2 2: Cl all 2: Cl al2 ~ Cl al2 2: Cl al2 Cl C2 2: Cl all ~ Cl al2 ~ Cl al3 ~ Cl al3 Cl C2 2: Cl all 2: Cl al2 ~ Cl al3 2: Cl al4 Cl C o 0 o 0 The activity matrix A can, for instance, be written as ( P1 -SI -SI -St -SI). -S2 -S2 P2 -S2 -S2 Let us choose SI = S2 = 1, P1 = P2 = 4, and Cl = C2 = 1. Then 2: Cl all = 2, 2: Cl al2 = -2, 2: Cl al3 = 2, 2: Cl al4 = -2. It can then be verified that the above matrix of second-order partial derivatives must be indefinite (its diagonal elements alternate in sign). 4. Problem formulation The final description of the problem is: given the number q of products, the number N ofproduction periods, the cycle time T, the sequence a = (al'..., a), sales rates SI> i = 1,...,q, production rates Ph i = 1,..., q, and hold- ".
6 PROGRAMMING FOR CONTINUOUS-PRODUCTION PROBLEM 249 ing costs Cl> i = 1,..., q per unit and per unit time, minimize the total holding cost q j-l f(v,t) = 1~1 C, j~1 [(VI +k~1 a,k tk) tj + t al) III subject to the constraints V, ~ 0, i = 1,, q, Ij ~ 0, j = 1,,, 2j giv,t) = Vm + ~ amk Ik ~ 0, m = (121+ 1, j = 1,2,..., N - 1, k= 1 gn(v,/) = ~ Ij-T= 0, j=1 gn+i(v,/) = ~ al) tj ~ 0, i = 1,..., q. j=1 This is an indefinite-quadratic-programming problem in + q variables and N + q constraints. 5. Kubn- Tucker relations Turning to the derivatives of the constraints we find the following. For the gj' j = 1, 2,..., N - 1, it must be true that For the time constraint we have è)gj = ~ami' I:::;; 2j, m = (121+1' è)/,? 0, I > 2j, è)gj = ~1, i = (121+1> è)v, (0, i =1= (121+1' è)gn - = 1, j = 1, 2,...,, è)tj è)gn - = 0, i = 1,..., q. è)v, For the initial-inventory constraints we find è)gn+1 -- = al), i = 1,...,q, j = 1, 2,...,, è)l j è)gn = 0, l = 1,...,q, k = 1,..., q. è)vk Let (v,f) denote a local minimum solution of the problem. The Kuhn-Tucker
7 250 F. A. LOOTSMA and J. D. PEARSON conditions for optimality dictate that under first-order, regularity conditions (satisfied here since the constraints are linear) there exist multipliers À1>, À N + q such that ÀJ ~ 0, j = 1,..., N - 1, N + 1,..., N + q, 'öf (v, f) N-1 'ög J q --- ~ ~ - ÀJ + AN + ~ a,k AN+h k = 1,2,...,, 'öt k J= 1'öt k 1= 1 'öf(v,f) N ~ ~ ÀJ (j'n" m = 0'2J+1> i = 1,..., q. 'öv, J=1 Using the last q equations and the complementary slack relations, then if V, ~ we must have bf (v,f) N = C, ~ ik = C, T = ~ ÀJ (j,m' 'öv, k= 1 J= 1 Thus, for example, if product i is produced in the periods 2j + 1 and 2k + 1, and the initial inventory is non-zero, then AJ + Àk = C, T. This provides a simple optimality check. It is not clear that the Kuhn- Tucker conditions provide further results without additional simplifying assumptions, such as assuming that all the constraints are binding. 6. Numerical example The general case of the problem has been programmed and the results to follow were generated by a test problem obtained by the substitutions N = 12, q = 6, T = 1; 0' = (1,0,2,0,5,0,4,0,6,0,4,0,6,0,5,0,1,0,2,0,3,0,2,0); S, = 1; i = 1,, 6; P, = 30; i = 1,,6; C,= i; i=i,,6. The initial (feasible) solution was taken to be tj = 1/( - 2); j = 1,2,..., ; V, = 1; i = 1,..., q. With these values the total holding cost can be calculated to be fa = units. The method employed for solving the problem is the logarithmic barrierfunction technique (see Lootsma 1) and Pearson 4». Sequential unconstrained
8 PROGRAMMING FOR CONTINUOUS-PRODUCTION PROBLEM 251 TABLE I Computer solution of production problem. Production periods, idle times, arid initial inventories variable production periods idle times initial inventories f v
9 252 F. A. LOOTSMA and J. D. PEARSON TABLE II Computer solution of production problem. Lagrangian multipliers multiplier corresponding to ' intermediate inventories ~O.... ~.~J ~.~.:~.~~.~.~. total time = T excess production over sales ~ minimization was carried out with Newton's method and with the DFP algorithm due to Davidon, Fletcher and Powell. For the problem at hand Newton's method appears to be much more efficient. After 21 minimization cycles (starting with r = 1 and a reduction factor of 0'5) and 79 iterations it produced the results listed in tables I and II; the corresponding value of the objective function is j(v,f) = units. All the constraints are active at this solution. A similar, slightly less accurate result was produced b~ the DFP algorithm in 7 minimization cycles and 400
10 PROGRAMMING FOR CONTINUOUS-PRODUCTION PROBLEM 253 iterations (starting with r = 0 1 and a reduction factor of 10-1/3 ). The optimality checks for the multiplier values listed. in table II become Al + A9 + All = 1'99982, AlO = 2'99999, A3 + A5 = 3'99994, }'2 A7 = 4'99991, A4 + A6 = 5'99995, C2 = 2, C3 = 3, C4.= 4, Cs = 5, C6 = 6. A word or two of explanation is included. The production times ib i 3, are all non-zero and these represent the fractions of the total time, which are used for production. The slack times i 2, i 4, are mostly zero, with one or two exceptions. Some of the slacks are large, but this only represents the excess of total time over production time required by the demand. The minimization algorithm has the effect of moving the six inventory graphs, similar to fig. 2, sideways relative to one another. The excess time is forced into one or more of the slacks, rather than into them all. The multipliers are the sensitivities of the final solution cost to small violations of the constraints, giving directly the effect of the constraint on the problem. The solution shows that the optimum found corresponds to having the inventory for each product zero, just before the start of the production period. Thus it can be seen that the 11 inventory constraints are all binding. Using this fact the production periods can be eliminated from the problem. If the total time is contracted to equal the production time, then the slack periods will all be zero and the problem can be solved directly for the production periods without any optimization. Finally, it is worth remarking that this problem is of interest because it shows that (a) indefinite quadratic programs actually occur in reallife; it must be remarked that other problems of this kind do exist; the graph of "waiting time" in a traffic network as a function of the red/green phases leads to a sawtooth shape similar to the inventory here; this suggests another possible application; (b) conventional methods will find a solution, despite the violation of many of their basic assumptions; it need not, however, be a global solution; (c) general methods can be successfully applied to problems for which special methods were designed (see Murray 3)); in a later phase of the research one could resort to such a special method, if the problem has to be solved rapidly and frequently; in an earlier stage, if such a special programme is not available, a general programme may be helpful. Eindhoven, June 1970
11 254 F. A. LOOTSMA and J. D. PEARSON REFERENCES 1) F. A. Lootsma, Boundary properties of.penalty functions for constrained minimization, Philips Res. Repts Suppl. 1970, No ) H. W. van den Meerendonk, A multi-product planning problem, Thesis (in Dutch, with a summary in English) to be presented at the Delft Technological University, ) W. Murray, Indefinite quadratic programming, National Physical Laboratory, Teddington (UK), April ) J. D. Pearson, A manual.for SUMT 70, to appear shortly.
More on Lagrange multipliers
More on Lagrange multipliers CE 377K April 21, 2015 REVIEW The standard form for a nonlinear optimization problem is min x f (x) s.t. g 1 (x) 0. g l (x) 0 h 1 (x) = 0. h m (x) = 0 The objective function
More informationThe Dual Simplex Algorithm
p. 1 The Dual Simplex Algorithm Primal optimal (dual feasible) and primal feasible (dual optimal) bases The dual simplex tableau, dual optimality and the dual pivot rules Classical applications of linear
More informationAlgorithms for Constrained Optimization
1 / 42 Algorithms for Constrained Optimization ME598/494 Lecture Max Yi Ren Department of Mechanical Engineering, Arizona State University April 19, 2015 2 / 42 Outline 1. Convergence 2. Sequential quadratic
More informationMultidisciplinary System Design Optimization (MSDO)
Multidisciplinary System Design Optimization (MSDO) Numerical Optimization II Lecture 8 Karen Willcox 1 Massachusetts Institute of Technology - Prof. de Weck and Prof. Willcox Today s Topics Sequential
More informationA Simplified Lagrangian Method for the Solution of Non-linear Programming Problem
Chapter 7 A Simplified Lagrangian Method for the Solution of Non-linear Programming Problem 7.1 Introduction The mathematical modelling for various real world problems are formulated as nonlinear programming
More informationNonlinear Programming and the Kuhn-Tucker Conditions
Nonlinear Programming and the Kuhn-Tucker Conditions The Kuhn-Tucker (KT) conditions are first-order conditions for constrained optimization problems, a generalization of the first-order conditions we
More informationConstrained Optimization
1 / 22 Constrained Optimization ME598/494 Lecture Max Yi Ren Department of Mechanical Engineering, Arizona State University March 30, 2015 2 / 22 1. Equality constraints only 1.1 Reduced gradient 1.2 Lagrange
More informationIn the original knapsack problem, the value of the contents of the knapsack is maximized subject to a single capacity constraint, for example weight.
In the original knapsack problem, the value of the contents of the knapsack is maximized subject to a single capacity constraint, for example weight. In the multi-dimensional knapsack problem, additional
More informationISM206 Lecture Optimization of Nonlinear Objective with Linear Constraints
ISM206 Lecture Optimization of Nonlinear Objective with Linear Constraints Instructor: Prof. Kevin Ross Scribe: Nitish John October 18, 2011 1 The Basic Goal The main idea is to transform a given constrained
More informationIn view of (31), the second of these is equal to the identity I on E m, while this, in view of (30), implies that the first can be written
11.8 Inequality Constraints 341 Because by assumption x is a regular point and L x is positive definite on M, it follows that this matrix is nonsingular (see Exercise 11). Thus, by the Implicit Function
More informationNONLINEAR. (Hillier & Lieberman Introduction to Operations Research, 8 th edition)
NONLINEAR PROGRAMMING (Hillier & Lieberman Introduction to Operations Research, 8 th edition) Nonlinear Programming g Linear programming has a fundamental role in OR. In linear programming all its functions
More informationSTATIC LECTURE 4: CONSTRAINED OPTIMIZATION II - KUHN TUCKER THEORY
STATIC LECTURE 4: CONSTRAINED OPTIMIZATION II - KUHN TUCKER THEORY UNIVERSITY OF MARYLAND: ECON 600 1. Some Eamples 1 A general problem that arises countless times in economics takes the form: (Verbally):
More informationConstrained optimization: direct methods (cont.)
Constrained optimization: direct methods (cont.) Jussi Hakanen Post-doctoral researcher jussi.hakanen@jyu.fi Direct methods Also known as methods of feasible directions Idea in a point x h, generate a
More informationIntroduction to Mathematical Programming IE406. Lecture 10. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 10 Dr. Ted Ralphs IE406 Lecture 10 1 Reading for This Lecture Bertsimas 4.1-4.3 IE406 Lecture 10 2 Duality Theory: Motivation Consider the following
More informationLecture 10: Linear programming. duality. and. The dual of the LP in standard form. maximize w = b T y (D) subject to A T y c, minimize z = c T x (P)
Lecture 10: Linear programming duality Michael Patriksson 19 February 2004 0-0 The dual of the LP in standard form minimize z = c T x (P) subject to Ax = b, x 0 n, and maximize w = b T y (D) subject to
More information0.1 O. R. Katta G. Murty, IOE 510 Lecture slides Introductory Lecture. is any organization, large or small.
0.1 O. R. Katta G. Murty, IOE 510 Lecture slides Introductory Lecture Operations Research is the branch of science dealing with techniques for optimizing the performance of systems. System is any organization,
More informationI.3. LMI DUALITY. Didier HENRION EECI Graduate School on Control Supélec - Spring 2010
I.3. LMI DUALITY Didier HENRION henrion@laas.fr EECI Graduate School on Control Supélec - Spring 2010 Primal and dual For primal problem p = inf x g 0 (x) s.t. g i (x) 0 define Lagrangian L(x, z) = g 0
More informationLINEAR PROGRAMMING: A GEOMETRIC APPROACH. Copyright Cengage Learning. All rights reserved.
3 LINEAR PROGRAMMING: A GEOMETRIC APPROACH Copyright Cengage Learning. All rights reserved. 3.4 Sensitivity Analysis Copyright Cengage Learning. All rights reserved. Sensitivity Analysis In this section,
More informationPenalty and Barrier Methods General classical constrained minimization problem minimize f(x) subject to g(x) 0 h(x) =0 Penalty methods are motivated by the desire to use unconstrained optimization techniques
More informationOn fast trust region methods for quadratic models with linear constraints. M.J.D. Powell
DAMTP 2014/NA02 On fast trust region methods for quadratic models with linear constraints M.J.D. Powell Abstract: Quadratic models Q k (x), x R n, of the objective function F (x), x R n, are used by many
More informationCONSTRAINED NONLINEAR PROGRAMMING
149 CONSTRAINED NONLINEAR PROGRAMMING We now turn to methods for general constrained nonlinear programming. These may be broadly classified into two categories: 1. TRANSFORMATION METHODS: In this approach
More informationSeminars on Mathematics for Economics and Finance Topic 5: Optimization Kuhn-Tucker conditions for problems with inequality constraints 1
Seminars on Mathematics for Economics and Finance Topic 5: Optimization Kuhn-Tucker conditions for problems with inequality constraints 1 Session: 15 Aug 2015 (Mon), 10:00am 1:00pm I. Optimization with
More informationEcon Slides from Lecture 14
Econ 205 Sobel Econ 205 - Slides from Lecture 14 Joel Sobel September 10, 2010 Theorem ( Lagrange Multipliers ) Theorem If x solves max f (x) subject to G(x) = 0 then there exists λ such that Df (x ) =
More information6.1 Matrices. Definition: A Matrix A is a rectangular array of the form. A 11 A 12 A 1n A 21. A 2n. A m1 A m2 A mn A 22.
61 Matrices Definition: A Matrix A is a rectangular array of the form A 11 A 12 A 1n A 21 A 22 A 2n A m1 A m2 A mn The size of A is m n, where m is the number of rows and n is the number of columns The
More informationConstrained Optimization. Unconstrained Optimization (1)
Constrained Optimization Unconstrained Optimization (Review) Constrained Optimization Approach Equality constraints * Lagrangeans * Shadow prices Inequality constraints * Kuhn-Tucker conditions * Complementary
More informationOn Synchronous Variable Length Coding for Discrete Noiseless Chrannels
INFORMATION AND CONTROL 15, 155--164 (1969) On Synchronous Variable Length Coding for Discrete Noiseless Chrannels P. A. FRANASZEK IBM Watson Research Center, Yorktown Heights, New York A method is presented
More informationSequential pairing of mixed integer inequalities
Sequential pairing of mixed integer inequalities Yongpei Guan, Shabbir Ahmed, George L. Nemhauser School of Industrial & Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta,
More informationChapter 3. Antimagic Gl'aphs
Chapter 3 Antimagic Gl'aphs CHAPTER III ANTIMAGIC GRAPHS 3.1 Introduction In 1970 Kotzig and Rosa [81] defined the magic labeling of a graph G as a bijection f from VuE to {1,2,... IV u EI } such that
More informationOptimization. Charles J. Geyer School of Statistics University of Minnesota. Stat 8054 Lecture Notes
Optimization Charles J. Geyer School of Statistics University of Minnesota Stat 8054 Lecture Notes 1 One-Dimensional Optimization Look at a graph. Grid search. 2 One-Dimensional Zero Finding Zero finding
More information4. Duality Duality 4.1 Duality of LPs and the duality theorem. min c T x x R n, c R n. s.t. ai Tx = b i i M a i R n
2 4. Duality of LPs and the duality theorem... 22 4.2 Complementary slackness... 23 4.3 The shortest path problem and its dual... 24 4.4 Farkas' Lemma... 25 4.5 Dual information in the tableau... 26 4.6
More information5 Handling Constraints
5 Handling Constraints Engineering design optimization problems are very rarely unconstrained. Moreover, the constraints that appear in these problems are typically nonlinear. This motivates our interest
More informationby Al ok Das Dissertation submitted to the Faculty of the in partial fulfillment of the requirements for the degree of
AN ACTIVE-CONSTRAINT LOGIC FOR NONLINEAR PROGRAMMING by Al ok Das Dissertation submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of the requirements
More informationFriday, September 21, Flows
Flows Building evacuation plan people to evacuate from the offices corridors and stairways capacity 10 10 5 50 15 15 15 60 60 50 15 10 60 10 60 15 15 50 For each person determine the path to follow to
More informationSupport Vector Machines: Maximum Margin Classifiers
Support Vector Machines: Maximum Margin Classifiers Machine Learning and Pattern Recognition: September 16, 2008 Piotr Mirowski Based on slides by Sumit Chopra and Fu-Jie Huang 1 Outline What is behind
More informationOptimization Problems with Constraints - introduction to theory, numerical Methods and applications
Optimization Problems with Constraints - introduction to theory, numerical Methods and applications Dr. Abebe Geletu Ilmenau University of Technology Department of Simulation and Optimal Processes (SOP)
More informationThe Kuhn-Tucker Problem
Natalia Lazzati Mathematics for Economics (Part I) Note 8: Nonlinear Programming - The Kuhn-Tucker Problem Note 8 is based on de la Fuente (2000, Ch. 7) and Simon and Blume (1994, Ch. 18 and 19). The Kuhn-Tucker
More informationNonlinear Optimization: What s important?
Nonlinear Optimization: What s important? Julian Hall 10th May 2012 Convexity: convex problems A local minimizer is a global minimizer A solution of f (x) = 0 (stationary point) is a minimizer A global
More information- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs
LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs
More informationLecture 18: Optimization Programming
Fall, 2016 Outline Unconstrained Optimization 1 Unconstrained Optimization 2 Equality-constrained Optimization Inequality-constrained Optimization Mixture-constrained Optimization 3 Quadratic Programming
More informationOptimality Conditions
Chapter 2 Optimality Conditions 2.1 Global and Local Minima for Unconstrained Problems When a minimization problem does not have any constraints, the problem is to find the minimum of the objective function.
More informationNonlinear Programming (Hillier, Lieberman Chapter 13) CHEM-E7155 Production Planning and Control
Nonlinear Programming (Hillier, Lieberman Chapter 13) CHEM-E7155 Production Planning and Control 19/4/2012 Lecture content Problem formulation and sample examples (ch 13.1) Theoretical background Graphical
More informationHandout 1: Introduction to Dynamic Programming. 1 Dynamic Programming: Introduction and Examples
SEEM 3470: Dynamic Optimization and Applications 2013 14 Second Term Handout 1: Introduction to Dynamic Programming Instructor: Shiqian Ma January 6, 2014 Suggested Reading: Sections 1.1 1.5 of Chapter
More informationJanuary 29, Introduction to optimization and complexity. Outline. Introduction. Problem formulation. Convexity reminder. Optimality Conditions
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis Dimensioning II Department of Electronics Communications Engineering Tampere University of Technology, Tampere, Finl January 29, 2014 1 2 3
More informationCHAPTER 2. The Simplex Method
CHAPTER 2 The Simplex Method In this chapter we present the simplex method as it applies to linear programming problems in standard form. 1. An Example We first illustrate how the simplex method works
More informationThe simplex algorithm
The simplex algorithm The simplex algorithm is the classical method for solving linear programs. Its running time is not polynomial in the worst case. It does yield insight into linear programs, however,
More informationA Dynamic model for requirements planning with application to supply chain optimization
This summary presentation is based on: Graves, Stephen, D.B. Kletter and W.B. Hetzel. "A Dynamic Model for Requirements Planning with Application to Supply Chain Optimization." Operations Research 46,
More informationMachine Learning. Support Vector Machines. Manfred Huber
Machine Learning Support Vector Machines Manfred Huber 2015 1 Support Vector Machines Both logistic regression and linear discriminant analysis learn a linear discriminant function to separate the data
More informationA FINITE BASIS THEOREM FOR PACKING BOXES WITH BRICKS*)
R912 Philips Res. Repts 30,337*-343*,1975 Issue in honour of C. J. Bouwkamp A FINITE BASIS THEOREM FOR PACKING BOXES WITH BRICKS*) by N. G. de BRUIJN Technological University Eindhoven Eindhoven, The Netherlands
More informationReal power-system economic dispatch using a variable weights linear programming method
Open Access Journal Journal of Power Technologies 95 (1) (2015) 34 39 journal homepage:papers.itc.pw.edu.pl Real power-system economic dispatch using a variable weights linear programming method M. Rahli,
More informationFIN 550 Practice Exam Answers. A. Linear programs typically have interior solutions.
FIN 550 Practice Exam Answers Phil Dybvig. True-False 25 points A. Linear programs typically have interior solutions. False. Unless the objective is zero, all solutions are at the boundary. B. A local
More informationLecture V. Numerical Optimization
Lecture V Numerical Optimization Gianluca Violante New York University Quantitative Macroeconomics G. Violante, Numerical Optimization p. 1 /19 Isomorphism I We describe minimization problems: to maximize
More informationStructural and Multidisciplinary Optimization. P. Duysinx and P. Tossings
Structural and Multidisciplinary Optimization P. Duysinx and P. Tossings 2018-2019 CONTACTS Pierre Duysinx Institut de Mécanique et du Génie Civil (B52/3) Phone number: 04/366.91.94 Email: P.Duysinx@uliege.be
More informationDiscrete (and Continuous) Optimization WI4 131
Discrete (and Continuous) Optimization WI4 131 Kees Roos Technische Universiteit Delft Faculteit Electrotechniek, Wiskunde en Informatica Afdeling Informatie, Systemen en Algoritmiek e-mail: C.Roos@ewi.tudelft.nl
More informationConvex Optimization & Lagrange Duality
Convex Optimization & Lagrange Duality Chee Wei Tan CS 8292 : Advanced Topics in Convex Optimization and its Applications Fall 2010 Outline Convex optimization Optimality condition Lagrange duality KKT
More informationOptimization and Root Finding. Kurt Hornik
Optimization and Root Finding Kurt Hornik Basics Root finding and unconstrained smooth optimization are closely related: Solving ƒ () = 0 can be accomplished via minimizing ƒ () 2 Slide 2 Basics Root finding
More informationMotivation. Lecture 2 Topics from Optimization and Duality. network utility maximization (NUM) problem:
CDS270 Maryam Fazel Lecture 2 Topics from Optimization and Duality Motivation network utility maximization (NUM) problem: consider a network with S sources (users), each sending one flow at rate x s, through
More informationNonlinear Programming
Nonlinear Programming Kees Roos e-mail: C.Roos@ewi.tudelft.nl URL: http://www.isa.ewi.tudelft.nl/ roos LNMB Course De Uithof, Utrecht February 6 - May 8, A.D. 2006 Optimization Group 1 Outline for week
More informationMore First-Order Optimization Algorithms
More First-Order Optimization Algorithms Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye Chapters 3, 8, 3 The SDM
More informationOn Sparse and Symmetric Matrix Updating
MATHEMATICS OF COMPUTATION, VOLUME 31, NUMBER 140 OCTOBER 1977, PAGES 954-961 On Sparse and Symmetric Matrix Updating Subject to a Linear Equation By Ph. L. Toint* Abstract. A procedure for symmetric matrix
More informationLinear Programming Duality P&S Chapter 3 Last Revised Nov 1, 2004
Linear Programming Duality P&S Chapter 3 Last Revised Nov 1, 2004 1 In this section we lean about duality, which is another way to approach linear programming. In particular, we will see: How to define
More informationCE 191: Civil & Environmental Engineering Systems Analysis. LEC 17 : Final Review
CE 191: Civil & Environmental Engineering Systems Analysis LEC 17 : Final Review Professor Scott Moura Civil & Environmental Engineering University of California, Berkeley Fall 2014 Prof. Moura UC Berkeley
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 13 Overview of nonlinear programming. Ann-Brith Strömberg
MVE165/MMG631 Overview of nonlinear programming Ann-Brith Strömberg 2015 05 21 Areas of applications, examples (Ch. 9.1) Structural optimization Design of aircraft, ships, bridges, etc Decide on the material
More informationINTERIOR-POINT METHODS FOR NONCONVEX NONLINEAR PROGRAMMING: COMPLEMENTARITY CONSTRAINTS
INTERIOR-POINT METHODS FOR NONCONVEX NONLINEAR PROGRAMMING: COMPLEMENTARITY CONSTRAINTS HANDE Y. BENSON, DAVID F. SHANNO, AND ROBERT J. VANDERBEI Operations Research and Financial Engineering Princeton
More informationKarush-Kuhn-Tucker Conditions. Lecturer: Ryan Tibshirani Convex Optimization /36-725
Karush-Kuhn-Tucker Conditions Lecturer: Ryan Tibshirani Convex Optimization 10-725/36-725 1 Given a minimization problem Last time: duality min x subject to f(x) h i (x) 0, i = 1,... m l j (x) = 0, j =
More informationF 1 F 2 Daily Requirement Cost N N N
Chapter 5 DUALITY 5. The Dual Problems Every linear programming problem has associated with it another linear programming problem and that the two problems have such a close relationship that whenever
More informationNumerical Analysis of Electromagnetic Fields
Pei-bai Zhou Numerical Analysis of Electromagnetic Fields With 157 Figures Springer-Verlag Berlin Heidelberg New York London Paris Tokyo Hong Kong Barcelona Budapest Contents Part 1 Universal Concepts
More informationCHAPTER 1-2: SHADOW PRICES
Essential Microeconomics -- CHAPTER -: SHADOW PRICES An intuitive approach: profit maimizing firm with a fied supply of an input Shadow prices 5 Concave maimization problem 7 Constraint qualifications
More informationConstrained Optimization and Lagrangian Duality
CIS 520: Machine Learning Oct 02, 2017 Constrained Optimization and Lagrangian Duality Lecturer: Shivani Agarwal Disclaimer: These notes are designed to be a supplement to the lecture. They may or may
More informationChapter 30 Design and Analysis of
Chapter 30 Design and Analysis of 2 k DOEs Introduction This chapter describes design alternatives and analysis techniques for conducting a DOE. Tables M1 to M5 in Appendix E can be used to create test
More informationRelation of Pure Minimum Cost Flow Model to Linear Programming
Appendix A Page 1 Relation of Pure Minimum Cost Flow Model to Linear Programming The Network Model The network pure minimum cost flow model has m nodes. The external flows given by the vector b with m
More informationMATH2070 Optimisation
MATH2070 Optimisation Nonlinear optimisation with constraints Semester 2, 2012 Lecturer: I.W. Guo Lecture slides courtesy of J.R. Wishart Review The full nonlinear optimisation problem with equality constraints
More informationHow to Characterize Solutions to Constrained Optimization Problems
How to Characterize Solutions to Constrained Optimization Problems Michael Peters September 25, 2005 1 Introduction A common technique for characterizing maximum and minimum points in math is to use first
More informationLemma 8: Suppose the N by N matrix A has the following block upper triangular form:
17 4 Determinants and the Inverse of a Square Matrix In this section, we are going to use our knowledge of determinants and their properties to derive an explicit formula for the inverse of a square matrix
More information56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker
56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker Answer all of Part One and two (of the four) problems of Part Two Problem: 1 2 3 4 5 6 7 8 TOTAL Possible: 16 12 20 10
More informationHomework Set #6 - Solutions
EE 15 - Applications of Convex Optimization in Signal Processing and Communications Dr Andre Tkacenko JPL Third Term 11-1 Homework Set #6 - Solutions 1 a The feasible set is the interval [ 4] The unique
More informationOptimization Methods
Optimization Methods Decision making Examples: determining which ingredients and in what quantities to add to a mixture being made so that it will meet specifications on its composition allocating available
More informationEND3033 Operations Research I Sensitivity Analysis & Duality. to accompany Operations Research: Applications and Algorithms Fatih Cavdur
END3033 Operations Research I Sensitivity Analysis & Duality to accompany Operations Research: Applications and Algorithms Fatih Cavdur Introduction Consider the following problem where x 1 and x 2 corresponds
More informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 7: Duality and applications Prof. John Gunnar Carlsson September 29, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 29, 2010 1
More informationWeek 15-16: Combinatorial Design
Week 15-16: Combinatorial Design May 8, 2017 A combinatorial design, or simply a design, is an arrangement of the objects of a set into subsets satisfying certain prescribed properties. The area of combinatorial
More informationAbstract. 1 Introduction
The max-plus algebra approach to railway timetable design R.M.P. Goverde Faculty of Civil Engineering and Geo Sciences, Delft University o/ Tec/mob^ f 0 Boz ^% ggoo G^ De% 7/^e A^e^er/a^^ email: goverde@ct.tudelft.nl
More informationA Concise Pivoting-Based Algorithm for Linear Programming
www.ij-ams.org International Journal of Advances in Management Science (IJ-AMS) Volume 3 Issue 3, August 204 DOI: 0.4355/ijams.204.0303.02 A Concise Pivoting-Based Algorithm for Linear Programming Zhongzhen
More informationNumerical optimization
Numerical optimization Lecture 4 Alexander & Michael Bronstein tosca.cs.technion.ac.il/book Numerical geometry of non-rigid shapes Stanford University, Winter 2009 2 Longest Slowest Shortest Minimal Maximal
More informationFIN 550 Exam answers. A. Every unconstrained problem has at least one interior solution.
FIN 0 Exam answers Phil Dybvig December 3, 0. True-False points A. Every unconstrained problem has at least one interior solution. False. An unconstrained problem may not have any solution at all. For
More informationCONVERGENCE ANALYSIS OF AN INTERIOR-POINT METHOD FOR NONCONVEX NONLINEAR PROGRAMMING
CONVERGENCE ANALYSIS OF AN INTERIOR-POINT METHOD FOR NONCONVEX NONLINEAR PROGRAMMING HANDE Y. BENSON, ARUN SEN, AND DAVID F. SHANNO Abstract. In this paper, we present global and local convergence results
More informationTopic one: Production line profit maximization subject to a production rate constraint. c 2010 Chuan Shi Topic one: Line optimization : 22/79
Topic one: Production line profit maximization subject to a production rate constraint c 21 Chuan Shi Topic one: Line optimization : 22/79 Production line profit maximization The profit maximization problem
More informationSIMPLEX LIKE (aka REDUCED GRADIENT) METHODS. REDUCED GRADIENT METHOD (Wolfe)
19 SIMPLEX LIKE (aka REDUCED GRADIENT) METHODS The REDUCED GRADIENT algorithm and its variants such as the CONVEX SIMPLEX METHOD (CSM) and the GENERALIZED REDUCED GRADIENT (GRG) algorithm are approximation
More informationLecture: Algorithms for LP, SOCP and SDP
1/53 Lecture: Algorithms for LP, SOCP and SDP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2018.html wenzw@pku.edu.cn Acknowledgement:
More informationIE652 - Chapter 10. Assumptions. Single Machine Scheduling
IE652 - Chapter 10 Single Machine Scheduling 1 Assumptions All jobs are processed on a single machine Release time of each job is 0 Processing times are known with certainty Scheduling Sequencing in this
More informationAppendix A Taylor Approximations and Definite Matrices
Appendix A Taylor Approximations and Definite Matrices Taylor approximations provide an easy way to approximate a function as a polynomial, using the derivatives of the function. We know, from elementary
More informationExtreme Abridgment of Boyd and Vandenberghe s Convex Optimization
Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization Compiled by David Rosenberg Abstract Boyd and Vandenberghe s Convex Optimization book is very well-written and a pleasure to read. The
More informationDuality of LPs and Applications
Lecture 6 Duality of LPs and Applications Last lecture we introduced duality of linear programs. We saw how to form duals, and proved both the weak and strong duality theorems. In this lecture we will
More informationNumerical optimization. Numerical optimization. Longest Shortest where Maximal Minimal. Fastest. Largest. Optimization problems
1 Numerical optimization Alexander & Michael Bronstein, 2006-2009 Michael Bronstein, 2010 tosca.cs.technion.ac.il/book Numerical optimization 048921 Advanced topics in vision Processing and Analysis of
More informationEcon 504, Lecture 1: Transversality and Stochastic Lagrange Multipliers
ECO 504 Spring 2009 Chris Sims Econ 504, Lecture 1: Transversality and Stochastic Lagrange Multipliers Christopher A. Sims Princeton University sims@princeton.edu February 4, 2009 0 Example: LQPY The ordinary
More informationOptimisation in Higher Dimensions
CHAPTER 6 Optimisation in Higher Dimensions Beyond optimisation in 1D, we will study two directions. First, the equivalent in nth dimension, x R n such that f(x ) f(x) for all x R n. Second, constrained
More informationContents. 4.5 The(Primal)SimplexMethod NumericalExamplesoftheSimplexMethod
Contents 4 The Simplex Method for Solving LPs 149 4.1 Transformations to be Carried Out On an LP Model Before Applying the Simplex Method On It... 151 4.2 Definitions of Various Types of Basic Vectors
More information1 Computing with constraints
Notes for 2017-04-26 1 Computing with constraints Recall that our basic problem is minimize φ(x) s.t. x Ω where the feasible set Ω is defined by equality and inequality conditions Ω = {x R n : c i (x)
More informationLecture 13: Constrained optimization
2010-12-03 Basic ideas A nonlinearly constrained problem must somehow be converted relaxed into a problem which we can solve (a linear/quadratic or unconstrained problem) We solve a sequence of such problems
More informationDYNAMIC AND COMPROMISE FACTOR ANALYSIS
DYNAMIC AND COMPROMISE FACTOR ANALYSIS Marianna Bolla Budapest University of Technology and Economics marib@math.bme.hu Many parts are joint work with Gy. Michaletzky, Loránd Eötvös University and G. Tusnády,
More informationR u t c o r Research R e p o r t. The Optimization of the Move of Robot Arm by Benders Decomposition. Zsolt Robotka a RRR , DECEMBER 2005
R u t c o r Research R e p o r t The Optimization of the Move of Robot Arm by Benders Decomposition Zsolt Robotka a Béla Vizvári b RRR 43-2005, DECEMBER 2005 RUTCOR Rutgers Center for Operations Research
More informationSupport Vector Machines
Support Vector Machines Sridhar Mahadevan mahadeva@cs.umass.edu University of Massachusetts Sridhar Mahadevan: CMPSCI 689 p. 1/32 Margin Classifiers margin b = 0 Sridhar Mahadevan: CMPSCI 689 p.
More information