Solving a nonlinear integer program for allocating resources
نویسندگان
چکیده
An algorithm for solving a nonlinear integer program for resource allocation is proposed. This algorithm is efficient and relatively simple. c © 2006 Elsevier Ltd. All rights reserved.
منابع مشابه
Method for Solving a Convex Integer Programming Problem
We consider a convex integer program which is a nonlinear version of the assignment problem. This problem is reformulated as an equivalent problem. An algorithm for solving the original problem is suggested which is based on solving the simple assignment problem via some of known algorithms.
متن کاملA Feasibility Pump for mixed integer nonlinear programs
Abstract We present an algorithm for finding a feasible solution to a convex mixed integer nonlinear program. This algorithm, called Feasibility Pump, alternates between solving nonlinear programs and mixed integer linear programs. We also discuss how the algorithm can be iterated so as to improve the first solution it finds, as well as its integration within an outer approximation scheme. We r...
متن کاملAn Algorithm for Solving the Linear Integer Programming Problem over a Finite Additive Group, with Extensions to Solving General Linear and Certain Nonlinear Integer Problems
Ralph Gomory has recently aroused interest in a special type of knapsack problem in which the constraint coefficients and constant term are elements of a finite additive group. The significance of this problem lies in the fact that it is closely related to the general integer linear programming problem, resulting by removing the nonnegativity restrictions on those variables in the general probl...
متن کاملResource Management in Multi-* Clusters: Cloud Provisioning
Cloud computing – running large-scale computationand data-intensive services on inexpensive onthe-fly clusters – has become increasingly popular in recent years due to the advent of MapReduce and similar large-scale data parallel systems. Cloud provisioning, i.e., allocating resources for cluster requests, is the first step toward instantiating such clusters. In this report, we formally define ...
متن کاملAn Evolutionary Algorithm for Zero-one Nonlinear Optimization Problems Based on an Objective Penalty Function Method
In many evolutionary algorithms, as fitness functions, penalty functions play an important role. In order to solve zero-one nonlinear optimization problems, a new objective penalty function is defined in this paper and some of its properties for solving integer nonlinear optimization problems are given. Based on the objective penalty function, an algorithm with global convergence for integer no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical and Computer Modelling
دوره 44 شماره
صفحات -
تاریخ انتشار 2006