Selection of constraints with a new approach in linear programming problems

2014 ◽  
Vol 8 ◽  
pp. 1311-1321 ◽  
Author(s):  
P. Sumathi ◽  
A. Gangadharan
2013 ◽  
Vol 347-350 ◽  
pp. 2865-2868
Author(s):  
Yan Qiong Zhang ◽  
Kai Huang ◽  
Wei Feng Zhu

The handling equipment optimization problem of material handling system for large ships is discussed in this paper. The optimization models for two supply ways which includesshore-to-ship and vessel-to-vesselare proposed respectively, which are converted to linear programming problems in order to analyze large ship material supply handling system of equipment optimization.


Author(s):  
ALI EBRAHIMNEJAD ◽  
SEYED HADI NASSERI ◽  
FARHAD HOSSEINZADEH LOTFI

Recently Ganesan and Veeramani introduced a new approach for solving a kind of linear programming problems involving symmetric trapezoidal fuzzy numbers without converting them to the crisp linear programming problems. But their approach is not efficient for situations in which some or all variables are restricted to lie within fuzzy lower and fuzzy upper bounds. In this paper, by a natural extension of their approach we obtain some new results leading to a new method to overcome this shortcoming.


Author(s):  
Valentin A. Bereznev

AbstractA method for determination of a nonnegative solution to a system of linear equations and linear programming problems is proposed in the paper. The method is based on the algorithmic selection of extreme vectors of a convex sharpened polyhedral cone corresponding to those problems.


Author(s):  
Tadeusz Trzaskalik ◽  
Slawomir Jarek

Here we discuss the issue of planning a telemarketing campaign which will promote new services and use databases of the current customers. The databases can contain data of hundreds of thousands up to a few million customers. To ensure the best possible efficiency of the marketing action, certain conditions have to be satisfied: among other things, the campaign has to be planned so as to present at most one offer to each prospective customer. The problem discussed here can be treated as a vector maximization problem. The consecutive components of the vector criterion function are the numbers of the services sold of each kind. The campaign may have as its objective the creation of a plan which maximizes the profit or the total number of the services sold. The problem can be also regarded as hierarchical; one can also apply other known scalarization approaches, which will be described here. The problems to be solved are large-scale binary linear programming problems. We present a possible solution of these problems using the R package.


2012 ◽  
Vol 3 (4) ◽  
pp. 1-6 ◽  
Author(s):  
M.Jayalakshmi M.Jayalakshmi ◽  
◽  
P.Pandian P.Pandian

Sign in / Sign up

Export Citation Format

Share Document