nonlinear knapsack problems (nkp) are the alternative formulation for the multiple-choice knapsack problems. a powerful approach for solving nkp is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...

We consider multistage decision processes where criterion function is an expectation of minimum function. We formulate them as Markov decision processes with imbedded parameters. The policy depends upon a history including past imbedded parameters, and the rewards at each stage are random and depend upon current state, action and a next state. We then give an optimality equation by using operat...

This paper presents the analysis of a renewal input  finite buffer queue wherein the customers can decide either to  join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed  by an underlying $m$-state Markov chain. Employing the supplementary  variable and imbedded Markov chain techniques,   the steady-state system length distributions at pre...

Overlap of words complicates the problem of word counting. The technique of the imbedded Markov chain (IMC) uses an enlarged state space to recover the Markovian property for the word counting problem. A degenerate word represents multiple non-degenerate words. An efficient way to decompose a degenerate word according to its overlapping pattern for implementing IMC is proposed.

A Skyrme type Lagrangian for a skyrmion imbedded in a baryon rich environment is proposed. The dependence of static nucleon properties and nucleon nucleon tensor interaction on nuclear density is investigated. PACS numbers : 12.39.Dc, 12.39.Fe, 21.30.Fe Typeset using REVTEX Permanent address: Theoretical Physics Department , Tashkent State University, Tashkent, Uzbekistan