Linear Programming and Optimization

A large class of problems appear in different industries and can be expressed mathematically so that the solution be clear by maximizing or minimizing a benefit or cost function under a set of linear constraints. The linear programming and network optimization offer a range of solutions to these problems. The algorithms of the solutions are often polynomial time and require the computer being. Students will learn the basic methods of linear programming and their implementation in computers.

Objectives

The course aims to give students the necessary tools to solve optimization problems by means of linear programming. Using LINDO software package makes it possible to implement and study the methods presented in the theory. Upon successful completion of this course the student will be able to: • to model an optimization problem. • To plan the feasible region and to identify the optimal solution. • to implement the method Simplex • to model and solve problems, and binary integer programming. • to recognize transportation problems and special cases such • using the LINDO in linear programming problems.

Prerequisites

No

Syllabus

Ιntroductory Concepts Introduction to Linear Programming Graphical solution of linear programming problems. Sensitivity analysis of the problems according to the graphic solution. basic solutions Simplex method Specific cases Simplex method Sensitivity analysis of the respective problems. Integer programming binary Programming Special linear programming problems Problem transportation Problem award, Cutting Stock Problem Lindo software