Article
Full entry |
PDF
(0.3 MB)
Feedback
PDF
(0.3 MB)
Feedback
Summary:
At universities focused on economy, Operation Research topics are usually included in the study plan, including solving of Linear Programming problems. A universal tool for their algebraic solution is (numerically difficult) Simplex Algorithm, for which it is necessary to know at least the fundamental of Matrix Algebra. To illustrate this method of solving LP problems and to discuss all types of results, it seems to be very convenient to include a chapter about graphic solutions to LP problems. Moreover, this way of solution can be explained separately as well, and already at the secondary school. It only requires the knowledge of graphic representations of linear objects and their geometry. In 2D, we can solve two-dimensional problems by planimetry methods and oblique projection, thus avoiding the usage of more complicated methods of descriptive geometry. In 3D, we can solve three-dimensional problems by stereometry methods.
References:
[1] Kubišová, A.: Operační výzkum. (2014). Jihlava: VŠPJ.
[2] Kubišová, A.: Solving linear operation research optimization problems in MS Office 2010 Excel spreadsheet. (2014). Logos Polytechnikos, 5(3), 15-28.
Search
Partner of
