A discrete optimality system for an optimal harvesting problem

Date

2017-10-01

Author

Bakan, Hacer Oz
Yilmaz, Fikriye
Weber, Gerhard Wilhelm

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

209
views

0
downloads

In this paper, we obtain the discrete optimality system of an optimal harvesting problem. While maximizing a combination of the total expected utility of the consumption and of the terminal size of a population, as a dynamic constraint, we assume that the density of the population is modeled by a stochastic quasi-linear heat equation. Finite-difference and symplectic partitioned Runge-Kutta (SPRK) schemes are used for space and time discretizations, respectively. It is the first time that a SPRK scheme is employed for the optimal control of stochastic partial differential equations. Monte-Carlo simulation is applied to handle expectation appearing in the cost functional. We present our results together with a numerical example. The paper ends with a conclusion and an outlook to future studies, on further research questions and applications.

Subject Keywords

Management Information Systems, Information Systems

URI

https://hdl.handle.net/11511/50466

Journal

COMPUTATIONAL MANAGEMENT SCIENCE

DOI

https://doi.org/10.1007/s10287-017-0286-5

Collections

Graduate School of Applied Mathematics, Article

Suggestions

OpenMETU
Core

A method for concurrency control in distributed DBMSs: Permission Test Method Halıcı, Uğur (Association for Computing Machinery (ACM), 1987-01-09) In this paper, a method for concurrency control in distributed DBMSs, called Permission Test Method is proposed. The PT method satisfies the basic requirements for concurrency control, that is, it executes the transactions in a serializable order, deadlocks do not appear and indefinite postponment is prevented by the method. In PT method, transactions, which are permitted to run, are not aborted unless a related site failure occurs. Furthermore, the complexity analysis indicates that the algorithm will work...
A conic quadratic formulation for a class of convex congestion functions in network flow problems Gürel, Sinan (Elsevier BV, 2011-06-01) In this paper we consider a multicommodity network flow problem with flow routing and discrete capacity expansion decisions. The problem involves trading off congestion and capacity assignment (or expansion) costs. In particular, we consider congestion costs involving convex, increasing power functions of flows on the arcs. We first observe that under certain conditions the congestion cost can be formulated as a convex function of the capacity level and the flow. Then, we show that the problem can be effici...
JOB-SHOP SCHEDULING UNDER A NONRENEWABLE RESOURCE CONSTRAINT TOKER, A; KONDAKCI, S; ERKIP, N (JSTOR, 1994-08-01) In this paper we consider the job shop scheduling problem under a discrete non-renewable resource constraint. We assume that jobs have arbitrary processing times and resource requirements and there is a unit supply of the resource at each time period. We develop an approximation algorithm for this problem and empirically test its effectiveness in finding the minimum makespan schedules.
Comparison of feature-based and image registration-based retrieval of image data using multidimensional data access methods Arslan, Serdar; Yazıcı, Adnan; Sacan, Ahmet; Toroslu, İsmail Hakkı; Acar, Esra (Elsevier BV, 2013-07-01) In information retrieval, efficient similarity search in multimedia collections is a critical task In this paper, we present a rigorous comparison of three different approaches to the image retrieval problem, including cluster-based indexing, distance-based indexing, and multidimensional scaling methods. The time and accuracy trade-offs for each of these methods are demonstrated on three different image data sets. Similarity of images is obtained either by a feature-based similarity measure using four MPEG-...
AN INTEGRABLE FAMILY OF MONGE-AMPERE EQUATIONS AND THEIR MULTI-HAMILTONIAN STRUCTURE NUTKU, Yavuz; Sarıoğlu, Bahtiyar Özgür (1993-01-01) We have identified a completely integrable family of Monge-Ampère equations through an examination of their Hamiltonian structure. Starting with a variational formulation of the Monge-Ampère equations we have constructed the first Hamiltonian operator through an application of Dirac's theory of constraints. The completely integrable class of Monge-Ampère equations are then obtained by solving the Jacobi identities for a sufficiently general form of the second Hamiltonian operator that is compatible with the...

Citation Formats

H. O. Bakan, F. Yilmaz, and G. W. Weber, “A discrete optimality system for an optimal harvesting problem,” COMPUTATIONAL MANAGEMENT SCIENCE, pp. 519–533, 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/50466.