Linear Optimization (1:640:354:05) 
Spring 1999, Professor Ben-Israel 
Assignment 1: LP Formulation and   Rn Geometry

Date: Thursday, January 21
Due: Tuesday, February 2

This assignment has four problems, of equal weight. For each of the first three problems, write an algebraic linear program as we did in class.

Use the "standard" format, starting with clear definitions of the decision variables as quantities. For example, write "x1 = number of regular widgets to produce," not "x1 = regular". Once you have defined variables, write the problem in the form:

Minimize
or
Maximize
Objective Function
Subject To Constraint 1
Constraint 2
etc.

Customarily, the constraints involving more than one decision variable are listed first, followed by the simpler constraints like "x1 >  0"


1   Text, p. 57, Exercise 2.

2   Text, p. 57, Exercise 4.

3   Text, p. 57, Exercise 6.

4   This problem has three parts.


Return to the HW Assignments page