convexity in nonlinear integer programming. ricerca oper. 53 , 3–44 (1990) google scholar fujishige, s.: bisubmodular polyhedra, simplicial divisions, and discrete convexity. discrete optim. 12 , 115–120
In addition, a nonlinear approach to consider friction losses in the modeling is introduced. The modeling is described by Mixed-Integer Linear (MILP) and Integer Nonlinear (MINLP) Programming models. The optimal solutions are provided by Outer Approximation (OA), Branch-and-Bound (BB), and ...
We present an algorithm for Mixed-Integer Nonlinear Programming (MINLP) problems in which the non-convexity in the objective and constraint functions is manifested as the sum of non-convex univariate functions. We employ a lower bounding convex MINLP relaxation obtained by approximating each non-...
integer programmingb, F)-convexityUnder (b, F)-convexity, (b, F)-concavity, (b, F)-pseudoconvexity and (b, F)-pseudoconcavity, appropriate duality results for Mond-Weir type first and second order symmetric dual nonlinear programming problems are established. These duality results are then ...
integerprogrammingMinimaxSelf-dualityF-convexityUnder second order F-convexity F-concavity and second order F-pseudoconvexity F-pseudoconcavity, appropriate second order duality results for pair of Wolfe and Mond–Weir type second order symmetric dual nonlinear programming problems are established. These ...
integer programmingmathematical programmingdiscrete convex functionreal convex functionA function with one integer variable is defined to be integer convex by Fox [3] and Denardo [1] if its second forward differences are positive. In this paper, condense discrete convexity of nonlinear discrete ...
Nonlinear programmingNumerical dataOptimizationProblem solvingSymmetryMixed integer nonlinear programs(MINLPs)Mixed integer linear programs(MILPs)Numerical optimization is a pervasive tool for planning and controlling physical systems. A small sample of applications using optimization includes blending and process...
Bector, C.R., Bector, M.K.: On various duality theorems for second order duality in nonlinear programming. Cahiers Centre Études Rech. Opér. 28(4), 283–292 (1986) MathSciNet MATH Google Scholar Bector, C.R., Chandra, S.: (Generalized)-bonvex functions and second order duality ...
integer programmingF-convexityUsual symmetric duality results are proved for Wolfe and Mond-Weir type nondifferentiable nonlinear symmetric dual programs under F-convexity F-concavity and F-pseudoconvexity F-pseudoconcavity assumptions. These duality results are then used to formulate Wolfe and Mond-Weir...