Principles of Mathematics in Operations Research

104 8 Linear Programming

Canonical form:

Min z =c x + 6 y

s.t.

Ax — y = 6

x,y>0

<S=>

Example 8.1.2

Min z =2x + 3y

s.t.

2x + y>6

x + 2y>6

x,y>0.

Min z^c'ie^1 }

s.t.

x

>e.

v

= b

Feasible

set

Fig. 8.1. The feasible solution region in Example 8.1.2

See Figure 8.1.

A =

"12

2 1

-1 0'

0-1 ,6 =

"6'

6 ,c =

[2]

3

0

0