نتایج جستجو برای: mixed integer linear programming

تعداد نتایج: 988648  

This paper aims to compare a two-echelon and a single-echelon distribution system. A mathematical model for the Single-Echelon Capacitated Vehicle Routing Problem (SE-CVRP) is proposed. This SE-CVRP is the counterpart of Two-Echelon Capacitated Vehicle Routing Problem (2E-CVRP) introduced in the authors’ previous work. The proposed mathematical model is Mixed-Integer Non-Linear Programming (MIN...

G. Tohidi, SH. Razavian

Multi-objective optimization is the simultaneous consideration of two or more objective functions that are completely or partially inconflict with each other. The optimality of such optimizations is largely defined through the Pareto optimality. Multiple objective integer linear programs (MOILP) are special cases of multiple criteria decision making problems. Numerous algorithms have been desig...

Journal: :journal of optimization in industrial engineering 2013
bahman naderi

this paper investigates the problem of selecting and scheduling a set of projects among available projects. each project consists of several tasks and to perform each one some resource is required. the objective is to maximize total benefit. the paper constructs a mathematical formulation in form of mixed integer linear programming model. three effective metaheuristics in form of the imperialis...

Journal: :Journal of Optimization Theory and Applications 2010

2016
Jianfeng Liu Anya Castillo Carl D. Laird

This paper addresses the globally optimal solution of the network-constrained unit commitment (NCUC) problem incorporating a nonlinear alternating current (AC) model of the transmission network. We formulate the NCUC as a mixed-integer quadratically constrained quadratic programming (MIQCQP) problem. A global optimization algorithm is developed based on a multi-tree approach that iterates betwe...

Journal: :SIAM Journal on Optimization 2013
Akshay Gupte Shabbir Ahmed Myun-Seok Cheon Santanu S. Dey

In this paper, we examine a mixed integer linear programming (MILP) reformulation for mixed integer bilinear problems where each bilinear term involves the product of a nonnegative integer variable and a nonnegative continuous variable. This reformulation is obtained by first replacing a general integer variable with its binary expansion and then using McCormick envelopes to linearize the resul...

Journal: :Annual Reviews in Control 2021

This paper presents a review of past and present results approaches in the area motion planning using MIP (Mixed-integer Programming). Although early 2000s was still seen with reluctance as method for solving planning-related problems, nowadays, due to increases computational power theoretical advances, its extensive modeling capabilities versatility are coming fore enjoy increased application ...

Journal: :Mathematical Programming 2011

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید