Linear optimization: Mathematical formulations of problems presented in the course 2

Aus Operations-Research-Wiki
Wechseln zu: Navigation, Suche

Introduction

Linear optimization deals with the optimization of linear goal functions considering certain restrictions. One can either maximize or minimize a goal function.

Standart Form

The standard form consists of three parts which can be described as: • Goal function (to maximize/minimize):

• Restrictions:


• Non-negative variables:


The problem can be solved in two ways: 1) Graphically, when the function is dependend on 2 variables 2) With Simplex- Algorithm, when the function is dependend on multiple variables

Example of Linear Optimization

Example of simplex algorithmus