A parametric characterization and an ε-approximation scheme for the minimization of a quasiconcave program

Discrete Applied Mathematics

Volumn 17, Issue 1-2, 1987, Pages 39-66

  Katoh, Naoki ^a   Ibaraki, Toshihide ^b  

^a UNIVERSITY OF HYOGO   (Japan)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL PROGRAMMING; MATHEMATICAL TECHNIQUES - APPROXIMATION THEORY;

MINIMIZATION; POLYNOMIAL TIME ALGORITHMS; POLYNOMIAL TIME APPROXIMATION SCHEMES; QUASICONCAVE FUNCTION; STOCHASTIC PROGRAMMING;

OPTIMIZATION;

EID: 0023344292     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(87)90006-0     Document Type: Article

References (34)

1. The complexity of some problems in parametric linear and combinatorial programming
2. On some nonlinear fractional programming
3. Solving bicriteria mathematical programming
4. A survey of methodology of the global minimization of concave functions subject to convex constraints
5. A successive underestimation method for concave minimization problems
6. Minimum spanning tree with normal variables as weights
7. Stochastic spanning tree problem
8. On some properties of programming problems in parametric forms pertaining to fractional programming
9. A stochastic programming model
10. A polynomial time algorithm for a chance-constrained single machine scheduling problem
11. An algorithm to compact a VLSI symbolic layout with mixed constraints
12. On finding most optimal rectangular package plans
13. Attempts to calculate global solutions to problems that may have local minima
14. Combinatorial optimization with rational objective functions
15. Algorithm for block placement with size optimization technique by linear programming approach
16. Computational complexity of parametric linear programming
17. Bicriteria quasiconcave programs
18. An algorithm for optimal two-dimensional compaction of VLSI layouts
19. An analytical algorithm for placement of arbitrarily sized rectangular blocks
20. C-programming problems: a class of non-linear optimization problems
21. Analysis of a class of proxy problems
22. C-programming: an outline
23. k
24. An optimal two-dimensional compaction scheme