default search action
András Prékopa
Person information
- affiliation: Rutgers University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c3]Mariya Naumova, András Prékopa:
Logical analysis of data: Estimation of cause-effect relationship under noise with applications in classification of natural water springs. ISAIM 2022 - 2021
- [j40]Mariya Naumova
, András Prékopa:
Bounding the values of financial derivatives by the use of the moment problem. Ann. Oper. Res. 305(1): 211-225 (2021) - 2020
- [c2]Jinwook Lee, András Prékopa:
On the conditional expectation given Boolean functions of events in the n-space. ISAIM 2020
2010 – 2019
- 2018
- [j39]András Prékopa, Jinwook Lee
Risk tomography. Eur. J. Oper. Res. 265(1): 149-168 (2018) - 2017
- [j38]Jinwook Lee
Extreme value estimation for a function of a random sample using binomial moments scheme and Boolean functions of events. Discret. Appl. Math. 219: 210-218 (2017) - [j37]Munevver Mine Subasi
New bounds for the probability that at least k-out-of-n events occur with unimodal distributions. Discret. Appl. Math. 226: 138-157 (2017) - [j36]Jinwook Lee
On the probability of union in the n-space. Oper. Res. Lett. 45(1): 19-24 (2017) - 2016
- [j35]András Prékopa, Anh Ninh, Gabriela Alexe:
On the relationship between the discrete and continuous bounding moment problems and their numerical solutions. Ann. Oper. Res. 238(1-2): 521-575 (2016) - [j34]András Prékopa, Mariya Naumova
The Discrete Moment Method for the numerical integration of piecewise higher order convex functions. Discret. Appl. Math. 202: 151-162 (2016) - [j33]Kunikazu Yoda, András Prékopa:
Convexity and Solutions of Stochastic Multidimensional 0-1 Knapsack Problems with Probabilistic Constraints. Math. Oper. Res. 41(2): 715-731 (2016) - [j32]Kunikazu Yoda, András Prékopa:
Improved bounds on the probability of the union of events some of whose intersections are empty. Oper. Res. Lett. 44(1): 39-43 (2016) - 2015
- [j31]Merve Unuvar, Eren Erman Ozguven, András Prékopa:
Optimal capacity design under k-out-of-n and consecutive k-out-of-n type probabilistic constraints. Ann. Oper. Res. 226(1): 643-657 (2015) - [j30]Jinwook Lee, András Prékopa:
Decision-making from a risk assessment perspective for Corporate Mergers and Acquisitions. Comput. Manag. Sci. 12(2): 243-266 (2015) - [j29]András Prékopa, Merve Unuvar:
Single Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables. Oper. Res. 63(6): 1512-1527 (2015) - 2013
- [j28]Jinwook Lee, András Prékopa:
Properties and calculation of multivariate risk measures: MVaR and MCVaR. Ann. Oper. Res. 211(1): 225-254 (2013) - [j27]Anh Ninh, András Prékopa:
Log-concavity of compound distributions with applications in stochastic optimization. Discret. Appl. Math. 161(18): 3017-3027 (2013) - [j26]Anh Ninh, András Prékopa:
The discrete moment problem with fractional moments. Oper. Res. Lett. 41(6): 715-718 (2013) - 2012
- [j25]András Prékopa:
Multivariate value at risk and related topics. Ann. Oper. Res. 193(1): 49-69 (2012) - [j24]István Deák, Imre Pólik, András Prékopa, Tamás Terlaky
Convex approximations in stochastic programming by semidefinite programming. Ann. Oper. Res. 200(1): 171-182 (2012) - 2011
- [j23]András Prékopa, Kunikazu Yoda, Munevver Mine Subasi
Uniform quasi-concavity in probabilistic constrained stochastic programming. Oper. Res. Lett. 39(3): 188-192 (2011)
2000 – 2009
- 2009
- [j22]Ersoy Subasi
On strong unimodality of multivariate discrete distributions. Discret. Appl. Math. 157(2): 234-246 (2009) - [r7]András Prékopa, Csaba I. Fábián:
Cutting-Stock Problem. Encyclopedia of Optimization 2009: 594-595 - [r6]András Prékopa:
Logconcave Measures, Logconvexity. Encyclopedia of Optimization 2009: 1925-1926 - [r5]András Prékopa:
Logconcavity of Discrete Distributions. Encyclopedia of Optimization 2009: 1926-1928 - [r4]András Prékopa:
Probabilistic Constrained Problems: Convexity Theory. Encyclopedia of Optimization 2009: 3087-3088 - [r3]András Prékopa:
Static Stochastic Programming Models. Encyclopedia of Optimization 2009: 3708-3710 - [r2]András Prékopa:
Static Stochastic Programming Models: Conditional Expectations. Encyclopedia of Optimization 2009: 3710-3711 - [r1]András Prékopa:
Stochastic Programming Models: Random Objective. Encyclopedia of Optimization 2009: 3782-3783 - 2007
- [j21]Xiaoling Hou, András Prékopa:
Monge Property and Bounding Multivariate Probability Distribution Functions with Given Marginals and Covariances. SIAM J. Optim. 18(1): 138-155 (2007) - 2006
- [j20]András Prékopa:
On the Hungarian inventory control model. Eur. J. Oper. Res. 171(3): 894-914 (2006) - 2005
- [j19]András Prékopa, Linchun Gao:
Bounding the probability of the union of events by aggregation and disaggregation in linear programs. Discret. Appl. Math. 145(3): 444-454 (2005) - [j18]Horand I. Gassmann, András Prékopa:
On stages and consistency checks in stochastic programming. Oper. Res. Lett. 33(2): 171-175 (2005) - 2004
- [j17]Gergely Mádi-Nagy, András Prékopa:
On Multivariate Discrete Moment Problems and Their Applications to Bounding Expectations and Probabilities. Math. Oper. Res. 29(2): 229-258 (2004) - [j16]András Prékopa, Xiaoling Hou:
A stochastic programming model to find optimal sample sizes to estimate unknown parameters in an LP. Oper. Res. Lett. 32(1): 59-67 (2004) - 2002
- [j15]Darinka Dentcheva, András Prékopa, Andrzej Ruszczynski:
Bounds for probabilistic integer programming problems. Discret. Appl. Math. 124(1-3): 55-65 (2002) - [j14]Csaba I. Fábián, András Prékopa, Olga Ruf-Fiedler:
On a dual method for a specially structured linear programming problem with application to stochastic programming. Optim. Methods Softw. 17(3): 445-492 (2002) - 2001
- [j13]József Bukszár, András Prékopa:
Probability Bounds with Cherry Trees. Math. Oper. Res. 26(1): 174-192 (2001) - [j12]András Prékopa:
On the concavity of multivariate probability distribution functions. Oper. Res. Lett. 29(1): 1-4 (2001) - 2000
- [j11]Darinka Dentcheva, András Prékopa, Andrzej Ruszczynski:
Concavity and efficient points of discrete distributions in probabilistic programming. Math. Program. 89(1): 55-77 (2000)
1990 – 1999
- 1999
- [j10]András Prékopa:
The use of discrete moment bounds in probabilisticconstrained stochastic programming models. Ann. Oper. Res. 85: 21-38 (1999) - 1995
- [j9]András Prékopa, Wenzhong Li:
Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function. Math. Program. 70: 1-16 (1995) - 1991
- [j8]András Prékopa, Endre Boros
On the Existence of a Feasible Flow in a Stochastic Transportation Network. Oper. Res. 39(1): 119-129 (1991) - 1990
- [j7]András Prékopa:
The discrete moment problem and linear programming. Discret. Appl. Math. 27(3): 235-254 (1990) - [j6]András Prékopa:
Sharp Bounds on Probabilities Using Linear Programming. Oper. Res. 38(2): 227-239 (1990) - [j5]András Prékopa:
Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution. ZOR Methods Model. Oper. Res. 34(6): 441-461 (1990)
1980 – 1989
- 1989
- [j4]Endre Boros
Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur. Math. Oper. Res. 14(2): 317-342 (1989) - [c1]András Prékopa, Endre Boros, Keh-Wei Lih:
The Use of Binomial Monments for Bounding Network Reliability. Reliability Of Computer And Communication Networks 1989: 197-212 - 1988
- [j3]András Prékopa:
Boole-Bonferroni Inequalities and Linear Programming. Oper. Res. 36(1): 145-162 (1988)
1970 – 1979
- 1973
- [j2]András Prékopa:
Contributions to the theory of stochastic programming. Math. Program. 4(1): 202-221 (1973) - 1972
- [j1]András Prékopa:
Laws of Large Numbers for Random Linear Programs. Math. Syst. Theory 6(3): 277-288 (1972)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: