Results 1 to 10 of about 5,444 (211)
Mixed integer polynomial programming
AbstractThe mixed integer polynomial programming problem is reformulated as a multi-parametric programming problem by relaxing integer variables as continuous variables and then treating them as parameters. The optimality conditions for the resulting parametric programming problem are given by a set of simultaneous parametric polynomial equations which
Vivek Dua
exaly +3 more sources
Applications of Stochastic Mixed-Integer Second-Order Cone Optimization
Second-order cone programming problems are a tractable subclass of convex optimization problems that can be solved using polynomial algorithms. In the last decade, stochastic second-order cone programming problems have been studied, and efficient ...
Baha Alzalg, Hadjer Alioui
doaj +1 more source
Optimal training of integer-valued neural networks with mixed integer programming
Recent work has shown potential in using Mixed Integer Programming (MIP) solvers to optimize certain aspects of neural networks (NNs). However the intriguing approach of training NNs with MIP solvers is under-explored.
Tómas Thorbjarnarson, Neil Yorke-Smith
doaj +2 more sources
Integration of P-hub Location Problem and 3M Supply Chain [PDF]
The present study proposes an integrated model for hub location problem in a Multi-location, Multi-period, Multi-commodity (3M), three echelon supply chain. The problem is formulated as a mixed integer programming model and solved using GAMS software. As
M.B. Fakhrzad +3 more
doaj +2 more sources
On convergence in mixed integer programming [PDF]
ISSN:1436 ...
Alberto Del Pia, Robert Weismantel
openaire +3 more sources
With a growing percentage of elderly or disabled people in our society, the number of people not being able to drive a car themselves, or even to go by bus, increases, too. Specific services are required to address mobility demands, and dial-a-ride systems have been developed to provide an appropriate answer.
Jon Lee 0001, Adam N. Letchford
openaire +2 more sources
Mixed-integer quadratic programming is in NP [PDF]
Mixed-integer quadratic programming is the problem of optimizing a quadratic function over points in a polyhedral set where some of the components are restricted to be integral. In this paper, we prove that the decision version of mixed-integer quadratic programming is in NP, thereby showing that it is NP-complete.
Alberto Del Pia +2 more
openaire +2 more sources
An Optimal Generation Scheduling Approach Based on Linear Relaxation and Mixed Integer Programming
This paper proposes an optimal generation scheduling approach based on linear relaxation and mixed integer programming, which is used to solve the generation dispatch problem.
Yunkai Lei +5 more
doaj +1 more source
Exact solution approaches for the workload smoothing in assembly lines
In this paper, the problem of minimizing the smoothness index for an assembly line given a fixed cycle time and the number of workstations is studied. This problem which is known as the workload smoothing line balancing problem (WSLBP) is a mixed-integer
Derya Dinler, Mustafa Kemal Tural
doaj +1 more source
On mixed-integer random convex programs [PDF]
We consider a class of mixed-integer optimization problems subject to N randomly drawn convex constraints. We provide explicit bounds on the tails of the probability that the optimal solution found under these N constraints will become infeasible for the next random constraint.
Giuseppe Carlo Calafiore +2 more
openaire +2 more sources

