An Extensive Simplex Method for mapping global feasibility

Engineering Optimization

Volumn 35, Issue 2, 2003, Pages 165-176

  Zhu, Liang ^a   Kazmer, David ^b  

^a University of Massachusetts   (United States)

^b University of Massachusetts   (United States)

Author keywords

Decision making; Extensive Simplex Method; Extreme points; Global feasible space; Multi attribute design

Indexed keywords

ALGORITHMS; ENGINEERING EDUCATION; GRAPH THEORY; LINEAR PROGRAMMING; SYSTEMS ANALYSIS;

ENGINEERING DESIGN;

DECISION MAKING;

EID: 0038296198     PISSN: 0305215X     EISSN: None     Source Type: Journal    
DOI: 10.1080/0305215032000077050     Document Type: Article

References (13)

1. Hazelrigg, G. A. (1998). A framework for decision-based engineering design. Journal of Mechanical Design, 120, 653-658.
2. Keeney, R. L. and Raiffa, H. (1993). Decisions with Multiple Objectives: Preferences and Value Tradeoffs, Cambridge University Press.
3. Saaty, T. L. (1990). How to make a decision: The analytic hierarchy process. European Journal of OperationalResearch, 48(1), 9-26.
4. Chernikova, N. V. (1965). Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities. USSR Computational Mathematics and Mathematical Physics, 5(2), 228-233.
5. Steuer, R. E. (1994). Random problem generation and the computation of efficient extreme points in multiple objective linear programming. Computational Optimization and Applications, 3, 333-347.
6. Steuer, R. E. (2000). ADBASE: A Multiple Objective Linear Programming Solver for Efficient Extreme Points and Unbounded Efficient Edges. Terry College of Business, University of Georgia, Athens, Georgia.
7. Zhu, L. and Kazmer, D. (2001). A performance-based representation for engineering design. ASME Journal of Mechanical Design, 124(4), 486-493.
8. Press, W. H., et al. (1992). Numerical Recipes in C: the Art of Scientific Computing, 2nd ed., Cambridge University Press.
9. Dantzig, G. B. (1998). Linear Programming and Extensions, 16th ed., Princeton University Press.
10. Berenguer, S. E. and Smith, R. L. (1986). Expected number of extreme points of a random linear program. Mathematical Programming, 35, 129-134.
11. Smale, S. (1983). On the average number of steps of the simplex method of linear programming. Mathematical Programming, 27, 241-262.
12. Zhu, L. and Kazmer, D. Synthesis of engineering decisions with an evolving feasible space. Submitted to Research in Engineering.
13. Zhu, L. (2001). A Performance-Based Representation for Engineering Design. In Department of Mechanical and Industrial Engineering. 2001, University of Massachusetts, Amherst, p. 195.