A finite cutting plane method for solving linear programs with an additional reverse convex constraint-Reference-Cited by-同舟云学术

A finite cutting plane method for solving linear programs with an additional reverse convex constraint

Published:1990-02 Issue:3 Volume:44 Page:395-409
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Fülöp János

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference34 articles.

1. Complementary geometric programming;Avriel;SIAM Journal on Applied Mathematics,1970

2. Disjunctive programming: Cutting planes from logical conditions;Balas,1975

3. Disjunctive programming;Balas;Annals of Discrete Mathematics,1979

4. Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study;Balas;Mathematical Programming,1980

5. Characterization of basic solutions for a class of nonconvex programs;Bansal;Journal of Optimization Theory and Applications,1975

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Intersection Disjunctions for Reverse Convex Sets;Mathematics of Operations Research;2021-10-01

2. Beyond Canonical DC-Optimization: The Single Reverse Polar Problem;Journal of Optimization Theory and Applications;2012-05-10

3. A new necessary and sufficient global optimality condition for canonical DC problems;Journal of Global Optimization;2012-04-29

4. A Deep-Cutting-Plane Technique for Reverse Convex Optimization;IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics);2011-08

5. Approximate optimality conditions and stopping criteria in canonical DC programming;Optimization Methods and Software;2010-02