Programação Linear (e rudimentos de otimização não-linear)

notas de aula – versão 64 - Jerônimo C. Pellegrini
Bibliografia
[ABD09]
[Apo69]
[Bar+98]
[Bar02]
[Bea55]
[Bel03]
[Ber07]
[BJ77]
[BN03]
[BSS06]
David Avis, David Bremner e Antoine Deza. Polyhedral Computation.
AMS, 2009. ISBN: 978-0-8218-4633-9.
Tom M. Apostol. Calculus, Vol. 2: Multi-Variable Calculus and
Linear Algebra with Applications to Differential Equations and
Probability. Wiley, 1969. ISBN: 978-0471000075.
Cynthia Barnhart et al. “Branch-and-Price: column generation
for solving huge integer programs”. Em: Operations Research
46.3 (1998), pp. 316–329.
Alexander Barvinok. A Course in Convexity. AMS, 2002. ISBN:
978-0821829684.
E. M. L Beale. “On Minimizing a Convex Function Subject to Linear
Inequalities”. Em: Journal of the Royal Statistics Society. B
17 (1955), pp. 173–184.
Richard Bellman. Dynamic Programming. Dover, 2003. ISBN:
978-0486428093.
Dimitri P. Bertsekas. Dynamic Programming and Optimal Control.
2007. ISBN: 978-1886529083.
Mokhtar S. Bazaraa e John J. Jarvis. Linear Programming and
Network Flows. Wiley, 1977. ISBN: 0-471-06015-1.
Dimitri Bertsekas e Angelia Nedic. Convex Analysis and Optimization.
Athena Scientific, 2003. ISBN: 978-1886529458.
Mokhtar S. Bazaraa, Hanif D. Sherali e C. M. Shetty. Nonlinear
Programming: Theory and Algorithms. Wiley-Insterscience, 2006.
ISBN: 978-0471486008.
Versão Preliminar
[BT96]
Dimitri P. Bertsekas e John Tsitsiklis. Neuro-Dynamic Programming.
Athena Scientific, 1996. ISBN: 978-1886529106.
195