ms·1972년 5월 1일
Extreme Point Mathematical Programming
Michael Kirby, H. R. Love, Kanti Swarup
Management Science
30
피인용
9.7
FWCI
0
IS/마케팅/OM 탑저널 피인용
5
IS/마케팅/OM 탑저널 참고문헌
- 주제수리최적화 · 생산·최적화
01Abstract
The paper considers a class of optimization problems. The problems are linear programming problems: maximize cx subject to Ax = b with the additional constraint that x must also be an extreme point of a second convex polyhedron Dx = d, x ≧ 0. A cutting-plane algorithm for solving such problems is presented. Two numerical examples are also included.
02연구 흐름
불러오는 중…
03비슷한 논문
불러오는 중…
04이후 연구
불러오는 중…
05선행 연구
불러오는 중…
06서지 정보
- 저널Management Science · 18(9) · 540–549
- 토픽Optimization and Mathematical Programming · Control and Systems Engineering
- DOI10.1287/mnsc.18.9.540
- 저자Michael Kirby, H. R. Love, Kanti Swarup