this paper proposes a new mathematical model for the integrated procurement-production-distribution problem of a fuzzy mixed integer linear programming (fmilp) type. considering the uncertainty in real problems, a number of parameters such as demand, capacity, and cost where their values are not available or known precisely, have been considered as trapezoidal fuzzy numbers. to solve fuzzy mixe...

Maximal covering problem (MCP) is classified as a linear integer optimization problem which can be effectively solved by integer programming technique. However, as the problem size grows, integer programming requires excessive time to get an optimal solution. This paper suggests a method for applying integer programming-based local search (IPbLS) to solve large-scale maximal covering problems. ...

In this paper, optimal control for stochastic linear quadratic singular neuro Takagi–Sugeno (T-S) fuzzy system with singular cost is obtained using genetic programming(GP). To obtain the optimal control, the solution of matrix Riccati differential equation (MRDE) is computed by solving differential algebraic equation (DAE) using a novel and nontraditional GP approach. The obtained solution in t...

Mixed-integer conic programming is a generalization of mixed-integer linear programming. In this paper, we present an extension of the duality theory for mixed-integer linear programming (see [4], [11]) to the case of mixed-integer conic programming. In particular, we construct a subadditive dual for mixed-integer conic programming problems. Under a simple condition on the primal problem, we ar...

For every fixed set F ⊆ {0, 1}n the following problems are strongly polynomial time equivalent: given a feasible point x ∈ F and a linear objective function c ∈ ZZn, • find a feasible point x∗ ∈ F that maximizes cx (Optimization), • find a feasible point x ∈ F with cx > cx (Augmentation), and • find a feasible point x ∈ F with cx > cx such that x − x is “irreducible” (Irreducible Augmentation)....

Stochastic integer programming problems combine the difficulty of stochastic programming with integer programming. In this article, we briefly review some of the challenges in solving two-stage stochastic integer programming problems, and discuss the research progress towards these challenges.

A pair of Wolfe type non-differentiable second order symmetric primal and dual problems in mathematical programming is formulated. The weak and strong duality theorems are then established under second order F-convexity assumptions. Symmetric minimax mixed integer primal and dual problems are also investigated. 2002 Elsevier Science B.V. All rights reserved.

A conic integer program is an integer programming problem with conic constraints. Conic integer programming has important applications in finance, engineering, statistical learning, and probabilistic integer programming. Here we study mixed-integer sets defined by second-order conic constraints. We describe general-purpose conic mixed-integer rounding cuts based on polyhedral conic substructure...