Results 11 to 20 of about 2,808,560 (278)

Revisiting lagrange relaxation (LR) for processing large-scale mixed integer programming (MIP) problems [PDF]

open access: yes, 2004
Lagrangean Relaxation has been successfully applied to process many well known instances of NP-hard Mixed Integer Programming problems. In this paper we present a Lagrangean Relaxation based generic solver for processing Mixed Integer Programming ...
Siamitros, C, Mitra, G, Poojari, CA
core   +5 more sources

Non-convex mixed-integer nonlinear programming : a survey [PDF]

open access: yes, 2012
A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex, some quite effective exact and heuristic algorithms are ...
Burer, S   +3 more
core   +4 more sources

Cutting plane methods for general integer programming [PDF]

open access: yes, 1993
Integer programming (IP) problems are difficult to solve due to the integer restrictions imposed on them. A technique for solving these problems is the cutting plane method.
Mitra, G   +5 more
core   +6 more sources

Mixed-integer quadratic programming is in NP [PDF]

open access: yesMathematical Programming, 2016
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   +4 more sources

A fuzzy mixed integer programming for marketing planning [PDF]

open access: yesManagement Science Letters, 2014
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

On mixed-integer random convex programs [PDF]

open access: yes2012 IEEE 51st IEEE Conference on Decision and Control (CDC), 2012
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

A new interactive approach for solving fully fuzzy mixed integer linear programming [PDF]

open access: yesYugoslav Journal of Operations Research, 2020
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

Integer set reduction for stochastic mixed-integer programming

open access: yesComputational Optimization and Applications, 2023
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   +3 more sources

New variants of variable neighbourhood search for 0-1 mixed integer programming and clustering [PDF]

open access: yes, 2010
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Many real-world optimisation problems are discrete in nature.
Lazić, Jasmina
core   +7 more sources

Analyzing Infeasible Mixed-Integer and Integer Linear Programs [PDF]

open access: yesINFORMS Journal on Computing, 1999
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   +3 more sources

Home - About - Disclaimer - Privacy