Suchergebnisse - Mixed-integer bilinear programming problem

A branch-and-cut algorithm for Mixed-Integer Bilinear Programming von Fischetti, Matteo, Monaci, Michele

“… •We consider the Mixed-Integer Bilinear Programming problem.•We design an exact branch-and-cut algorithm, based on a new branching rule …”
Volltext

An efficient projection neural network for solving bilinear programming problems von Effati, Sohrab, Mansoori, Amin, Eshaghnezhad, Mohammad

“… In fact, some interesting reformulations of BLP and mixed-integer bilinear programming problem (MIBLP …”
Volltext

Reduction of the two-step problem of stochastic optimal control with bilinear model to the problem of mixed integer linear programming von Kibzun, A. I., Ignatov, A. N.

“… The problems of maximizing the upper and lower estimates of the probability functional were reduced to the problems of mixed integer linear programming by means of discretizing the probabilistic measure …”
Volltext

Solving Mixed Integer Bilinear Problems Using MILP Formulations von Gupte, Akshay, Ahmed, Shabbir, Cheon, Myun Seok, Dey, Santanu

“… In this paper, we examine a mixed integer linear programming reformulation for mixed integer bilinear problems where each bilinearterm involves the product of a nonnegative integer variable …”
Volltext

Linear Temporal Logic-based Mixed-Integer Linear Problem Planning with the Koopman Operator von Tokuda, Shumpei, Yamakita, Masaki, Oyama, Hiroyuki, Takano, Rin

“… However, since the lifted bilinear systems are nonlinear, we need to solve nonlinear programming problems for trajectory optimization …”
Volltext

Mixed integer bilinear programming with applications to the pooling problem von Gupte, Akshay

“… This dissertation studies mixed integer bilinear programming (MIBLP) problems, which form a class of optimization problems defined …”
Volltext

Continuous-time modeling and global optimization approach for scheduling of crude oil operations von Li, Jie, Misener, Ruth, Floudas, Christodoulos A.

“… The mathematical modeling of blending different crudes in storage tanks results in many bilinear terms, which transforms the problem into a challenging, nonconvex, and mixed …”
Volltext

Univariate parameterization for global optimization of mixed-integer polynomial problems von Teles, João P., Castro, Pedro M., Matos, Henrique A.

“… This paper presents a new relaxation technique to globally optimize mixed-integer polynomial programming problems that arise in many engineering and management contexts …”
Volltext

MINLP formulations for solving strip packing problems in LCD mother glass production von Park, Kyung Tae, Kim, Hansol, Lee, Soobin, Lee, Ho-Kyung, Ryu, Jun-hyung, Lee, In-Beum

“… This problem is a non-convex mixed integer nonlinear programming (MINLP) problem due to the bilinear terms in the demand and objective function …”
Volltext

An Improved Spatial Branch-and-Bound Algorithm for Non-Convex Optimal Electricity-Gas Flow von Liu, Pengxiang, Wu, Zhi, Gu, Wei, Lu, Yuping

“… In this paper, an improved spatial branch-and-bound algorithm is proposed to solve the non-convex problem, which is formulated as a mixed-integer bilinear programming, for its exact solution …”
Volltext

Global optimization of general non-convex problems with intermediate bilinear substructures von Zorn, Keith, Sahinidis, Nikolaos V.

“… This work considers the global optimization of general non-convex nonlinear and mixed-integer nonlinear programming (MINLP …”
Volltext

Scheduling of crude oil operations under demand uncertainty: A robust optimization framework coupled with global optimization von Li, Jie, Misener, Ruth, Floudas, Christodoulos A.

“… % of the refinery turnover. The mathematical modeling of blending different crudes in storage tanks results in many bilinear terms, which transform the problem into a challenging, nonconvex, mixed …”
Volltext

Global optimization of a combinatorially complex generalized pooling problem von Meyer, Clifford A., Floudas, Christodoulos A.

“… The continuous relaxation of this mixed integer nonlinear programming problem is nonconvex because of the presence of bilinear terms in the constraint functions …”
Volltext

Joint Routing and Charging Problem of Multiple Electric Vehicles: A Fast Optimization Algorithm von Yao, Canqi, Chen, Shibo, Yang, Zaiyue

“… of EV and revenue from serving customers. This joint problem is formulated as a mixed integer programming (MIP …”
Volltext

Strong Group Fair Classification via Optimal Transport and Mixed-Integer Linear Programming von Tao, Yuan, Chen, Caihua, Jiang, Suhong, Wang, Qingyang

Volltext

Dynamic adjustment strategy of electric bus operations: A spatial branch-and-bound method with acceleration techniques von Yuan, Yin, Li, Shukai, D’Ariano, Andrea, Bosi, Tommaso, Yang, Lixing

“… We propose a mixed-integer nonlinear programming model for each decision stage, explicitly considering factors such as vehicle overtaking, passenger load, capacity limitations, and charging behaviors …”
Volltext

Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems von Castro, Pedro M.

“… A key element for the global optimization of non-convex mixed-integer bilinear problems is the computation of a tight lower bound for the objective function being minimized …”
Volltext

Optimizing bilinear multi-source water supply systems using mixed-integer linear programming approximations: An analysis of the Israeli seawater desalination array von Housh, Mashor

“… •Global optimization of multisource water supply systems can be achieved through mixed integer linear programing …”
Volltext

Decomposition for adjustable robust linear optimization subject to uncertainty polytope von Ayoub, Josette, Poss, Michael

“… –min problem as done in recent works. Applying the Farkas lemma, we can reformulate the separation problem as a bilinear program, which is then linearized to obtained a mixed-integer linear programming formulation …”
Volltext

On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations von Bärmann, Andreas, Burlacu, Robert, Hager, Lukas, Kleinert, Thomas

“… One approach to tackle this difficulty is to use bivariate piecewise linear approximations for each variable product, which can be represented via mixed-integer linear programming (MIP) formulations …”
Volltext