Modified Simplex Algorithm for Solving Non-Convex PWLP Models
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60460709%3A41110%2F03%3A00006183" target="_blank" >RIV/60460709:41110/03:00006183 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Modified Simplex Algorithm for Solving Non-Convex PWLP Models
Original language description
The known algorithms for solving the piecewise linear programming (PWLP) models can be divided into two groups by the type of the objective function of the model. If it is a convex function, the model is rewritten in the form solvable by the standard sim
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
GM - Food industry
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GP525%2F02%2FD172" target="_blank" >GP525/02/D172: Application of the Fuzzy Logic in Food Appreciation</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2003
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
Sborník konference Matematical methods in economics
ISBN
80-213-1046-4
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
1-5
Publisher name
Neuveden
Place of publication
Praha
Event location
Praha
Event date
Jan 1, 2003
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—