Linear assignment problem is one of the most important practical models in the literature of linear programming problems‎. ‎Input data in the cost matrix of the linear assignment problem are not always crisp and sometimes in the practical situations is formulated by the grey systems theory approach‎. ‎In this way‎, ‎some researchers have used a whitening technique to solve the grey assignment p...

In this paper we propose a simple non-parametric model for multiple crite-ria supplier selection problem. The proposed model does not generate a zeroweight for a certain criterion and ranks the suppliers without solving the modeln times (one linear programming (LP) for each supplier) and therefore allowsthe manager to get faster results. The methodology is illustrated using anexample.

The pupose of this paper is modeling of Partial Digest Problem (PDP) as a mathematical programming problem. In this paper we present a new viewpoint of PDP. We formulate the PDP as a continuous optimization problem and develope a method to solve this problem. Finally we constract a linear programming model for the problem with an additional constraint. This later model can be solved by the simp...

this paper investigates the problem of selecting and scheduling a set of projects among available projects. each project consists of several tasks and to perform each one some resource is required. the objective is to maximize total benefit. the paper constructs a mathematical formulation in form of mixed integer linear programming model. three effective metaheuristics in form of the imperialis...

This paper presents models for three variants of the secretary problem based on a strategic form of zero-sum finite games for two players. Based on the minimax theorem for finite games, the problem of maximizing the minimum average payoff of a player, in spite of the strategies of the other player, is represented by a linear programming model, which solution using the simplex method presents no...