Fuzzy limits of capacities in constraints of linear programming problems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F71226401%3A_____%2F15%3A%231006490" target="_blank" >RIV/71226401:_____/15:#1006490 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Fuzzy limits of capacities in constraints of linear programming problems

Popis výsledku v původním jazyce

All coefficients of a mathematical model are usually given exactly in conventional LP problems, therefore the exact optimum can be found. But the limit values are often expressed vaguely in practice, and, as a result, it is necessary to use relaxed capacity limits and a fuzzy concept of solving LP problems. In this article the LP problem of two structural variables is solved, to illustrate a comparison between algebraic and graphic solution. Although the graphical method is not suitable for solving of real economic problems in practice, the shown examples are useful for educational purpose, the illustration of the mutual relationship of both methods helps the students to understand this Operation research topic.

Název v anglickém jazyce

Fuzzy limits of capacities in constraints of linear programming problems

Popis výsledku anglicky

All coefficients of a mathematical model are usually given exactly in conventional LP problems, therefore the exact optimum can be found. But the limit values are often expressed vaguely in practice, and, as a result, it is necessary to use relaxed capacity limits and a fuzzy concept of solving LP problems. In this article the LP problem of two structural variables is solved, to illustrate a comparison between algebraic and graphic solution. Although the graphical method is not suitable for solving of real economic problems in practice, the shown examples are useful for educational purpose, the illustration of the mutual relationship of both methods helps the students to understand this Operation research topic.

Druh

J_ost - Ostatní články v recenzovaných periodicích

CEP obor

—

OECD FORD obor

10103 - Statistics and probability

Projekt

—

Návaznosti

V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

LOGOS POLYTECHNIKOS

ISSN

1804-3682

e-ISSN

—

Svazek periodika

6

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

19

Strana od-do

256-274

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—