<--- Back to Details
First PageDocument Content
Applied mathematics / George Dantzig / Linear programming / Mathematical economics / John von Neumann / Cutting-plane method / Simplex algorithm / Nonlinear programming / Travelling salesman problem / Mathematics / Mathematical optimization / Operations research
Date: 2015-06-23 14:22:34
Applied mathematics
George Dantzig
Linear programming
Mathematical economics
John von Neumann
Cutting-plane method
Simplex algorithm
Nonlinear programming
Travelling salesman problem
Mathematics
Mathematical optimization
Operations research

Add to Reading List

Source URL: www2.informs.org

Download Document from Source Website

File Size: 73,79 KB

Share Document on Facebook

Similar Documents

Math. Program., Ser. A:155–196 DOIs10107FULL LENGTH PAPER Nonlinear programming without a penalty function or a filter

DocID: 1vb9n - View Document

Undecidability and hardness in mixed-integer nonlinear programming Leo Liberti1 1 ´

DocID: 1v68K - View Document

ooOPS A C++ Callable Object-Orientated Library for the Definition and Solution of Large, Sparse Mixed Integer Nonlinear Programming (MINLP) Problems Draft v. 1.25

DocID: 1v5c3 - View Document

IEEE ADPRL 2017 Special Session: Title: Data-driven/Data-based Adaptive Dynamic Programming for Uncertain Nonlinear Systems Aim: Recently, data-driven/data-based reinforcement learning(RL) and adaptive dynamic programmi

DocID: 1v30I - View Document

1 date: April 2, 2015 L-CONVEX FUNCTIONS AND MCONVEX FUNCTIONS In the field of nonlinear programming (in continuous variables) convex analysis

DocID: 1uMVL - View Document