<--- Back to Details
First PageDocument Content
Mathematical optimization / Mathematics / Operations research / Linear programming / Convex optimization / Quadratic programming / Interior point method / Duality / Network simplex algorithm / Linear complementarity problem / KarushKuhnTucker conditions / Simplex algorithm
Date: 2007-12-06 14:07:01
Mathematical optimization
Mathematics
Operations research
Linear programming
Convex optimization
Quadratic programming
Interior point method
Duality
Network simplex algorithm
Linear complementarity problem
KarushKuhnTucker conditions
Simplex algorithm

Add to Reading List

Source URL: www.siam.org

Download Document from Source Website

File Size: 260,24 KB

Share Document on Facebook

Similar Documents

Journal of Global Optimization manuscript No. (will be inserted by the editor) Stabilizer-based symmetry breaking constraints for mathematical programs Leo Liberti · James Ostrowski

DocID: 1v0h9 - View Document

OPTIMA 88 Mathematical Optimization Society Newsletter Philippe L. Toint MOS Chair’s Column

DocID: 1uTp0 - View Document

The Annals of Probability 2004, Vol. 32, No. 1B, 1030–1067 © Institute of Mathematical Statistics, 2004 A STOCHASTIC REPRESENTATION THEOREM WITH APPLICATIONS TO OPTIMIZATION AND OBSTACLE PROBLEMS

DocID: 1sOP9 - View Document

Optimization of Electrical Production The production of electricity in France is optimized everyday with the help of a mathematical software developed at Inria, in collaboration with EDF R&D. Substantial performance is a

DocID: 1rxID - View Document

Mathematical optimization / Control theory / Systems science / Academia / Cybernetics / Systems theory / Operations research / Model predictive control / Dynamic programming / Optimal control / Trajectory optimization / Sequential quadratic programming

Timed-Elastic-Bands for Time-Optimal Point-To-Point Nonlinear Model Predictive Control

DocID: 1ru4i - View Document