508 research outputs found
Modeling uncertainty in linear programming
Proposes a decision making under uncertainty approach for treating linear programming under uncertainty. The author formulates a payoff matrix for the linear program and then apply the usual decision analysis criteria. Also, the problems encountered in converting a linear program under uncertainty to one under ris
Modeling uncertainty in linear programming
Proposes a decision making under uncertainty approach for treating linear programming under uncertainty. The author formulates a payoff matrix for the linear program and then apply the usual decision analysis criteria. Also, the problems encountered in converting a linear program under uncertainty to one under ris
An Algorithm for the Assignment Problem with Stochastic Side Constraints
In this paper, we consider the assignment problem with stochastic side constraints, and propose a practical algorithm for solving it. Such a problem may arise, for example, when the assignment requires some scarce resources and the total amounts of those resources are subject to a random variation. Therefore, the problem seems quite general and significant in practice. This algorithm takes a special structure of the problem into account, and may be regarded as a heuristic modification of the method for two-stage linear programming under uncertainty. Although we cannot guarantee that the solution obtained by the proposed algorithm will coincide with the true optimal solution of the problem, our limited computational experience on small test problems indicates that good approximate solutions can be obtained in a fairly small computation time
Submodular Stochastic Probing on Matroids
In a stochastic probing problem we are given a universe , where each
element is active independently with probability , and only a
probe of e can tell us whether it is active or not. On this universe we execute
a process that one by one probes elements --- if a probed element is active,
then we have to include it in the solution, which we gradually construct.
Throughout the process we need to obey inner constraints on the set of elements
taken into the solution, and outer constraints on the set of all probed
elements. This abstract model was presented by Gupta and Nagarajan (IPCO '13),
and provides a unified view of a number of problems. Thus far, all the results
falling under this general framework pertain mainly to the case in which we are
maximizing a linear objective function of the successfully probed elements. In
this paper we generalize the stochastic probing problem by considering a
monotone submodular objective function. We give a -approximation algorithm for the case in which we are given
matroids as inner constraints and matroids as outer constraints.
Additionally, we obtain an improved -approximation
algorithm for linear objective functions
Penghasilan manual rjngkas penggunaan alat Total Station Sokkia Set5f dan Perisian Sdr Mapping & Design untuk automasi ukur topografi
Projek ini dilaksanakan untuk menghasilkan manual ringkas penggunaan alat Total Station Sokkia SET5F dan Perisian SDR Mapping & Design dalam menghasilkan pelan topografi yang lengkap mengikut konsep field to finish. Manual telah dihasilkan dalam dua bentuk iaitu buku dan CD-ROM. Manual ini telah dinilai berdasarkan data yang diperolehi daripada 7 orang responden melalui kaedah Borang Penilaian Manual. Analisis data dilakukan menggunakan perisian SPSS versi 11.0. Hasil analisis skor min menunjukkan kesemua responden bersetuju bahawa manual dalam bentuk buku ini menarik Min ( M ) ^ ^ dan Sisihan Piawai (SD) = .535 tetapi kurang interaktif (M) = 2.29 dan (SD) = 0.488. Berbanding dengan manual dalam format CD-ROM yang mencatat nilai (M) = 3.57 dan (SD) = 0.535 semua responden bersetuju bahawa manual ini mesra pengguna dan lebih interakti
An Interactive Fuzzy Satisficing Method for Fuzzy Random Multiobjective 0-1 Programming Problems through Probability Maximization Using Possibility
In this paper, we focus on multiobjective 0-1 programming problems under the situation where stochastic uncertainty and vagueness exist at the same time. We formulate them as
fuzzy random multiobjective 0-1 programming problems where coefficients of objective functions are fuzzy random variables. For the formulated problem, we propose an interactive fuzzy satisficing method through probability maximization using of possibility
Strict Solution Method for Linear Programming Problem with Ellipsoidal Distributions under Fuzziness
This paper considers a linear programming problem with ellipsoidal distributions including fuzziness. Since this problem is not well-defined due to randomness and fuzziness, it is hard to solve it directly. Therefore, introducing chance constraints, fuzzy goals and possibility measures, the proposed model is transformed into the deterministic equivalent problems. Furthermore, since it is difficult to solve the main problem analytically and efficiently due to nonlinear programming, the solution method is constructed introducing an appropriate parameter and performing the equivalent transformations
Recommended from our members
A two-stage stochastic programming with recourse model for determining robust planting plans in horticulture
A two-stage stochastic programming with recourse model for the problem of determining optimal planting plans for a vegetable crop is presented in this paper. Uncertainty caused by factors such as weather on yields is a major influence on many systems arising in horticulture. Traditional linear programming models are generally unsatisfactory in dealing with the uncertainty and produce solutions that are considered to involve an unacceptable level of risk. The first stage of the model relates to finding a planting plan which is common to all scenarios and the second stage is concerned with deriving a harvesting schedule for each scenario. Solutions are obtained for a range of risk aversion factors that not only result in greater expected profit compared to the corresponding deterministic model, but also are more robust
Maximin and maximal solutions for linear programming problems with possibilistic uncertainty
We consider linear programming problems with uncertain constraint coefficients described by intervals or, more generally, possi-bility distributions. The uncertainty is given a behavioral interpretation using coherent lower previsions from the theory of imprecise probabilities. We give a meaning to the linear programming problems by reformulating them as decision problems under such imprecise-probabilistic uncer-tainty. We provide expressions for and illustrations of the maximin and maximal solutions of these decision problems and present computational approaches for dealing with them
- âŠ