This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 1/29/2008 1 Section 5.3 Nonstandard and minimization problems In this section we will look at linear programming problems that are “not quite” standard –maximum type. These may include problems where: 1) We are trying to minimize the objective f ti function OR 2) One or more of the structural constraints is ≥ Before we solve these nonstandard problems, we turn the problem into a maximum ‐ type problem which means: 1) The objective function is to be maximized. (Note: to change an objective function is minimized at the objective function is minimized at the same point that its negative is maximized. 2) The non ‐ negativity constraints are present And… 3) All structural constraints are of the form (Note: unlike standard maximum type c by ax ≤ + + ... problems, c does not have to be non-negative and it may be necessary to multiply both sides of an inequality by -1 to get the inequality in the right form.) Since we have taken the non ‐ negativity requirement off c in our structural constraints, it is possible...
View Full Document
- Spring '08
- Addition, consultant, Advertising Revenues, WMJX