<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/">
<channel rdf:about="http://blogmarks.net/api/marks/tag/lecture notes">
<title>Public marks with tag &quot;lecture notes&quot;</title>
<description>Public marks with tag &quot;lecture notes&quot;</description>
<link>http://blogmarks.net/marks/tag/lecture notes</link>
<items><rdf:Seq><rdf:li resource="http://blogmarks.net/api/user/ogrisel/mark/1057747447"/>
</rdf:Seq></items>
</channel>
<item rdf:about="http://blogmarks.net/api/user/ogrisel/mark/1057747447">
<title>Linear Programming: Foundations and Extensions</title>
<link>http://www.princeton.edu/~rvdb/LPbook/</link>
<description># Balanced treatment of the simplex method and interior-point methods.
# Efficient source code (in C) for all the algorithms presented in the text.
# Thorough discussion of several interior-point methods including primal-dual path-following, affine-scaling, and homogeneous self dual methods.
# Extensive coverage of applications including traditional topics such as network flows and game theory as well as less familiar ones such as structural optimization, L^1 regression, and the Markowitz portfolio optimization model.
# Over 200 class-tested exercises.
# A dynamically expanding collection of exercises. </description>
<dc:date>2008-03-21T17:37:30Z</dc:date>
<dc:author>ogrisel</dc:author>
<dc:subject>optimization, theory, linear programming, interior point, lecture notes, pdf</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://www.princeton.edu/~rvdb/LPbook/"><img border="0" src="http://blogmarks.net/screenshots/2008/03/21/b8d11d4cf9b9a6336216cd5b075df986.jpg" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://www.princeton.edu/~rvdb/LPbook/">Linear Programming: Foundations and Extensions</a></h4>
 
by <a href="http://blogmarks.net/user/ogrisel">ogrisel</a> 
<p class="description"># Balanced treatment of the simplex method and interior-point methods.
# Efficient source code (in C) for all the algorithms presented in the text.
# Thorough discussion of several interior-point methods including primal-dual path-following, affine-scaling, and homogeneous self dual methods.
# Extensive coverage of applications including traditional topics such as network flows and game theory as well as less familiar ones such as structural optimization, L^1 regression, and the Markowitz portfolio optimization model.
# Over 200 class-tested exercises.
# A dynamically expanding collection of exercises. </p>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/optimization">optimization</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/theory">theory</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/linear%2Bprogramming">linear programming</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/interior%2Bpoint">interior point</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/lecture%2Bnotes">lecture notes</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/pdf">pdf</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=1057747447">Copy</a> | 
<a href="http://blogmarks.net/link/2711977">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> </rdf:RDF>