没有合适的资源?快使用搜索试试~ 我知道了~
资源推荐
资源详情
资源评论







格式:pdf 资源大小:155.4KB









格式:zip 资源大小:2.0MB


格式:zip 资源大小:441.9KB

格式:zip 资源大小:1.0MB

格式:zip 资源大小:1.6MB






An Analysis of Dinkelbach's Algorithm
for
0-1 Fractional Programming Problems
Tomomi MATSUI * Yasufumi SARUWATARI
y
Maiko SHIGENO
z
(METR92-14, December 1992 )
* Department of Mathematical Engineering and Information Physics
Faculty of Engineering, UniversityofTokyo
Bunkyo-ku, Tokyo 113, Japan
y
Department of So cial Sciences
The National Defense Academy
Hashirimizu, Yokosuka, Kanagawa 239, Japan
z
Department of Management Science
Science UniversityofTokyo
Kagurazaka, Shinjuku-ku, Tokyo 162, Japan
Abstract:
The 0-1 fractional programming problem minimizes the fractional ob-
jective function (
c
1
x
1
+
c
2
x
2
+
111
+
c
n
x
n
)
=
(
d
1
x
1
+
d
2
x
2
+
111
+
d
n
x
n
)=
cx
=
dx
un-
der the condition that
x
=(
x
1
;
111
;x
n
)
2
f
0
;
1
g
n
;
where is the set of
feasible solutions. For a fractional programming problem, Dinkelbach developed an
algorithm which obtains an optimal solution of the given problem by solving a se-
quence of subproblems Q(
), in which the linear ob jective function
cx
0
dx
is
minimized under the same condition
x
2
:
In this pap er, we show that Dinkel-
bach's algorithm solves at most O(log(
nM
)) subproblems in the worst case, where
M
= max
f
max
i
=1
;
2
;
111
;n
j
c
i
j
;
max
i
=1
;
2
;
111
;n
j
d
i
j
;
1
g
:
1

1 0-1 Fractional Programming Problems
The problem of maximizing or minimizing the ratio of two linear functions is called
a fractional programming problem and/or a hyperbolic programming problem. Fractional
programming problems are found in various elds [22]. A frequent example which o ccurs
in economics is nding the most favorable ratio of revenues and allo cations sub ject to re-
strictions on the availability of goo ds. In addition, measures of eciency for a system are
represented as ratios such as prot/time, return/risk and cost/time. There are a lot of arti-
cles which dealing with analysis and algorithms for this class of problems [3, 5, 12, 20, 24].
There are several classes of fractional programming problems that have b een studied ex-
tensively. Those are 0-1 fractional programming problems [1], which include minimal ratio
spanning tree problems [4], minimum ratio circuit problems [8, 6, 19], fractional knapsack
problems [15], and fractional cutting stock problems [10]. In this pap er, we study 0-1 frac-
tional programming problems described b elow.
Let
c
=(
c
1
;c
2
;
111
;c
n
) and
d
=(
d
1
;d
2
;
111
;d
n
)be
n
-dimensional integer vectors. Then
a 0-1 fractional programming problem is formulated as:
FP: minimize
n
X
i
=1
c
i
x
i
n
X
i
=1
d
i
x
i
=
cx
dx
;
sub ject to
x
2
f
0
;
1
g
n
;
where
x
denotes the column vector (
x
1
;x
2
;
111
;x
n
)
T
:
The subset of 0
0
1valued vectors
is called
feasible region,
and when a 0
0
1valued vector
x
is an element of
;
we say
x
is a
feasible solution.
Throughout the pap er, we assume that for any feasible
solution
x
;
the value
dx
is p ositive. Here we denote
C
= max
f
max
i
=1
;
111
;n
j
c
i
j
;
1
g
and
D
= max
f
max
i
=1
;
111
;n
j
d
i
j
;
1
g
:
Then, it is clear that the optimal value of the problem is in the
interval [
0
nC; nC
]
:
For fractional programming problems, there are many algorithms which solve a sequence
of 0-1 integer programming problems with linear ob jective function describ ed below.
Q(
): minimize
cx
0
dx
sub ject to
x
2
f
0
;
1
g
n
:
2
剩余9页未读,继续阅读
资源评论


Sunny.156
- 粉丝: 0
上传资源 快速赚钱
我的内容管理 展开
我的资源 快来上传第一个资源
我的收益
登录查看自己的收益我的积分 登录查看自己的积分
我的C币 登录后查看C币余额
我的收藏
我的下载
下载帮助


最新资源
- Java课程设计方案报告-酒店客房管理系统.doc
- 各国强化工业互联网战略标准化成重要切入点.docx
- ANSYS有限元软件建模基础.ppt
- 互联网+对高职学生思想政治教育的影响及其应对探析.docx
- 地铁弱电系统IP网络分配建议方案.docx
- 基于虚拟现实技术的网络会展发展展望.docx
- 数学物理化学生物地理常用软件介绍.doc
- 通信行业发展情况分析-行业集中度整体趋势上行.docx
- 大学设计方案松下FPC型PLC实现交通灯控制大学方案.doc
- 单片机乳化物干燥过程控制系统设计方案.docx
- 物联网工程专业C++程序设计教学改革探索.docx
- 单片机研究分析报告路抢答器.doc
- PLC控制的生活给水泵系统设计.doc
- 非授权移动接入在GSM网络应用中的安全分析.docx
- 2019年二级建造师建设工程项目管理精品小抄.doc
- 《数据库系统》教学设计.doc
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈



安全验证
文档复制为VIP权益,开通VIP直接复制
