Duality Theorems for Non-Convex Mixed Integer Programming Problems

International Journal of Computing and Optimization
doi 10.12988/ijco.2016.5927
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Hikari, Ltd.

Related search

Duality Theorems for Convex Programming Without Constraint Qualification

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1984English

Multiobjective Duality for Convex Semidefinite Programming Problems

Zeitschrift fur Analysis und ihre Anwendung
Applied MathematicsAnalysis
2003English

Chvátal Closures for Mixed Integer Programming Problems

Mathematical Programming, Series B
MathematicsSoftware
1990English

On Duality Theory for Non-Convex Semidefinite Programming

Annals of Operations Research
Management ScienceDecision SciencesOperations Research
2011English

An Exact Penalty Approach for Mixed Integer Nonlinear Programming Problems

American Journal of Operations Research
2011English

Duality Theorems for Convex and Quasiconvex Set Functions

SN Operations Research Forum
2020English

Algebraic Duality Theorems for Infinite LP Problems

Linear Algebra and Its Applications
Numerical AnalysisAlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTopology
2011English

A Branch-And-Bound Algorithm for Zero-One Mixed Integer Programming Problems

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1971English

Constraint Logic Programming for Non Convex NLP and MINLP Problems

IFAC Proceedings Volumes
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy