<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
<channel>
<title> Iranian Journal of Operations Research </title>
<link>http://www.iors.ir</link>
<description>Iranian Journal of Operations Research - Journal articles for year 2010, Volume 2, Number 1</description>
<generator>Yektaweb Collection - https://yektaweb.com</generator>
<language>en</language>
<pubDate>2010/4/12</pubDate>

					<item>
						<title>Decision making in forest management with consideration of stochastic prices</title>
						<link>http://iors.ir/journal/browse.php?a_id=164&amp;sid=1&amp;slc_lang=en</link>
						<description>&lt;p&gt; &lt;i&gt; The optimal harvesting policy is calculated as a function of the entering stock, the price state, the harvesting cost, and the rate of interest in the capital market. In order to determine the optimal harvest schedule, the growth function and stumpage price process are estimated for the Swedish mixed species forests. The stumpage price is &lt;/i&gt;&lt;i&gt;assumed to follow a stochastic Markov process. &lt;/i&gt;&lt;i /&gt;&lt;i&gt;A stochastic dynamic programming technique &lt;/i&gt;&lt;i&gt;and traditional deterministic methods are used to obtain the optimal decisions. The expected present value of all future profits is maximized. &lt;/i&gt;&lt;i&gt;The results of adaptive optimization are compared with results obtained by the traditional deterministic approach. The results show a significant increase in the expected economic values via optimal adaptive decisions. &lt;/i&gt;&lt;/p&gt;</description>
						<author> Mohammadi Limaei</author>
						<category></category>
					</item>
					
					<item>
						<title>Linear plus fractional multiobjective programming problem with homogeneous constraints using fuzzy approach</title>
						<link>http://iors.ir/journal/browse.php?a_id=165&amp;sid=1&amp;slc_lang=en</link>
						<description>&lt;p&gt; &lt;i&gt; We develop an algorithm for the solution of multiobjective linear plus fractional programming problem (MOL+FPP) when some of the constraints are homogeneous in nature. Using homogeneous constraints, first we construct a transformation matrix T which transforms the given problem into another MOL+FPP with fewer constraints. Then, a relationship between these two problems, ensuring that the solution of the original problem can be recovered from the solution of the transformed problem, is established. We repeat this process of transformation until all the homogeneous constraints are removed. Then, we discuss the multi objective programming part, for which fuzzy programming methodology is proposed which works for the minimization of perpendicular distances between two hyper planes (curves) at the optimal points of the objective functions. A suitable membership function is defined with the help of the supremum perpendicular distance. A compromised optimal solution is obtained as a result of the minimization of the The supremum perpendicular distance. The corresponding optimal solution to the original problem is obtained using the transformation matrix. Finally, an example is given to illustrate the proposed model. &lt;/i&gt;&lt;/p&gt;</description>
						<author> Jain</author>
						<category></category>
					</item>
					
					<item>
						<title>Characterization of efficient points of the production possibility set under variable returns to scale in DEA</title>
						<link>http://iors.ir/journal/browse.php?a_id=166&amp;sid=1&amp;slc_lang=en</link>
						<description>&lt;p&gt; &lt;i&gt; We suggest a method for finding the non-dominated points of the production possibility set (PPS) with variable returns to scale (VRS) technology in data envelopment analysis (DEA). We present a multiobjective linear programming (MOLP) problem whose feasible region is the same as the PPS under variable returns to scale for generating non-dominated points. We demonstrate that Pareto solutions of the MOLP produce efficient units in DEA, and vice versa. We solve the MOLP problem by using a finite number of weights which are extreme rays of the cone generated by the efficient solutions. We obtain new efficient points by changing weights, and thus the efficient solutions set is produced. &lt;/i&gt;&lt;/p&gt;</description>
						<author> Hosseinzadeh Lotfi</author>
						<category></category>
					</item>
					
					<item>
						<title>Close interval approximation of piecewise quadratic fuzzy numbers for fuzzy fractional program</title>
						<link>http://iors.ir/journal/browse.php?a_id=168&amp;sid=1&amp;slc_lang=en</link>
						<description>&lt;p&gt; &lt;i&gt; The fuzzy approach has undergone a profound structural transformation in the past few decades. Numerous studies have been undertaken to explain fuzzy approach for linear and nonlinear programs. While, the findings in earlier studies have been conflicting, recent studies of competitive situations indicate that fractional programming problem has a positive impact on comparative scenario. We propose one of the best interval approximations, close interval approximation of piecewise quadratic fuzzy numbers for solving fuzzy number fractional programming problem without converting it to a crisp problem. A new form of simplex method is introduced here for solving fuzzy number fractional programming problem using fuzzy arithmetic. The fuzzy analogue of some important theorems of fuzzy fractional programming problem proved. A fuzzy fractional programming problem is worked out as an example to illustrate the proposed method. &lt;/i&gt;&lt;i /&gt;&lt;/p&gt;</description>
						<author> Jain</author>
						<category></category>
					</item>
					
	</channel>
</rss>
