In this study, we propose an exact method for optimizing a linear function over the efficient set of a multi-objective transportation problem (MOTP). This type of problem arises when a decision maker ...
O.A.Pavlov,M.Y.Kyselov,B.P.Palekha, AGGREGATED VOLUMETRIC-TEMPORARY PLANNING MODELS FOR ONE CLASS OF DISCREET PRODUCTION SYSTEMS. Optimization of schedules for discrete production systems with time ...
Linear programming (LP) solvers are crucial tools in various fields like logistics, finance, and engineering, due to their ability to optimize complex problems involving constraints and objectives.
$$ \max_{n_{ij}(t)} &&\sum_{i \in I} \sum_{j \in J_i}Q_ib({n_{ij}(t)}) + \sum_{i \in I}V_iw_{ij}\sum_{j\in J_i}\min({b(n_{ij}(t)) , Q_i- \sum_{k <j}b(n_{ik}(t))})a ...
1 Zero Hunger Lab, Tilburg School of Economics and Management, Tilburg University, Tilburg, Netherlands 2 Department of Econometrics and Operations Research, Tilburg School of Economics and Management ...
In this paper, a cubic objective programming problem (COPP) is defined. Introduced a new modification to solve a cubic objective programming problem. Suggested an algorithm for its solution. Also ...
CoSMoS Laboratory, Mechanical, Aerospace and Biomedical Engineering, University of Tennessee, Knoxville, TN, United States This work presents a heuristic for describing the next best view location for ...
一些您可能无法访问的结果已被隐去。
显示无法访问的结果