Detection of redundant linear constraints is important for a variety of applications including linear programming, variable elimination, canonical forms, and convex hull algorithms to name a few. Systematic semantic methods (i.e. optimization) exist to identify all redundant constraints but they are generally computationally expensive. It is thus desirable to identify syntactic criteria to redu...

Salinity has deleterious effects on both crops and livestock. An optimum farm plan is essential to adapt this hazard. The present study made an effort develop for the livestock-based farming systems in saline normal areas of West Bengal. In case areas, farmers put highest priority maximizing gross margin, followed by achieving self-financial support minimizing income risk farm. Optimal solution...

We explore the interaction between evolutionary stability and lexicographic preferences. To do so, we define a limit Nash equilibrium for a lexicographic game as the limit of Nash equilibria of nearby games with continuous preferences. Nash equilibria of lexicographic games are limit Nash equilibria, but not conversely. Modified evolutionarily stable strategies (Binmore and Samuelson, 1992. J. ...

We investigate automatic presentations of infinite words. Starting points of our study are the works of Rigo and Maes, and Carton and Thomas concerning the lexicographic presentation, respectively the decidability of the MSO theory of morphic words. Refining their techniques we observe that the lexicographic presentation of a (morphic) word is canonical in a certain sense. We then go on to gene...

The performance of a supply chain should usually be measured by multiple criteria. We address production, distribution and capacity planning of global supply chains considering cost, responsiveness and customer service level simultaneously. A multiobjective mixed-integer linear programming (MILP) approach is developed with total cost, total flow time and total lost sales as key objectives. Also...

Simply-typed term rewriting systems (STRSs) are an extension of term rewriting systems. STRSs can be naturally handle higher order functions, which are widely used in existing functional programming languages. In this paper we design recursive and lexicographic path orders, which can efficiently prove the termination of STRSs. Moreover we discuss an application to the dependency pair and the ar...