## Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

## If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

# LINEÆR PROGRAMMERING

SVEN DANØ
Nordisk Matematisk Tidskrift
Vol. 4, No. 3 (1956), pp. 121-138
Stable URL: http://www.jstor.org/stable/24524427
Page Count: 18
Preview not available

## Abstract

The general problem of "linear programming" can be formulated as follows: Find a set of non-negative numbers x1, x2,..., xn, which satisfy a system of linear equations (1) ai1x1+ai2x2+...+ainxn = bi (i = 1, 2,..., m), and for which the linear function f = c1x1+c2x2+...+cnxn has a maximum (or minimum). The case of inequalities in (1) can be reduced to the above form, by introducing the non-negative differences between the sides of the inequalities as new "slack variables". After a geometrical treatment of the simple case m=1, n=2, the following theorem is proved: If the general problem (with m

• 121
• 122
• 123
• 124
• 125
• 126
• 127
• 128
• 129
• 130
• 131
• 132
• 133
• 134
• 135
• 136
• 137
• 138
s