Direct Search Techniques for Mixed Stochastic Nonlinear Programming Model
DOI:
10.33395/sinkron.v8i3.12542Keywords:
Stochastic Programming, Nonlinear Programming, Transportation, Scenario FormationAbstract
Stochastic programming is a methodology utilized for the purpose of achieving optimal planning and decision-making outcomes when faced with uncertain data. The subject of investigation pertains to a stochastic optimization problem wherein the results of stochastic data are not disclosed during runtime, and the optimization of the decision does not necessitate foresight into forthcoming outcomes. This establishes a strong correlation with the imperative need for immediate optimization in uncertain data settings, enabling effective decision-making in the present moment. The present study introduces a novel methodology for achieving global optimization of the model for nonlinear mixed-stochastic programming problem. The present study centers on stochastic problems that are two-staged and entail non-linearities in both the objective function and constraints. The first stage variables are discrete in nature, whereas the second stage variables are a combination of continuous and mixed types. Scenario-based representations are utilized for formulating problems. The fundamental approach to address the non-linear mixed-stochastic programming problem involves converting the model into a deterministic non-linear mixed-count program that is equivalent in form. The feasibility of this proposition stems from the discrete distribution assumption of uncertainty, which can be represented by a limited set of scenarios. The magnitude of the model size will increase significantly due to the quantity of scenarios and time horizons involved. The utilization of filtered probability space in conjunction with data mining techniques will be employed for the purpose of scenario generation. The methodology employed for addressing nonlinear mixed-integer programming problems of significant scale involves elevating the value of a non-basic variable beyond its boundaries in order to compel a basis variable to attain a cumulative value. Subsequently, the problem is simplified by maintaining a constant count variable and modifying it incrementally in discrete intervals to achieve an optimal solution at a global level.
Downloads
References
Agustin, Mawengkang, H., & Mathelinea, D. (2018). Decision Model for Planning and Scheduling of Seafood Product Considering Traceability. IOP Conference Series: Materials Science and Engineering, 300(1). https://doi.org/10.1088/1757-899X/300/1/012018
Ahmed, S., Shapiro, A., & Shapiro, E. (2002). The sample average approximation method for stochastic programs with integer recourse. Submitted for Publication, 1–24.
Ahmed, S., Tawarmalani, M., & Sahinidis, N. V. (2004). A finite branch-and-bound algorithm for two-stage stochastic integer programs. Mathematical Programming, 100(2), 355–377.
Albornoz, V. M., & Canales, C. M. (2006). Total allowable catch for managing squat lobster fishery using stochastic nonlinear programming. Computers & Operations Research, 33(8), 2113–2124.
Bastin, F., Cirillo, C., & Toint, P. L. (2010). Formulation and solution strategies for nonparametric nonlinear stochastic programmes with an application in finance. Optimization, 59(3), 355–376.
Carøe, C. C., & Schultz, R. (1999). Dual decomposition in stochastic integer programming. Operations Research Letters, 24(1–2), 37–45.
Diwekar, U. (2005). Green process design, industrial ecology, and sustainability: A systems analysis perspective. Resources, Conservation and Recycling, 44(3), 215–235.
Diwekar, U. M. (2003). Optimization under uncertainty in chemical engineering. PROCEEDINGS-INDIAN NATIONAL SCIENCE ACADEMY PART A, 69(3/4), 267–284.
Goel, V., & Grossmann, I. E. (2004). A stochastic programming approach to planning of offshore gas field developments under uncertainty in reserves. Computers & Chemical Engineering, 28(8), 1409–1429.
Goyal, V., & Ierapetritou, M. G. (2004a). Deterministic framework for robust modular design with integrated-demand data analysis. Industrial & Engineering Chemistry Research, 43(21), 6813–6821.
Goyal, V., & Ierapetritou, M. G. (2007). Stochastic MINLP optimization using simplicial approximation. Computers & Chemical Engineering, 31(9), 1081–1087.
Goyal, V., & Ierapetritou, M. G. (2004b). MINLP optimization using simplicial approximation method for classes of non-convex problems. Frontiers in Global Optimization, 165–195.
Haneveld, W. K. K., Stougie, L., & van der Vlerk, M. H. (1996). An algorithm for the construction of convex hulls in simple integer recourse programming. Annals of Operations Research, 64, 67–81.
Huang, K., & Ahmed, S. (2009). The value of multistage stochastic programming in capacity planning under uncertainty. Operations Research, 57(4), 893–904.
Iqbal, M., Zarlis, M., Tulus, T., & Mawengkang, H. (2020). Model Pendekatan Metaheuristik Dalam Penyelesaian optimisasi Kombinatorial. Seminar Nasional Teknologi Komputer & Sains (SAINTEKS), 1(1), 92–97.
Jung, J. Y., Blau, G., Pekny, J. F., Reklaitis, G. V, & Eversdyk, D. (2004). A simulation based optimization approach to supply chain management under demand uncertainty. Computers & Chemical Engineering, 28(10), 2087–2106.
Karuppiah, R., & Grossmann, I. E. (2008). Global optimization of multiscenario mixed integer nonlinear programming models arising in the synthesis of integrated water networks under uncertainty. Computers & Chemical Engineering, 32(1–2), 145–160.
Kheawhom, S., & Hirao, M. (2004). Decision support tools for environmentally benign process design under uncertainty. Computers & Chemical Engineering, 28(9), 1715–1723.
Laporte, G., & Louveaux, F. V. (1993). The integer L-shaped method for stochastic integer programs with complete recourse. Operations Research Letters, 13(3), 133–142.
Lin, X., Janak, S. L., & Floudas, C. A. (2004). A new robust optimization approach for scheduling under uncertainty:: I. Bounded uncertainty. Computers & Chemical Engineering, 28(6–7), 1069–1085.
Liu, C., Fan, Y., & Ordóñez, F. (2009). A two-stage stochastic programming model for transportation network protection. Computers & Operations Research, 36(5), 1582–1590.
Løkketangen, A., & Woodruff, D. L. (1996). Progressive hedging and tabu search applied to mixed integer (0, 1) multistage stochastic programming. Journal of Heuristics, 2, 111–128.
Lulli, G., & Sen, S. (2004). A branch-and-price algorithm for multistage stochastic integer programming with application to stochastic batch-sizing problems. Management Science, 50(6), 786–796.
Plambeck, E. L., Fu, B.-R., Robinson, S. M., & Suri, R. (1996). Sample-path optimization of convex stochastic performance functions. Mathematical Programming, 75(2), 137–176.
Rockafellar, R. T., & Wets, R. J.-B. (1991). Scenarios and policy aggregation in optimization under uncertainty. Mathematics of Operations Research, 16(1), 119–147.
Rubinstein, R. Y., & Shapiro, A. (1990). Optimization of static simulation models by the score function method. Mathematics and Computers in Simulation, 32(4), 373–392.
Ryu, J.-H., Dua, V., & Pistikopoulos, E. N. (2004). A bilevel programming framework for enterprise-wide process networks under uncertainty. Computers & Chemical Engineering, 28(6–7), 1121–1129.
Sahinidis, N. V. (2004). Optimization under uncertainty: state-of-the-art and opportunities. Computers & Chemical Engineering, 28(6–7), 971–983.
Schultz, R., Stougie, L., & Van Der Vlerk, M. H. (1998). Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis. Mathematical Programming, 83, 229–252.
Schultz, R., & Tiedemann, S. (2003). Risk aversion via excess probabilities in stochastic programs with mixed-integer recourse. SIAM Journal on Optimization, 14(1), 115–138.
Sen, S., & Higle, J. L. (2000). The C3 theorem and a D2 algorithm for large scale stochastic integer programming: Set convexification. Stochastic E-Print Series.
Sherali, H. D., & Fraticelli, B. M. P. (2002). A modification of Benders’ decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse. Journal of Global Optimization, 22(1), 319–342.
Simanjuntak, E., Simarmata, G., & Mawengkang, H. (2006). A feasible neighborhood heuristic search for solving portfolio optimization problems with var and expected shortfall. Proceedings of the 2nd IMT-GT Regional Conference on Mathematics Statistics and Applications Universities Sains Malaysia Penang, 1–7.
Takriti, S., Birge, J. R., & Long, E. (1996). A stochastic model for the unit commitment problem. IEEE Transactions on Power Systems, 11(3), 1497–1508.
Widyasari, R., & Mawengkang, H. (2012). ENVIRONMENTAL-CONSTRAINED ENERGY PLANNING USING ENERGY-EFFICIENCY AND DISTRIBUTED-GENERATION FACILITIES. Bulletin of Mathematics, 4(01), 79–90.
Downloads
|
How to Cite
Issue
Section
License
Copyright (c) 2023 Ilyas Tanjung, Herman Mawengkang, Sawaluddin
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Muhammad Khoiruddin harahap
Google Scholar 
Moraref
PKP Index
Garuda Kemdikbud
Indonesia OneSearch
OCLC Worldcat
Dimensions
Index Copernicus
Scilit
