CO227 Lecture Notes - Lecture 5: Linear Programming, Travelling Salesman Problem, Ellipsoid Method
30 May 2017
School
Department
Course
Professor
Document Summary
The amount of weight in kg he will lose can be determined by the formula 5x2 y where x is the # of hours he exercise and y is the kg of food he consumes. Prof roh can do at most 3 hrs of exercise. He needs to eat at least 1 kg of food/day. He needs extra food in order to exercise where y2-x2-xy= 1. We need to solve a nonlinear program since some of the expressions are not linear: In general, nonlinear programs are the hardest to solve since the objective function and the constraints can be anything. Note: if a nonlinear program has an integer variable constraint, we still consider it a nonlinear program. Dealing /w nonlinear expressions is much harder than dealing with variable and linear expressions. In summary, there are 3 main types of programs:
