The considered problem in this paper is a 0-1 Multi-Quadratic Fractional programming Problem (0-1MQFP) without the restriction of positive denominators. The two important contributions of the paper are: (a) it propose...
详细信息
The considered problem in this paper is a 0-1 Multi-Quadratic Fractional programming Problem (0-1MQFP) without the restriction of positive denominators. The two important contributions of the paper are: (a) it proposes a linearization technique to solve any type of 0-1MQFP problem;and (b) when applied to the 0-1MQFP problem with the restriction of positive denominators, it requires less number of constraints and variables as compare with the available techniques in the literature. The problem is proved to be NP-hard. The linearization process is summarized with the help of an algorithm and flow chart, and further illustrated by examples. Codes for linearizing 0-1MQFPP is given in the APPENDIX.
Conventional facility location problems usually disperse facilities regardless of whether they are desirable. A recent variant emerged as the obnoxious facility dispersion problem that considers the clients influenced...
详细信息
Conventional facility location problems usually disperse facilities regardless of whether they are desirable. A recent variant emerged as the obnoxious facility dispersion problem that considers the clients influenced by the facilities. The only formulation for this problem is the obnoxious p-median problem, which resembles the p-median facility dispersion problem. Still, alternative models exist. This study presents and investigates several possible models for the obnoxious facility dispersion problem. Given that the models exhibit respective facility dispersion patterns, this study proposed to compare the models using the entropy of facility distribution.
The study of multiple criteria problems is not new, but during the last seventeen years more and more study has been done in this area. The study of 0-1 multiple criteria problems started much later than the study of ...
详细信息
The study of multiple criteria problems is not new, but during the last seventeen years more and more study has been done in this area. The study of 0-1 multiple criteria problems started much later than the study of continuous multiple criteria problems. Some of the earliest works on 0-1 problems with multiple criteria was first presented in 1973. Quite a few solution methods have been developed since then, especially during the last seven years. In this paper most of these methods and some applications will be treated. [ABSTRACT FROM AUTHOR]
We propose a novel approach for solving polynomial programs over compact domains with equality constraints. By means of a genetic transformation, we show that existing solution schemes for the, typically simpler, prob...
详细信息
We propose a novel approach for solving polynomial programs over compact domains with equality constraints. By means of a genetic transformation, we show that existing solution schemes for the, typically simpler, problem without equalities can be used to address the problem with equalities. (C) 2007 Elsevier B.V. All rights reserved.
A DNA algorithm by operating on plasmids was presented to solve a special integer programming, a typical hard computing problem. The DNA algorithm employed double-stranded molecules to encode variables of 0-1 programm...
详细信息
A DNA algorithm by operating on plasmids was presented to solve a special integer programming, a typical hard computing problem. The DNA algorithm employed double-stranded molecules to encode variables of 0-1 programming problem, the encoded DNA molecules were inserted into circular plasmids as foreign DNA molecules. Followed by, a series of enzymatic treatments to plasmids were performed in order to find feasible solutions to the given problem. The final optimum was obtained by applying founded feasible solutions to object function. Compared with other DNA algorithms of integer programming problem, the proposed algorithm is simple, error-resistant, above all, feasible. Our work clearly showed the distinct advantages of plasmid DNA computing model when solving integer related programming problem.
Two examples of parametric cost programming problems—one in network programming and one in NP-hard 0-1 programming—are given; in each case, the number of breakpoints in the optimal cost curve is exponential in the s...
详细信息
Two examples of parametric cost programming problems—one in network programming and one in NP-hard 0-1 programming—are given; in each case, the number of breakpoints in the optimal cost curve is exponential in the square root of the number of variables in the problem.
A sequential simulation procedure (which requires shorter com puter running time than a nonsequential one) is an effective method for solving stochastic personnel scheduling models. The time needed for a particular em...
详细信息
A sequential simulation procedure (which requires shorter com puter running time than a nonsequential one) is an effective method for solving stochastic personnel scheduling models. The time needed for a particular employee to perform a given activ ity is assumed to be a random number with a given distribution.
We address the issue of generating cutting planes for mixed integer programs from multiple rows of the simplex tableau with the tools of disjunctive programming. A cut from q rows of the simplex tableau is an intersec...
详细信息
We address the issue of generating cutting planes for mixed integer programs from multiple rows of the simplex tableau with the tools of disjunctive programming. A cut from q rows of the simplex tableau is an intersection cut from a q-dimensional parametric cross-polytope, which can also be viewed as a disjunctive cut from a 2q-term disjunction. We define the disjunctive hull of the q-row problem, describe its relation to the integer hull, and show how to generate its facets. For the case of binary basic variables, we derive cuts from the stronger disjunctions whose terms are equations. We give cut strengthening procedures using the integrality of the nonbasic variables for both the integer and the binary case. Finally, we discuss some computational experiments.
A fundamental problem in third-generation mobile systems is the adaptation of the channel allocation to the traffic volume variation. Traffic adaptation may be partly achieved by the following (aggregate channel alloc...
详细信息
A fundamental problem in third-generation mobile systems is the adaptation of the channel allocation to the traffic volume variation. Traffic adaptation may be partly achieved by the following (aggregate channel allocation) problem: given the set of channels, the cell structure and the load to be accommodated in each cell within a certain time zone, find the optimal allocation of channels to cells subject to the restrictions arising from the minimum permissible distance of cells where the same channel can be used at the same time. In this paper the problem is optimally formulated and efficiently solved by a heuristic. In the sequel the performance of a combined channel management scheme that uses the above problem for handling major traffic variations and a distributed DCA scheme for handling local traffic variations is assessed. Finally, results are presented and some concluding remarks are made. (C) 1998 John Wiley & Sons, Ltd.
Existing multicriteria analysis (MCA) methods are probably ineffective in selecting a supplier combination. Thus, an MCA-based fuzzy 0-1 programming method is introduced. The programming relates to a simple MCA matrix...
详细信息
Existing multicriteria analysis (MCA) methods are probably ineffective in selecting a supplier combination. Thus, an MCA-based fuzzy 0-1 programming method is introduced. The programming relates to a simple MCA matrix that is used to select a single supplier. By solving the programming, the most feasible combination of suppliers is selected. Importantly, this result differs from selecting suppliers one by one according to a single-selection order, which is used to rank sole suppliers in existing MCA methods. An example highlights such difference and illustrates the proposed method.
暂无评论