Exam 14: Optimization Models

When we solve a nonlinear programming problem (NLP),it is very possible that Solver will obtain a suboptimal solution.

A local optimal solution is better than all nearby solutions,but a solution far away might be better than it.

A manufacturer can sell product 1 at a profit of $2 per unit and product 2 at a profit of $6 per unit.Three units of raw material are needed to manufacture one unit of product 1,and 6 units of raw material are needed to manufacture unit of product 2.A total of 120 units of raw material are available.If any of product 1 is produced,a setup cost of $10 is incurred,and if any of product 2 is produced,a setup cost of $20 is incurred.Determine how to maximize the manufacturer's profit.

A large accounting firm has three auditors.Each can work up to 180 hours during the next month,during which time three projects must be completed.Project 1 takes 140 hours,Project 2 takes 150 hours,and Project 3 takes 170 hours.The amount per hour that can be billed for assigning each auditor to each project is given in the table below: Determine how to maximize total billings during the next month by formulating the company's problem as a transportation model.

In a transportation problem,if it costs $4 per item to ship up to 200 items between cities,and $2 per item for each additional item,the proportionality assumption of LP is satisfied.

If Solver fails to find an optimal solution to an integer programming problem,we might be able to find a near optimal solution by increasing the Integer Optimality setting.

In a network representation of a transportation problem,the nodes generally represent