next up previous contents
Next: Case Study Up: Linear Programming Models Previous: Investing over Time

Problems

Modeling is an art, and it takes practice. The following examples show the variety of problems that can be attacked by linear programming, and give you the opportunity to try your hand at some problems.

exercise2233

exercise2236

exercise2242

  exercise2245

exercise2251

exercise2254

exercise2263

exercise2272

exercise2286

  exercise2289

  exercise2294

  exercise2299

  exercise2304

  exercise2308

  exercise2312

  exercise2318

  exercise2324

  exercise2328

Answers to Exercise 61:

(a) Let tex2html_wrap_inline5252 be the number of toasters produced manually, tex2html_wrap_inline5256 be the number produced semiautomatically, and tex2html_wrap_inline5270 be the number produced robotically.

The objective is to Minimize tex2html_wrap_inline8090 .

The constraints are:

tex2html_wrap_inline8092 (produce enough toasters)

tex2html_wrap_inline8094 (skilled labor used less than or equal to amount available).

tex2html_wrap_inline8096 (unskilled labor constraint)

tex2html_wrap_inline8098 (assembly time constraint)

tex2html_wrap_inline8100 (nonnegativity of production)

(b) Add a constraint tex2html_wrap_inline8102

(c) Add a variable tex2html_wrap_inline8104 to represent the assembly time slack. Add tex2html_wrap_inline8106 to the objective. Change the assembly time constraint to

tex2html_wrap_inline8108 (assembly time constraint)

tex2html_wrap_inline8110



Michael A. Trick
Mon Aug 24 16:30:59 EDT 1998