Approximate Methods for Solving Chance Constrained Linear Programs in Probability Measure Space
A risk-aware decision-making problem can be formulated as a chance-constrained linear program in probability measure space. Chance-constrained linear program in probability measure space is intractable, and no numerical method exists to solve this ...
Ito, Satoshi, Shen, Xun
core
Approximate Methods for Solving Chance-Constrained Linear Programs in Probability Measure Space [PDF]
The version of record of this article, first published in Journal of Optimization Theory and Applications, is available online at Publisher’s website: https://doi.org/10.1007/s10957-023-02342-w.A risk-aware decision-making problem can be formulated as a ...
Ito, Satoshi, Shen, Xun
core +1 more source
Transverse Cracking in a Fiber Reinforced Ceramic Matrix Composite [PDF]
The purpose of this study was to investigate the transverse cracking behavior of a fiber reinforced ceramic matrix composite. The major objectives were to determine the crack initiation stress and the minimum transverse crack spacing for different cross ...
Bachmann, Steven E.
core +1 more source
Beiträge zur Robusten Optimierung: Netzwerkflüsse, Marktgleichgewichte, Lineare Komplementaritätsprobleme und Pareto-Optimalität [PDF]
In applications, often not all parameters of optimization problems are known precisely, for example, due to measurement inaccuracies or imprecise statistical predictions. Optimization under uncertainty, therefore, plays an increasingly important role in
Biefel, Christian
core +1 more source
Uncertain Chinese Postman Problem with Budget Constraint: A Robust Optimization Approach
The Chinese postman problem (CPP) is a well-known combinatorial optimization problem, that is used in various real-world applications. Modeling such real-world applications frequently necessitates taking into account some uncertain variables.
Chandal Nahak, M. Das, M.P. Biswal
core +2 more sources
Anther culture of Sorghum bicolor (L.) Moench [PDF]
Call number: LD2668 .T4 AGRN 1988 W46Master of ...
Wen, Fushi.
core
Non-Smooth, H\"older-Smooth, and Robust Submodular Maximization
We study the problem of maximizing a continuous DR-submodular function that is not necessarily smooth. We prove that the continuous greedy algorithm achieves an $[(1-1/e)\OPT-\epsilon]$ guarantee when the function is monotone and H\"older-smooth, meaning
Ho-Nguyen, Nam +2 more
core
Expedient method for oxidation of alcohol by hydrogen peroxide in the presence of amberlite IRA 400 resin (basic) as phase-transfer catalyst [PDF]
Amberlite IRA 400 (strongly basic), a classical polymer imparts phasetransfer catalysis in the oxidation of primary and secondary alcohols by hydrogen peroxide to give excellent yields of the corresponding carbonyl compounds or carboxylic acids in ...
Bhati, N, Goswami, A, Sarma, K
core
A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
We study a class of polynomial optimization problems with a robust polynomial matrix inequality (PMI) constraint where the uncertainty set itself is defined also by a PMI. These can be viewed as matrix generalizations of semi-infinite polynomial programs,
Guo, Feng, Wang, Jie
core
On modelling planning under uncertainty in manufacturing [PDF]
We present a modelling framework for two-stage and multi-stage mixed 0−1 problems under uncertainty for strategic Supply Chain Management, tactical production planning and operations assignment and scheduling.
Alonso-Ayuso, A. +2 more
core +7 more sources

