线性灵敏度分析与约束优化.pdfVIP

(1)解答:

1.

将原线性规划问题化为形,

得

$$

\begin{array}{l}

\max

z

=‑

5

x

_

{1}

+5x

_

{2}

+13x

_

{3}

+0\cdot

x

_

{4}

+0\cdot

x

_

{5}

\\

\text{满足条件}

\left\{

\begin{array}{l

l}

{‑

x

_

{1}

+x

_

{2}

+3x

_

{3}

+x

_

{4}}

{=20}

\\

{1

2

(1)解:1.将原线性规划问题化为形,得

$$\begin{array}{l}\maxz=-5x_{1}+5x_{2}+13x_{3}+0\cdotx_{4}+0\cdotx_

{5}\\S.t.\left\{\begin{array}{ll}{-x_{1}+