Using Physical Quantities in Applied Mathematical Problems with Maple

The present article discusses units of measure and their base units, work environments built in the Units package of the computer algebra system Maple. An analysis is drawn of the tools of the application in connection with the use of physical quantities and their features. Maple’s main commands are arranged in groups depending on the function. Some applied mathematical problems are given as examples making use of derivative, integral and differential equations.

Notes on the Solution of Dynamic Optimization Problems with Explicit Controls in Discrete-Time Economic Models

Йордан Йорданов, Андрей Василев - В работата се изследват методи за решаването на задачи на оптималното управление в дискретно време с безкраен хоризонт и явни управления. Дадена е обосновка на една процедура за решаване на такива задачи, базирана на множители на Лагранж, коята често се употребява в икономическата литература. Извеждени са необходимите условия за оптималност на базата на уравнения на Белман и са приведени достатъчни условия за оптималност при допускания, които често се използват в икономиката.

Riemann-Hilbert Problems with Canonical Normalization and Families of Commuting Operators

2010 Mathematics Subject Classification: 35Q15, 31A25, 37K10, 35Q58.

First-Order Conditions for Optimization Problems with Quasiconvex Inequality Constraints

2000 Mathematics Subject Classification: 90C46, 90C26, 26B25, 49J52.

Generalized Scalarizing Problems GENS and GENSLex of Multicriteria Optimization

* This paper is partially supported by the National Science Fund of Bulgarian Ministry of Education and Science under contract № I–1401\2004 "Interactive Algorithms and Software Systems Supporting Multicriteria Decision Making".

Sequencing Jobs with Uncertain Processing Times and Minimizing the Weighted Total Flow Time

We consider an uncertain version of the scheduling problem to sequence set of jobs J on a single machine with minimizing the weighted total flow time, provided that processing time of a job can take on any real value from the given closed interval. It is assumed that job processing time is unknown random variable before the actual occurrence of this time, where probability distribution of such a variable between the given lower and upper bounds is unknown before scheduling. We develop the dominance relations on a set of jobs J. The necessary and sufficient conditions for a job domination may be tested in polynomial time of the number n = |J| of jobs. If there is no a domination within some subset of set J, heuristic procedure to minimize the weighted total flow time is used for sequencing the jobs from such a subset. The computational experiments for randomly generated single-machine scheduling problems with n ≤ 700 show that the developed dominance relations are quite helpful in minimizing the weighted total flow time of n jobs with uncertain processing times.

Numerical Solution of Fractional Diffusion-Wave Equation with two Space Variables by Matrix Method

Mathematics Subject Classi¯cation 2010: 26A33, 65D25, 65M06, 65Z05.

On a Class of Elliptic Equations for the N-Laplacian in R^n with One-Sided Exponential Growth

2000 Mathematics Subject Classification: 35J40, 49J52, 49J40, 46E30

Crack Theory with Singularities at the Boundary

2002 Mathematics Subject Classification: 35S15, 35J70, 35J40, 38J40