The Kuhn-Tucker Theorem in Concave Programming

2013 ◽  
pp. 307-312 ◽  
Author(s):  
Hirofumi Uzawa
Keyword(s):  
Concave Programming

Effects of defense spending on the Texas economy: An example of concave programming

1984 ◽  
Vol 6 (4) ◽  
pp. 573-586 ◽  
Author(s):  
Sten Thore ◽  
George Kozmetsky ◽  
Michelle Burtis
Keyword(s):  
Defense Spending ◽  
Concave Programming

Concave Programming

2008 ◽  
pp. 462-466
Author(s):  
Harold P. Benson
Keyword(s):  
Concave Programming

scholarly journals Optimization Methods for Mixed Integer Weakly Concave Programming Problems

2014 ◽  
Vol 2 (2) ◽  
pp. 195-222 ◽  
Author(s):  
Zhi-you Wu ◽  
Fu-sheng Bai ◽  
Yong-jian Yang ◽  
Feng Jiang
Keyword(s):  
Optimization Methods ◽  
Mixed Integer ◽  
Concave Programming

scholarly journals On two problems over polyhedral convex sets

2015 ◽  
Vol 1 (1) ◽  
pp. 9-15
Author(s):  
Tran Vu Thieu
Keyword(s):  
Convex Sets ◽  
Convex Set ◽  
Linear Constraints ◽  
Concave Programming ◽  
Linear Equality ◽  
Polyhedral Convex ◽  
Polyhedral Convex Sets ◽  
Polyhedral Convex Set

In this paper, we are concerned with the following two problems often encountered in concave programming: Given the  vertices and extreme detections of a polyhedral convex set Modefined by a system of linear constraints, determine the vertices and  extreme directions of the polyhedral convex set  obtained from M just by adding one new linear equality (or inequality) constraint.Among the constraints of a given polyhedral convex set, find those which are redundant, i.e. which can be removed without affecting the polyhedral convex set.

Sign in / Sign up

Export Citation Format

Share Document