Optimization of linear-convex programs

DOI10.1080/02331939408843961zbMath0818.90091OpenAlexW2047042439MaRDI QIDQ3835613

Shokri Z. Selim

Publication date: 17 August 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939408843961

zbMATH Keywords

global optimizationconvexity cutsextreme point methodsfacial cutslinear-convex programs

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the solution of bilinear programming problems by reduction to concave minimization
• Quasi-concave minimization subject to linear constraints
• Nonconvex Quadratic Programming via Generalized Polars
• Location-Allocation Problems
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints
• A cutting plane algorithm for solving bilinear programs
• Bilinear programming: An exact algorithm
• A cutting plane algorithm for the bilinear programming problem
• Polyhedral convexity cuts and negative edge extensions
• The Theory of Max-Min, with Applications
• The Transportation-Location Problem
• Polaroids: A new tool in non‐convex and in integer programming
• Convexity Cuts and Cut Search

This page was built for publication: Optimization of linear-convex programs