<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: What Efficient Frontier Are You Talking About?</title>
	<atom:link href="http://www.foliotechnologies.com/2009/05/25/what-efficient-frontier-are-you-talking-about/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.foliotechnologies.com/2009/05/25/what-efficient-frontier-are-you-talking-about/</link>
	<description></description>
	<lastBuildDate>Sat, 20 Jun 2009 16:54:46 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Hervé Kieffel</title>
		<link>http://www.foliotechnologies.com/2009/05/25/what-efficient-frontier-are-you-talking-about/comment-page-1/#comment-3</link>
		<dc:creator>Hervé Kieffel</dc:creator>
		<pubDate>Sat, 20 Jun 2009 16:54:46 +0000</pubDate>
		<guid isPermaLink="false">http://www.foliotechnologies.com/?p=240#comment-3</guid>
		<description>Thanks for your comments. The question of convexity of the (Pareto-)efficient frontier is a complex one, for at least two reasons:
1) If the decision units are binary (the project is either funded, or it is not), the frontier will of course be a step-function. If you can fund .72 unit of project, though, the stepwise non-convexities will be removed, but you might still have the 2nd issue:
2) the knapsack problem: http://www.foliotechnologies.com/2009/05/03/ranking-vs-optimizing-projects/</description>
		<content:encoded><![CDATA[<p>Thanks for your comments. The question of convexity of the (Pareto-)efficient frontier is a complex one, for at least two reasons:<br />
1) If the decision units are binary (the project is either funded, or it is not), the frontier will of course be a step-function. If you can fund .72 unit of project, though, the stepwise non-convexities will be removed, but you might still have the 2nd issue:<br />
2) the knapsack problem: <a href="http://www.foliotechnologies.com/2009/05/03/ranking-vs-optimizing-projects/" rel="nofollow">http://www.foliotechnologies.com/2009/05/03/ranking-vs-optimizing-projects/</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: rwoodaman</title>
		<link>http://www.foliotechnologies.com/2009/05/25/what-efficient-frontier-are-you-talking-about/comment-page-1/#comment-2</link>
		<dc:creator>rwoodaman</dc:creator>
		<pubDate>Fri, 19 Jun 2009 01:44:45 +0000</pubDate>
		<guid isPermaLink="false">http://www.foliotechnologies.com/?p=240#comment-2</guid>
		<description>Cool post.  I very much enjoyed the explanation of the distinction between efficient horizons in finance in PPM.  I deal in the PPM world for defense.  There we will see some cases where the pareto efficient horizon is non-convex.  We draw the frontier as if it were convex, leaving some of the non-dominated points below the convex horizon.  While these are non-dominated, they don&#039;t make much sense to acquire.</description>
		<content:encoded><![CDATA[<p>Cool post.  I very much enjoyed the explanation of the distinction between efficient horizons in finance in PPM.  I deal in the PPM world for defense.  There we will see some cases where the pareto efficient horizon is non-convex.  We draw the frontier as if it were convex, leaving some of the non-dominated points below the convex horizon.  While these are non-dominated, they don&#8217;t make much sense to acquire.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
