Search
Now showing items 1-7 of 7
Optimal and approximate ordering in solving investory problems
(The Institute Of National Planning., 1979-03)
Since the development of the original lot- size inventory model in 1915. many researches was done analysis mathematical models for describing ordering policies for one or more products invariably. it was assumed implicitly ...
solution methods for integer programming problems
(The Institute Of National Planning., 1983-12)
Integer programming is an extension of linear programming, that is to say we begin by forgetting the integer requirement and solving the problem. If the solution has all variables of the integer form, we have found an ...
production planning models and linear programming
(The Institute Of National Planning., 1983-11)
In the practical application of Operations research plays the leaner programming methods the main roll in
solving many applied problems. This is based on their practical simple applications and also on their simple
solution ...
Multi-objective linear programming
(The Institute Of National Planning., 1979-03)
This paper attempts to apply of mathematical programming to the analysis of economic problems and the elaboration of algorithm and programms for solving economic models. such models provide us with analysis of national ...
Planning strategies for development of new items
(The Institute Of National Planning., 1979-03)
In the following we deal with parallel
- Planning strategies for the development of a new item. let us assume that several proposals for developing the new items are available.
a developed simplex algorithm for solving transportation problem
(The Institute Of National Planning., 1984-01)
As an economic interpretation of the linear programming model encompassing a wide variety of applications is the following. The modeled system includes several activities which shares limited resources. The objective of ...
solution methods for integer programming problems
(The Institute Of National Planning., 1983-12)
Integer programming is an extension of linear programming, that is to say we begin by forgetting the integer requirement and solving the problem. If the solution has all variables of the integer form, we have found an ...