On Graphical Optimization of Linear Programming Models in the Column Space
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60460709%3A41110%2F13%3A63594" target="_blank" >RIV/60460709:41110/13:63594 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
čeština
Original language name
On Graphical Optimization of Linear Programming Models in the Column Space
Original language description
The necessary conditions for representing and solving a linear programming model graphically are well known. The model should contain up to two decision variables (a number of constraints could be unlimited, but finite) or up to two constraints (a numberof decision variables could be unlimited, but finite). In the first case, we solve the model graphically in a so called ?Row Space?, where the axes of the graph represent decision variables. In the other case, we solve the model in a so called ?Column Space?, where the axes represent individual constraints. In this paper, we focus on the optimization of linear programming models in the Column Space. There is a standard procedure to solve it, but it can be used if and only if all cost coefficients in the objective function are positive or zero. We make the procedure more general and show how to carry out the graphical optimization in the Column Space correctly, even if at least one cost coefficient is negative. We also demonstrate the p
Czech name
On Graphical Optimization of Linear Programming Models in the Column Space
Czech description
The necessary conditions for representing and solving a linear programming model graphically are well known. The model should contain up to two decision variables (a number of constraints could be unlimited, but finite) or up to two constraints (a numberof decision variables could be unlimited, but finite). In the first case, we solve the model graphically in a so called ?Row Space?, where the axes of the graph represent decision variables. In the other case, we solve the model in a so called ?Column Space?, where the axes represent individual constraints. In this paper, we focus on the optimization of linear programming models in the Column Space. There is a standard procedure to solve it, but it can be used if and only if all cost coefficients in the objective function are positive or zero. We make the procedure more general and show how to carry out the graphical optimization in the Column Space correctly, even if at least one cost coefficient is negative. We also demonstrate the p
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 31st International Conference Mathematical Methods in Economics 2013
ISBN
978-80-87035-76-4
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
89-94
Publisher name
College of Polytechnics Jihlava
Place of publication
Jihlava
Event location
Jihlava
Event date
Sep 11, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—