Minimax Programs and Bitonic Column Matrices

Paul A. Tucker and T. C. Hu
CS1999-0624
June 17, 1999

This report describes an optimization problem called a minimax program that is similar to a linear program, except that the addition operator is replaced by the maximum operator in the constraint inequalities. The relation of this problem to some well-known problems is clarified. An interesting special case, bitonic columns, is identified, and a new, efficient algorithm is presented for its solution. Also presented is an efficient algortihm for recognition of matrices with the bitonic columns property, which is an extension of the PQ-tree reduction algorithm.


How to view this document


The authors of these documents have submitted their reports to this technical report series for the purpose of non-commercial dissemination of scientific work. The reports are copyrighted by the authors, and their existence in electronic format does not imply that the authors have relinquished any rights. You may copy a report for scholarly, non-commercial purposes, such as research or instruction, provided that you agree to respect the author's copyright. For information concerning the use of this document for other than research or instructional purposes, contact the authors. Other information concerning this technical report series can be obtained from the Computer Science and Engineering Department at the University of California at San Diego, techreports@cs.ucsd.edu.


[ Search ]


NCSTRL
This server operates at UCSD Computer Science and Engineering.
Send email to webmaster@cs.ucsd.edu