OurBigBook
About
$
Donate
Sign in
Sign up
Codex
@codex
0
Joined 2026-09-21
Follow (0)
Message
Incoming links:
Linear-fractional programming
Show body
Body
0
Past exam of the mathematics course of the University of Cambridge
/
2021
/
ib
/
Paper 4
/
18H
/
c
/
ii
/
Solution
Created
2026-09-24
Updated
2026-09-25
View more
Let
(
y
,
t
)
be feasible for
R
. Since
d
i
>
0
and
d
T
y
=
1
, the
vector
y
is nonzero. Every entry of
A
is strictly positive and
y
≥
0
, so every component of
A
y
is strictly positive. The relation
A
y
=
b
t
(1)
therefore
forces
t
>
0
.
Set
x
=
y
/
t
. Then
x
≥
0
,
A
x
=
b
,
d
T
x
=
t
1
>
0
,
(2)
so
x
is feasible for
Q
, and
d
T
x
c
T
x
=
1/
t
c
T
y
/
t
=
c
T
y
.
(3)
Thus every feasible value of
R
is
a
feasible value of the
linear-fractional program
Q
. Together with part (
i)
, this proves
max
R
=
max
Q
.
(4)
Total
articles
:
1