In this paper we introduce a GRASP for the solution of general linear integer programs (IP). The strategy is based on the separation of the set of variables into the integer subset and the continuous subset. The procedure starts by solving the linear programming (LP) relaxation of the problem. Values for the integer variables are then chosen, through a randomised greedy construction heuristic b...

Robust supplier selection problem, in a scenario-based approach has been proposed, when the demand and exchange rates are subject to uncertainties. First, a deterministic multi-objective mixed integer linear programming is developed; then, the robust counterpart of the proposed mixed integer linear programming is presented using the recent extension in robust optimization theory. We discuss dec...

classical deterministic inventory models consider the demand rate to be either constant or time-dependent but independent from the stock status. however, for a certain type of inventory, the demand rate may be in-fluenced by the stock level. also in many real-life problems, some products such as fruits, vegetables, phar-maceuticals and volatile liquids continuously deteriorate to evaporation, o...

Both cutting plane methods and traditional decomposition methods are procedures that compute a bound on the optimal value of an integer linear program (ILP) by constructing an approximation to the convex hull of feasible solutions. This approximation is obtained by intersecting the polyhedron associated with the continuous relaxation, which has an explicit representation, with an implicitly def...

This paper is about a computer application for planning maintenance of aircraft fleet in what regards allocation skilled technicians. The formalization this mathematical programming problem written as minimizing one. decision variables are the data number available technicians, working hours needed to accomplish maintenance, costs due daily operation facilities, and downtime. Although, non-line...

We present a Mixed Integer Non-Linear Programming (MINLP) model capable of choosing the best design considering economic profit, availability, and safety. The takes into account probability suffering failure in year operation, as well revenue generated process units being non-functional state. inclusion programmed maintenances specified duration is considered model, assuming an equal distributi...

Computing the exact ideal and nadir criterion values is a very ‎important subject in ‎multi-‎objective linear programming (MOLP) ‎problems‎‎. In fact‎, ‎these values define the ideal and nadir points as lower and ‎upper bounds on the nondominated points‎. ‎Whereas determining the ‎ideal point is an easy work‎, ‎because it is equivalent to optimize a ‎convex function (linear function) over a con...

Mixed-integer conic programming is a generalization of mixed-integer linear programming. In this paper, we present an extension of the duality theory for mixed-integer linear programming (see [4], [11]) to the case of mixed-integer conic programming. In particular, we construct a subadditive dual for mixed-integer conic programming problems. Under a simple condition on the primal problem, we ar...