TomSym - PDFSEARCH.IO - Document Search Engine

TomSym
Results: 25

#	Item
11	Rooftop Theorem for Concave functions This theorem asserts that if f is a differentiable concave function of a single variable, then at any point x in the domain of f , the tangent line through the point (x, f (x)) lies Add to Reading List Source URL: www.econ.ucsb.edu Language: English - Date: 2014-10-20 14:23:39 Calculus Continuous function Concave function Numerical software TomSym PROPT Mathematical analysis Mathematics Convex analysis
12	(MI)NLPLib 2 Stefan Vigerske 4th September 2014 MAGO 2014, Málaga Add to Reading List Source URL: www.gams.com Language: English - Date: 2014-09-07 07:40:04 Sheung Shui Numerical software TomSym Sham Shui Po
13	Integer Programming Tutorial 2 Questions The Cutting Plane Algorithm Let: a1 + x1 + a2 x2 + ... + an xn = b, Add to Reading List Source URL: www.doc.ic.ac.uk Language: English - Date: 2006-11-15 11:23:10 Cutting-plane method Linear programming relaxation TomSym PROPT Mathematical optimization Numerical analysis Numerical software
14	Game Theory Tutorial 2 Answers Exercise 1 (Minimax problem) Three linear functions y1 , y2 and y3 are defined as follows: Add to Reading List Source URL: www.doc.ic.ac.uk Language: English - Date: 2006-11-15 11:23:01 Numerical software TomSym PROPT
15	Integer Programming Wolfram Wiesemann November 17, 2009 Contents of this Lecture Add to Reading List Source URL: www.doc.ic.ac.uk Language: English - Date: 2009-11-23 07:02:42 Applied mathematics Cutting-plane method Mathematics Numerical software Integer programming PROPT Constraint programming TomSym Numerical analysis Combinatorial optimization Operations research
16	Algorithms for Optimal Decisions Tutorial 9 Answers Exercise 1 Using the Goldstein–Levitin–Polyak algorithm solve the following NLP problem: min Add to Reading List Source URL: www.doc.ic.ac.uk Language: English - Date: 2006-11-15 10:45:07 Applied mathematics Convex optimization Linear programming Wolfe conditions Function TomSym PROPT Mathematics Operations research Mathematical optimization
17	Algorithms for Optimal Decisions Tutorial 1 Answers Exercise 1 Show that the intersection S of any numbers of convex sets Si is a convex set. Add to Reading List Source URL: www.doc.ic.ac.uk Language: English - Date: 2006-11-15 10:45:05 Mathematical analysis Convex function Concave function Vector space Constructible universe GEC TomSym Algebra Mathematics Convex analysis
18	Unit 1 Lesson 5. : Special cases of LPP Learning Outcomes Special cases of linear programming problems • • Add to Reading List Source URL: businessmanagementcourses.org Language: English - Date: 2007-06-08 11:37:20 Numerical analysis Linear programming Mathematical optimization Constraint PROPT TomSym Operations research Applied mathematics Mathematics
19	REVIEW OF CALCULUS Herman J. Bierens Pennsylvania State University (January 28, [removed]. Add to Reading List Source URL: econ.la.psu.edu Language: English - Date: 2004-02-02 08:04:10 Differential calculus Continuous function Numerical software TomSym Bessel function Mathematical analysis Mathematics Derivative
20	Lecture notes ?: The simplex algorithm Vincent Conitzer Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2008-03-26 23:43:43 Numerical analysis Mathematics Simplex algorithm Linear programming Duality PROPT TomSym Mathematical optimization Operations research Convex optimization