Displaying 81 – 100 of 120

Showing per page

Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution

Anass Nagih, Gérard Plateau (2010)

RAIRO - Operations Research

Fractional programming consists in optimizing a ratio of two functions subject to some constraints. Different versions of this model, linear or nonlinear, have applications in various fields like combinatorial optimization, stochastic programming, data bases, and economy. Three resolution methods are presented: direct solution, parametric approach and solution of an equivalent problem.

Proč řešit graficky úlohy lineárního programování

Andrea Kubišová (2016)

Učitel matematiky

At universities focused on economy, Operation Research topics are usually included in the study plan, including solving of Linear Programming problems. A universal tool for their algebraic solution is (numerically difficult) Simplex Algorithm, for which it is necessary to know at least the fundamental of Matrix Algebra. To illustrate this method of solving LP problems and to discuss all types of results, it seems to be very convenient to include a chapter about graphic solutions to LP problems....

Producing the tangency portfolio as a corner portfolio

Reza Keykhaei, Mohamad-Taghi Jahandideh (2013)

RAIRO - Operations Research - Recherche Opérationnelle

One-fund theorem states that an efficient portfolio in a Mean-Variance (M-V) portfolio selection problem for a set of some risky assets and a riskless asset can be represented by a combination of a unique risky fund (tangency portfolio) and the riskless asset. In this paper, we introduce a method for which the tangency portfolio can be produced as a corner portfolio. So, the tangency portfolio can be computed easily and fast by any algorithm designed for tracing out the M-V efficient frontier via...

Production games, core deficit, duality and shadow prices

Sjur Didrik Flåm (2006)

Banach Center Publications

Considered here are production (or market) games with transferable utility. Prime objects are explicitly computable core solutions, or somewhat "deficit" versions of such, fully defined by shadow prices. Main arguments revolve around standard Lagrangian duality. A chief concern is to relax, or avoid, the commonplace assumption that all preferences and production possibilities be convex. Doing so, novel results are obtained about non-emptiness of the core, and about specific imputations therein.

Production-inventory system with finite production rate, stock-dependent demand, and variable holding cost

Hesham K. Alfares (2014)

RAIRO - Operations Research - Recherche Opérationnelle

In general, traditional production-inventory systems are based on a number of simplifying – but somewhat unrealistic – assumptions, including constant demand rate, constant holding cost, and instantaneous order replenishment. These assumptions have been individually challenged in numerous variations of production-inventory models. Finite production rate models, such as economic production quantity (EPQ) systems consider gradual order replenishment. Stock-dependent demand models assume the demand...

Currently displaying 81 – 100 of 120