Results 21 to 30 of about 40,629 (304)
Cutting planes in integer and mixed integer programming [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hugues Marchand +3 more
openaire +3 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
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
A fuzzy mixed integer programming for marketing planning [PDF]
One of the primary concerns to market a product is to find appropriate channel to target customers. The recent advances on information technology have created new products with tremendous opportunities.
Abolfazl Danaei +2 more
doaj +1 more source
A new interactive approach for solving fully fuzzy mixed integer linear programming [PDF]
In this paper, a novel method to solve Fully Fuzzy Mixed Integer Linear Programming (FFMILP) problems is presented. Our method is based on the definition of membership function and a fuzzy interactive technique for solving the classical multiobjective ...
Khalili Goudarzi Farzaneh +2 more
doaj +1 more source
Network Formulations of Mixed-Integer Programs [PDF]
We consider mixed-integer sets described by system of linear inequalities in which the constraint matrix A is totally unimodular; the right-hand side is arbitrary vector; and a subset of the variables is required to be integer. We show that the problem of checking nonemptiness of a set of this type is NP-complete, even in the case in which the linear ...
CONFORTI, MICHELANGELO +3 more
openaire +4 more sources
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
Integer set reduction for stochastic mixed-integer programming
Two-stage stochastic mixed-integer programming (SMIP) problems with general integer variables in the second-stage are generally difficult to solve. This paper develops the theory of integer set reduction for characterizing the subset of the convex hull of feasible integer points of the second-stage subproblem which can be used for solving the SMIP. The
Saravanan Venkatachalam, Lewis Ntaimo
openaire +2 more sources
Analyzing Infeasible Mixed-Integer and Integer Linear Programs [PDF]
Algorithms and computer-based tools for analyzing infeasible linear and nonlinear programs have been developed in recent years, but few such tools exist for infeasible mixed-integer or integer linear programs. One approach that has proven especially useful for infeasible linear programs is the isolation of an Irreducible Infeasible Set of constraints (
Olivier Guieu, John W. Chinneck
openaire +2 more sources
Automatic instantiation of a Variable Neighborhood Descent from a Mixed Integer Programming model
In this paper we describe the automatic instantiation of a Variable Neighborhood Descent procedure from a Mixed Integer Programming model. We extend a recent approach in which a single neighborhood structure is automatically designed from a Mixed Integer
Tommaso Adamo +3 more
doaj +1 more source

