<?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">INF8404</article-id><article-id pub-id-type="doi">10.3233/INF-1997-8404</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>A set of examples of global and discrete optimization: application of Bayesian heuristic. Approach II</article-title></title-group><contrib-group><contrib contrib-type="Author"><name><surname>Mockus</surname><given-names>Jonas</given-names></name><email xlink:href="mailto:mockus@ktl.mii.lt">mockus@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, 2600 Vilnius, Lithuania</aff></contrib-group><pub-date pub-type="epub"><day>01</day><month>01</month><year>1997</year></pub-date><volume>8</volume><issue>4</issue><fpage>495</fpage><lpage>526</lpage><abstract><p>The following topics are important teaching operation research: games theory, decision theory, utility theory, queuing theory, scheduling theory, discrete optimization.</p><p>These topics are illustrated and the connection with global optimization is shown considering the following mathematical models:</p><p>– competition model with fixed resource prices, Nash equilibrium,</p><p>– competition model with free resource prices, Walras equilibrium,</p><p>– inspector's problem, multi-stage game model,</p><p>– “Star War” problem, differential game model,</p><p>– “Portfolio” problem, resource investment model,</p><p>– exchange rate prediction, Auto-Regression-Moving-Average (ARMA) model,</p><p>– optimal scheduling, Bayesian heuristic model,</p><p>– “Bride's” problem, sequential statistical decisions model.</p><p>The first seven models are solved using a set of algorithms of continuous global and stochastic optimization. The global optimization software GM (see [19]) is used. The underlying theory of this software and algorithms of solution are described in [19, 17]. The last model is an example of stochastic dynamic programming.</p><p>For better understanding, all the models are formulated in simplest terms as “classroom” examples. However, each of these models can be regarded as simple representations of important families of real-life problems. Therefore the models and solution algorithms may be of interest for application experts, too.</p><p>The paper is split into two parts. In the part one [18] the first five models are described. In this part the rest three models and accompanying software are considered.</p></abstract><kwd-group><label>Keywords</label><kwd>operations research</kwd><kwd>Bayesian</kwd><kwd>heuristic</kwd><kwd>optimization</kwd><kwd>global</kwd></kwd-group></article-meta></front></article>