Mathematical Institute eLibrary of Mathematical Instituteof the Serbian Academy of Sciences and Arts Mathematical Institute
> Home / All Journals / Journal /
 
Front Page Yugoslav Journal of Operations ResearchPublisher: Faculty of Organizational Sciences, BelgradeISSN: 0354-0243Issue: 19_1Date: 2009Journal Homepage
 

An Overview on Polynomial Approximation of NP-Hard Problems 3 - 40
Vangelis Th. Paschos  
AbstractKeywords: Computational complexity, approximation algorithms.MSC: 90-02 90C60DOI: 10.2298/YJOR0901003PZbl: 1274.90005
On Duality for Nonsmooth Lipschitz Optimization Problems 41 - 47
Vasile Preda, Miruna Beldiman and Anton Bătătorescu  
AbstractKeywords: Nonsmooth Lipschitz vector optimization, Fritz John type necessary optimization conditions, duality theorems.MSC: 90C46DOI: 10.2298/YJOR0901041PZbl: 1224.90210
Optimality and Duality for a Class of Nondifferentiable Minimax Fractional Programming Problems 49 - 61
Antoan Bătătorescu, Miruna Beldiman, Iulian Antonescu and Roxana Ciumara  
AbstractKeywords: Fractional programming, generalized invexity, optimality conditions, duality.MSC: 90C32 90C46 90C47DOI: 10.2298/YJOR0901049BZbl: 1224.90188
Duality for Multiobjective Fractional Programming Problems Involving $d$-Type-I -Set $n$-Functions 63 - 73
I.M. Stancu-Minasian, Gheorghe Dogaru and Andreea Mădălina Stancu  
AbstractKeywords: d-type-I set functions, multiobjective programming, duality results.MSC: 90C32 90C29 90C46DOI: 10.2298/YJOR0901063SZbl: 1224.90190
On Solving Stochastic MADM Problems 75 - 83
Ion Văduva and Cornel Resteanu  
AbstractKeywords: Multiple attribute decision making, stochastic MADM problems, stochastic entries, entropy, informational energy.MSC: 90B50 91B06DOI: 10.2298/YJOR0901075VZbl: 1199.90017
Efficiency and Duality for Multiobjective Fractional Variational Problems With $( ho, b)$-Quasiinvexity 85 - 99
Ştefan Mititelu and I. M. Stancu-Minasian  
AbstractKeywords: Duality, fractional variational problem,quasi-invexity.MSC: 90C46 90C29DOI: 10.2298/YJOR0901085MZbl: 1274.90483
Gordon and Newell Queueing Networks and Copulas 101 - 112
Daniel Ciuiu  
AbstractKeywords: Gordon and newell queueing networks, copula.MSC: 90B15 62H20DOI: 10.2298/YJOR0901101CZbl: 1199.90002
Realization of Knapsack Problem Solving Algorithm and some of Its Applications 113 - 122
Dimiter Ivanchev and Elena Radovanova  
AbstractKeywords: Knapsack problem, algorithmic realization, optimum budget, network optimization.MSC: 90C27DOI: 10.2298/YJOR0901113IZbl: 1274.90317
A Primal-Dual Exterior Point Algorithm for Linear Programming Problems 123 - 132
Nikolaos Samaras, Angelo Sifaleras and Charalampos Triantafyllidis  
AbstractKeywords: Linear optimization, simplex-type algorithms, primal-dual exterior point algorithm, computational study.MSC: 90C05DOI: 10.2298/YJOR0901123SZbl: 1274.90223
Using Simplex Method in Verifying Software Safety 133 - 148
Milena Vujošević-Janičić, Filip Marić and Dušan Tošić  
AbstractKeywords: Simplex method, software safety, buffer overflows.MSC: 90C05 90C90DOI: 10.2298/YJOR0901133VZbl: 1274.90227
Article page: 12>>




Remote Address: 54.198.210.67 • Server: elib.mi.sanu.ac.rsHTTP User Agent: CCBot/2.0 (http://commoncrawl.org/faq/)