... its revenue, this study aims to maximize the profit from managing unsold goods. Design/methodology/approach A new mixed-integer linear programming model has been developed to address the problem, which considers the selling prices of products in primary and secondary stores and the costs...

... coefficients of the constraint resources have the fuzzy boundaries. Design/methodology/approach – Based on the improved fuzzy linear programming, the train re-scheduling model is constructed. Aiming at dealing with the fuzzy characteristics of the constraint coefficients value range boundaries...

... of the inputs and outputs and value judgment of all DMUs and ranks the importance of the indicators from the overall perspectives. © Emerald Group Publishing Limited 2015 Decision making Operational research Linear programming Management However, current researches on efficiency...

... in which the amounts available at each source, and the demands of each destination, are all equal and normally set to unity. The transportation problem is in turn a special case of the general problem of linear programming, but one frequently arising. The Hungarian method due to Kuhn is treated at greater...

...Seyed Hossein Razavi Hajiagha; Hannan Amoozad Mahdiraji; Shide Sadat Hashemi Purpose The purpose of this paper is to extend a methodology for solving multi‐objective linear programming (MOLP) problems, when the objective functions and constraints coefficients are stated as interval numbers...

... values (Cherruault, 2009). If α<0.5, it is obvious that the previous equation allows to obtain any point of [0, M]ⁿ with integer coordinates (Mazza et al., 2007). Boolean algebra Global optimization Operational research Linear programming...

...Yves Cherruault; Mahamat Maimos; Yves Cherruault; Balira O. Konfe; Ange‐gar S. Nkokolo Massamba Purpose The purpose of this paper is to present an efficient algorithm to solve multi‐objective linear programming (MOLP) problem. Design/methodology/approach This new approach consists to convert...

... for any x∈K. Observe that from condition (2), to define an α‐dense curve in K, the diameter: Equation 10 that is K must be necessarily bounded. © Emerald Group Publishing Limited 2007 Cybernetics Optimization techniques Linear programming...

... © Emerald Group Publishing Limited 2005 Cybernetics Control systems Linear programming In compartmental analysis, the exchange hypothesis allows to practically model any phenomenon depending only on time (Cherruault, 1998, 1983, 1999). So, many phenomena are based on “enzyme...

...Hua‐Wen Song; Qing‐Hua Chen Based on the scrap ammunition processing which is a part of the ordnance supply engineering, this paper established a decision‐making model of locations and amounts of scrap ammunition processing by the use of multiple‐objectives linear programming theory. In addition...

...Zhijie Chen; Qile Chen; Weizhen Chen; Yinao Wang This paper describes the use of grey system theory in mathematical programming problems. In particular, the linear programming problem, which is one of the most widely used mathematical programming problems, with grey interval and grey forecasting...

... Linear programming This paper deals with the numerical solution of a class of boundary problems, using Adomian decomposition method (Adomian, 1984, 1988, 1994). As in the work of Cherruault (1998, 1999) this method gives very good results for solving algebraic, differential and partial...

... with four subscripts for which we have established an existence criterion, an optimality condition and an algorithm of resolution. Cybernetics Linear programming © MCB UP Limited 2003 A necessary condition for the existence of a program to (T_{C) is that: Equation 9 Equation 10}...

... in input parameters is the speed of generating alternative optimal strategies. By proper tuning of the parameters, “envelope strategies” that encompass the worst case and best case scenarios are swiftly produced. Applications of linear programming models in firm planning are well documented. Banking models...

... is also run on the breast cancer data set and the results are compared with C4.5 algorithm results. © MCB UP Limited 1997 Data capture Data mining Health care Linear programming Machine learning DO UNTIL ((All_pos <= Stop_thresh) OR (Best_rule_accuracy <= 0.5)) Phase III...

... and the sequence of r‐constrained linear programs generated by the ERA‐framework is solved. This is by a parallel implementation of a powerful interior point algorithm called the conjugate gradient method (CGM), selected because it is particularly suitable for parallel processing. Gives details...