We study the multi-play budgeted multi-armed bandit (MP-BMAB) problem, in which pulling an arm receives both a random reward and a random cost, and a player pulls L( 1) arms at each round. The player targets at maximizing her total expected reward under a budget constraint B for the pulling costs. We present a multiple ratio confidence bound policy: At each round, we first calculate a truncated...

In this paper, we present modified fuzzy goal programming (FGP) approach and generalized MATLAB program for solving multi-level linear fractional programming problems (ML-LFPPs) based on with some major modifications in earlier FGP algorithms. In proposed modified FGP approach, solution preferences by the decision makers at each level are not considered and fuzzy goal for the decision vectors i...

An exact semidefinite linear programming (SDP) relaxation of a nonlinear semidefinite programming problem is a highly desirable feature because a semidefinite linear programming problem can efficiently be solved. This paper addresses the basic issue of which nonlinear semidefinite programming problems possess exact SDP relaxations under a constraint qualification. We do this by establishing exa...

Pairwise comparison matrices are often used in multicriteria decision making (MCDM). The most critical part of this technique is the inconsistency, which emerges for logical reasons but can cause significant problems during process. Hence it necessary to keep inconsistency below an acceptable threshold. In order support maker (DM) a rational decision, we must mind following: Our suggestion shou...

Several sequential approximation algorithms are based on the following paradigm: solve a linear or semideenite programming relaxation , then use randomized rounding to convert fractional solutions of the relaxation into integer solutions for the original combinatorial problem. We demonstrate that such a paradigm can also yield parallel approximation algorithms by showing how to convert certain ...

The stabilization problem for fractional linear continuous-time systems having bounded positive control is solved, with the additional condition of non negativity of the states. Thus, a methodology to develop state-feedback controllers is proposed, based on Linear Programming conditions. An illustrative example is provided to show the usefulness of the results.

fuzzy linear programming problem occur in many elds such as mathematical modeling, control theory and management sciences, etc. in this paper we focus on a kind of linear programming with fuzzy numbers and variables namely fully fuzzy linear programming (fflp) problem, in which the constraints are in inequality forms. then a new method is proposed to ne the fuzzy solution for solving (fflp). ...