<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
	<front>
		<journal-meta>
			<journal-id journal-id-type="publisher-id">INFORMATICA</journal-id>
			<journal-title-group>
				<journal-title>Informatica</journal-title>
			</journal-title-group>
			<issn pub-type="epub">0868-4952</issn>
			<issn pub-type="ppub">0868-4952</issn>
			<publisher>
				<publisher-name>VU</publisher-name>
			</publisher>
		</journal-meta>
		<article-meta>
			<article-id pub-id-type="publisher-id">inf15209</article-id>
			<article-id pub-id-type="doi">10.15388/Informatica.2004.059</article-id>
			<article-categories>
				<subj-group subj-group-type="heading">
					<subject>Research article</subject>
				</subj-group>
			</article-categories>
			<title-group>
				<article-title>Application of the Monte‐Carlo Method to Nonlinear Stochastic Optimization with Linear Constraints</article-title>
			</title-group>
			<contrib-group>
				<contrib contrib-type="Author">
					<name>
						<surname>Sakalauskas</surname>
						<given-names>Leonidas</given-names>
					</name>
					<email xlink:href="mailto:sakal@ktl.mii.lt">sakal@ktl.mii.lt</email>
					<xref ref-type="aff" rid="j_INFORMATICA_aff_000"/>
				</contrib>
				<aff id="j_INFORMATICA_aff_000">Institute of Mathematics and Informatics, Akademijos 4, 08663 Vilnius, Lithuania</aff>
			</contrib-group>
			<pub-date pub-type="epub">
				<day>01</day>
				<month>01</month>
				<year>2004</year>
			</pub-date>
			<volume>15</volume>
			<issue>2</issue>
			<fpage>271</fpage>
			<lpage>282</lpage>
			<history>
				<date date-type="received">
					<day>01</day>
					<month>04</month>
					<year>2003</year>
				</date>
			</history>
			<abstract>
				<p>We consider a problem of nonlinear stochastic optimization with linear constraints. The method of ɛ‐feasible solution by series of Monte‐Carlo estimators has been developed for solving this problem avoiding “jamming” or “zigzagging”. Our approach is distinguished by two peculiarities: the optimality of solution is tested in a statistical manner and the Monte‐Carlo sample size is adjusted so as to decrease the total amount of Monte‐Carlo trials and, at the same time, to guarantee the estimation of the objective function with an admissible accuracy. Under some general conditions we prove by the martingale approach that the proposed method converges a.s. to the stationary point of the problem solved. As a counterexample the maximization of the probability of portfolio desired return is given, too.</p>
			</abstract>
			<kwd-group>
				<label>Keywords</label>
				<kwd>Monte‐Carlo method</kwd>
				<kwd>portfolio optimization</kwd>
				<kwd>stochastic programming</kwd>
				<kwd>ɛ‐feasible solution</kwd>
			</kwd-group>
		</article-meta>
	</front>
</article>